Olof Hanner
   HOME
*





Olof Hanner
Olof Hanner (7 December 1922 in Stockholm – 19 September 2015 in Gothenburg) was a Swedish mathematician. Education and career Hanner earned his Ph.D. from Stockholm University in 1952. He was a professor at the University of Gothenburg from 1963 to 1989. Contributions In a 1956 paper, Hanner introduced the Hanner polytopes and the Hanner spaces having these polytopes as their metric balls. Hanner was interested in a Helly property of these shapes, later used to characterize them by : unlike other convex polytopes, it is not possible to find three translated copies of a Hanner polytope that intersect pairwise but do not have a point of common intersection. Subsequently, the Hanner polytopes formed a class of important examples for the Mahler conjecture and for Kalai's 3''d'' conjecture. In another paper from the same year, Hanner proved a set of inequalities related to the uniform convexity of ''L''''p'' spaces, now known as Hanner's inequalities. Other contributions of Hanne ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Stockholm
Stockholm () is the Capital city, capital and List of urban areas in Sweden by population, largest city of Sweden as well as the List of urban areas in the Nordic countries, largest urban area in Scandinavia. Approximately 980,000 people live in the Stockholm Municipality, municipality, with 1.6 million in the Stockholm urban area, urban area, and 2.4 million in the Metropolitan Stockholm, metropolitan area. The city stretches across fourteen islands where Mälaren, Lake Mälaren flows into the Baltic Sea. Outside the city to the east, and along the coast, is the island chain of the Stockholm archipelago. The area has been settled since the Stone Age, in the 6th millennium BC, and was founded as a city in 1252 by Swedish statesman Birger Jarl. It is also the county seat of Stockholm County. For several hundred years, Stockholm was the capital of Finland as well (), which then was a part of Sweden. The population of the municipality of Stockholm is expected to reach o ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Hans Rådström
Hans Vilhem Rådström (1919–1970) was a Swedish mathematician who worked on complex analysis, continuous groups, convex sets, set-valued analysis, and game theory. From 1952, he was ''lektor'' (assistant professor) at Stockholm University, and from 1969, he was Professor of Applied Mathematics at Linköping University. Early life Hans Rådström was the son of the writer and editor Karl Johan Rådström, and the elder brother of the writer and journalist Pär Rådström. Rådström studied mathematics and obtained his Ph.D. under the joint supervision of Torsten Carleman and Fritz Carlson. His early work pertained to the theory of functions of a complex variable, particularly, complex dynamics. He was appointed ''lektor'' (assistant professor) at Stockholm University in 1952. Later, he was associated with the Royal Institute of Technology in Stockholm. In 1952 he became co-editor of the Scandinavian popular-mathematics journal ''Nordisk Matematisk Tidskrift''. He als ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


2015 Deaths
This is a list of deaths of notable people, organised by year. New deaths articles are added to their respective month (e.g., Deaths in ) and then linked here. 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 1993 1992 1991 1990 1989 1988 1987 See also * Lists of deaths by day The following pages, corresponding to the Gregorian calendar, list the historical events, births, deaths, and holidays and observances of the specified day of the year: Footnotes See also * Leap year * List of calendars * List of non-standard ... * Deaths by year {{DEFAULTSORT:deaths by year ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


1922 Births
Nineteen or 19 may refer to: * 19 (number), the natural number following 18 and preceding 20 * one of the years 19 BC, AD 19, 1919, 2019 Films * ''19'' (film), a 2001 Japanese film * ''Nineteen'' (film), a 1987 science fiction film Music * 19 (band), a Japanese pop music duo Albums * ''19'' (Adele album), 2008 * ''19'', a 2003 album by Alsou * ''19'', a 2006 album by Evan Yo * ''19'', a 2018 album by MHD * ''19'', one half of the double album ''63/19'' by Kool A.D. * ''Number Nineteen'', a 1971 album by American jazz pianist Mal Waldron * ''XIX'' (EP), a 2019 EP by 1the9 Songs * "19" (song), a 1985 song by British musician Paul Hardcastle. * "Nineteen", a song by Bad4Good from the 1992 album '' Refugee'' * "Nineteen", a song by Karma to Burn from the 2001 album ''Almost Heathen''. * "Nineteen" (song), a 2007 song by American singer Billy Ray Cyrus. * "Nineteen", a song by Tegan and Sara from the 2007 album '' The Con''. * "XIX" (song), a 2014 song by Slipkn ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




WorldCat
WorldCat is a union catalog that itemizes the collections of tens of thousands of institutions (mostly libraries), in many countries, that are current or past members of the OCLC global cooperative. It is operated by OCLC, Inc. Many of the OCLC member libraries collectively maintain WorldCat's database, the world's largest bibliographic database. The database includes other information sources in addition to member library collections. OCLC makes WorldCat itself available free to libraries, but the catalog is the foundation for other subscription OCLC services (such as resource sharing and collection management). WorldCat is used by librarians for cataloging and research and by the general public. , WorldCat contained over 540 million bibliographic records in 483 languages, representing over 3 billion physical and digital library assets, and the WorldCat persons dataset (Data mining, mined from WorldCat) included over 100 million people. History OCLC OCLC, Inc., doing bus ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Barry Rigal
Barry Rigal (born 1958) is a bridge player, author, commentator and journalist. Born in England, he was married to world champion Sue Picus and lives in New York. Rigal has represented England in the Camrose Trophy Home International series five times and won the Gold Cup; he was a multiple winner of the Spring Fours and Tollemache Trophy. Rigal has been a Vugraph commentator for thirty years and chief commentator for the European Bridge League (EBL) and World Bridge Federation (WBF) since 2006. He has been an executive member of the International Bridge Press Association (IBPA) since the early 1990s and was appointed President in September 2016. Publications Rigal edited ''Bridge for Dummies'', was co-editor of the seventh edition and a contributing editor of the sixth edition of ''The Official Encyclopedia of Bridge'' and author of ''Card Games for Dummies''. Rigal has written for the ''World Championship Book'' for two decades. Rigal's books include a series called ''Br ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Cut-the-Knot
Alexander Bogomolny (January 4, 1948 July 7, 2018) was a Soviet-born Israeli-American mathematician. He was Professor Emeritus of Mathematics at the University of Iowa, and formerly research fellow at the Moscow Institute of Electronics and Mathematics, senior instructor at Hebrew University and software consultant at Ben Gurion University. He wrote extensively about arithmetic, probability, algebra, geometry, trigonometry and mathematical games. He was known for his contribution to heuristics and mathematics education, creating and maintaining the mathematically themed educational website ''Cut-the-Knot'' for the Mathematical Association of America (MAA) Online. He was a pioneer in mathematical education on the internet, having started ''Cut-the-Knot'' in October 1996.Interview with Alexander ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Pythagorean Tiling
A Pythagorean tiling or two squares tessellation is a tiling of a Euclidean plane by squares of two different sizes, in which each square touches four squares of the other size on its four sides. Many proofs of the Pythagorean theorem are based on it, explaining its name. It is commonly used as a pattern for floor tiles. When used for this, it is also known as a hopscotch pattern or pinwheel pattern, but it should not be confused with the mathematical pinwheel tiling, an unrelated pattern. This tiling has four-way rotational symmetry around each of its squares. When the ratio of the side lengths of the two squares is an irrational number such as the golden ratio, its cross-sections form aperiodic sequences with a similar recursive structure to the Fibonacci word. Generalizations of this tiling to three dimensions have also been studied. Topology and symmetry The Pythagorean tiling is the unique tiling by squares of two different sizes that is both ''unilateral'' (no two ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Pythagorean Theorem
In mathematics, the Pythagorean theorem or Pythagoras' theorem is a fundamental relation in Euclidean geometry between the three sides of a right triangle. It states that the area of the square whose side is the hypotenuse (the side opposite the right angle) is equal to the sum of the areas of the squares on the other two sides. This theorem can be written as an equation relating the lengths of the sides ''a'', ''b'' and the hypotenuse ''c'', often called the Pythagorean equation: :a^2 + b^2 = c^2 , The theorem is named for the Greek philosopher Pythagoras, born around 570 BC. The theorem has been proven numerous times by many different methods – possibly the most for any mathematical theorem. The proofs are diverse, including both geometric proofs and algebraic proofs, with some dating back thousands of years. When Euclidean space is represented by a Cartesian coordinate system in analytic geometry, Euclidean distance satisfies the Pythagorean relation: the squared dist ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Go (game)
Go is an abstract strategy board game for two players in which the aim is to surround more territory than the opponent. The game was invented in China more than 2,500 years ago and is believed to be the oldest board game continuously played to the present day. A 2016 survey by the International Go Federation's 75 member nations found that there are over 46 million people worldwide who know how to play Go and over 20 million current players, the majority of whom live in East Asia. The playing pieces are called stones. One player uses the white stones and the other, black. The players take turns placing the stones on the vacant intersections (''points'') of a board. Once placed on the board, stones may not be moved, but stones are removed from the board if the stone (or group of stones) is surrounded by opposing stones on all orthogonally adjacent points, in which case the stone or group is ''captured''. The game proceeds until neither player wishes to make another move. Wh ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Go And Mathematics
The game of Go is one of the most popular games in the world. As a result of its elegant and simple rules, the game has long been an inspiration for mathematical research. Shen Kuo, an 11th century Chinese scholar, estimated in his ''Dream Pool Essays'' that the number of possible board positions is around 10172. In more recent years, research of the game by John H. Conway led to the invention of the surreal numbers and contributed to development of combinatorial game theory (with Go Infinitesimals being a specific example of its use in Go). Computational complexity Generalized Go is played on ''n'' × ''n'' boards, and the computational complexity of determining the winner in a given position of generalized Go depends crucially on the ko rules. Go is “almost” in PSPACE, since in normal play, moves are not reversible, and it is only through capture that there is the possibility of the repeating patterns necessary for a harder complexity. Without ko Without ko, Go is PSPACE ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Combinatorial Game Theory
Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information. Study has been largely confined to two-player games that have a ''position'' that the players take turns changing in defined ways or ''moves'' to achieve a defined winning condition. Combinatorial game theory has not traditionally studied games of chance or those that use imperfect or incomplete information, favoring games that offer perfect information in which the state of the game and the set of available moves is always known by both players. However, as mathematical techniques advance, the types of game that can be mathematically analyzed expands, thus the boundaries of the field are ever changing. Scholars will generally define what they mean by a "game" at the beginning of a paper, and these definitions often vary as they are specific to the game being analyzed and are not meant to represent the entire scope of the field. C ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]