|
Roswitha Blind
Roswitha Blind (also published as Roswitha Hammer) is a German mathematician, specializing in convex geometry, discrete geometry, and polyhedral combinatorics, and a politician and organizer for the Social Democratic Party of Germany in Stuttgart. Mathematics As Roswitha Hammer, Blind completed a Ph.D. in 1974 at the University of Stuttgart. Her dissertation, ''Über konvexe Strukturen und die Beziehungen zur elementaren Konvexität'', concerned convex geometry and discrete geometry and was supervised by Kurt Leichtweiss. She is best known in mathematics for a 1987 publication with Peter Mani-Levitska in which, solving a conjecture of Micha Perles, she and Mani-Levitska proved that the combinatorial structure of simple polytopes is completely determined by their graphs. This result has been called the Blind–Mani theorem or the Perles–Blind–Mani theorem. In a 1979 publication, she introduced a class of convex polytopes sometimes called the Blind polytopes, generalizing the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Geometry
In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas: computational geometry, convex analysis, discrete geometry, functional analysis, geometry of numbers, integral geometry, linear programming, probability theory, game theory, etc. Classification According to the Mathematics Subject Classification MSC2010, the mathematical discipline ''Convex and Discrete Geometry'' includes three major branches: * general convexity * polytopes and polyhedra * discrete geometry (though only portions of the latter two are included in convex geometry). General convexity is further subdivided as follows: *axiomatic and generalized convexity *convex sets without dimension restrictions *convex sets in topological vector spaces *convex sets in 2 dimensions (including convex curves) *convex sets in 3 dimensions (including convex surfaces) *convex sets in ''n'' dimensions (including convex hy ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Johnson Solid
In geometry, a Johnson solid is a strictly convex polyhedron each face of which is a regular polygon. There is no requirement that isohedral, each face must be the same polygon, or that the same polygons join around each Vertex (geometry), vertex. An example of a Johnson solid is the square-based Pyramid (geometry), pyramid with equilateral sides (square pyramid, ); it has 1 square face and 4 triangular faces. Some authors require that the solid not be uniform polyhedron, uniform (i.e., not Platonic solid, Archimedean solid, prism (geometry), uniform prism, or uniform antiprism) before they refer to it as a “Johnson solid”. As in any strictly convex solid, at least three faces meet at every vertex, and the total of their angles is less than 360 degrees. Since a regular polygon has angles at least 60 degrees, it follows that at most five faces meet at any vertex. The pentagonal pyramid () is an example that has a degree-5 vertex. Although there is no obvious restriction tha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
University Of Stuttgart Alumni
A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, the designation is reserved for colleges that have a graduate school. The word ''university'' is derived from the Latin ''universitas magistrorum et scholarium'', which roughly means "community of teachers and scholars". The first universities were created in Europe by Catholic Church monks. The University of Bologna (''Università di Bologna''), founded in 1088, is the first university in the sense of: *Being a high degree-awarding institute. *Having independence from the ecclesiastic schools, although conducted by both clergy and non-clergy. *Using the word ''universitas'' (which was coined at its foundation). *Issuing secular and non-secular degrees: grammar, rhetoric, logic, theology, canon law, notarial law.Hunt Janin: "The university ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
German Women Mathematicians
German(s) may refer to: * Germany (of or related to) **Germania (historical use) * Germans, citizens of Germany, people of German ancestry, or native speakers of the German language ** For citizens of Germany, see also German nationality law **Germanic peoples (Roman times) * German language **any of the Germanic languages * German cuisine, traditional foods of Germany People * German (given name) * German (surname) * Germán, a Spanish name Places * German (parish), Isle of Man * German, Albania, or Gërmej * German, Bulgaria * German, Iran * German, North Macedonia * German, New York, U.S. * Agios Germanos, Greece Other uses * German (mythology), a South Slavic mythological being * Germans (band), a Canadian rock band * "German" (song), a 2019 song by No Money Enterprise * ''The German'', a 2008 short film * "The Germans", an episode of ''Fawlty Towers'' * ''The German'', a nickname for Congolese rebel André Kisase Ngandu See also * Germanic (other) * Germa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Living People
Related categories * :Year of birth missing (living people) / :Year of birth unknown * :Date of birth missing (living people) / :Date of birth unknown * :Place of birth missing (living people) / :Place of birth unknown * :Year of death missing / :Year of death unknown * :Date of death missing / :Date of death unknown * :Place of death missing / :Place of death unknown * :Missing middle or first names See also * :Dead people * :Template:L, which generates this category or death years, and birth year and sort keys. : {{DEFAULTSORT:Living people 21st-century people People by status ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Year Of Birth Missing (living People)
A year or annus is the orbital period of a planetary body, for example, the Earth, moving in its orbit around the Sun. Due to the Earth's axial tilt, the course of a year sees the passing of the seasons, marked by change in weather, the hours of daylight, and, consequently, vegetation and soil fertility. In temperate and subpolar regions around the planet, four seasons are generally recognized: spring, summer, autumn and winter. In tropical and subtropical regions, several geographical sectors do not present defined seasons; but in the seasonal tropics, the annual wet and dry seasons are recognized and tracked. A calendar year is an approximation of the number of days of the Earth's orbital period, as counted in a given calendar. The Gregorian calendar, or modern calendar, presents its calendar year to be either a common year of 365 days or a leap year of 366 days, as do the Julian calendars. For the Gregorian calendar, the average length of the calendar year (the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aequationes Mathematicae
''Aequationes Mathematicae'' is a mathematical journal. It is primarily devoted to functional equations, but also publishes papers in dynamical systems, combinatorics, and geometry. As well as publishing regular journal submissions on these topics, it also regularly reports on international symposia on functional equations and produces bibliographies on the subject. János Aczél founded the journal in 1968 at the University of Waterloo, in part because of the long publication delays of up to four years in other journals at the time of its founding. It is currently published by Springer Science+Business Media, with Zsolt Páles of the University of Debrecen as its editor in chief. János Aczél remains its honorary editor in chief. it was listed as a second-quartile mathematics journal by SCImago Journal Rank The SCImago Journal Rank (SJR) indicator is a measure of the prestige of scholarly journals that accounts for both the number of citations received by a journal and th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Polytope
In mathematics, a regular polytope is a polytope whose symmetry group acts transitively on its flags, thus giving it the highest degree of symmetry. All its elements or -faces (for all , where is the dimension of the polytope) — cells, faces and so on — are also transitive on the symmetries of the polytope, and are regular polytopes of dimension . Regular polytopes are the generalized analog in any number of dimensions of regular polygons (for example, the square or the regular pentagon) and regular polyhedra (for example, the cube). The strong symmetry of the regular polytopes gives them an aesthetic quality that interests both non-mathematicians and mathematicians. Classically, a regular polytope in dimensions may be defined as having regular facets (-faces) and regular vertex figures. These two conditions are sufficient to ensure that all faces are alike and all vertices are alike. Note, however, that this definition does not work for abstract polytopes. A reg ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Semiregular Polytope
In geometry, by Thorold Gosset's definition a semiregular polytope is usually taken to be a polytope that is vertex-transitive and has all its facets being regular polytopes. E.L. Elte compiled a longer list in 1912 as ''The Semiregular Polytopes of the Hyperspaces'' which included a wider definition. Gosset's list In three-dimensional space and below, the terms ''semiregular polytope'' and ''uniform polytope'' have identical meanings, because all uniform polygons must be regular. However, since not all uniform polyhedra are regular, the number of semiregular polytopes in dimensions higher than three is much smaller than the number of uniform polytopes in the same number of dimensions. The three convex semiregular 4-polytopes are the rectified 5-cell, snub 24-cell and rectified 600-cell. The only semiregular polytopes in higher dimensions are the ''k''21 polytopes, where the rectified 5-cell is the special case of ''k'' = 0. These were all listed by Gosset, but a proof of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Geometry
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object. Discrete geometry has a large overlap with convex geometry and computational geometry, and is closely related to subjects such as finite geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology. History Although polyhedra and tessellations had been studied for many years by people such as Kepler and Cauchy, modern discrete geometry has its origins in the late 19th century. Early topics studie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean space \mathbb^n. Most texts. use the term "polytope" for a bounded convex polytope, and the word "polyhedron" for the more general, possibly unbounded object. Others''Mathematical Programming'', by Melvyn W. Jeter (1986) p. 68/ref> (including this article) allow polytopes to be unbounded. The terms "bounded/unbounded convex polytope" will be used below whenever the boundedness is critical to the discussed issue. Yet other texts identify a convex polytope with its boundary. Convex polytopes play an important role both in various branches of mathematics and in applied areas, most notably in linear programming. In the influential textbooks of Grünbaum and Ziegler on the subject, as well as in many other texts in discrete geometry, convex polytopes are often simply called "polytopes". Grünbaum points out that this is solely to avoi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
_-_09.JPG "Click for more on -> University Of Stuttgart Alumni")
