HOME





Sperner Family N=2
Emanuel Sperner (9 December 1905 – 31 January 1980) was a German mathematician, best known for two theorems. He was born in Waltdorf (near Neiße, Upper Silesia, now Nysa, Poland), and died in Sulzburg-Laufen, West Germany. He was a student at Carolinum in Nysa and then Hamburg University where his advisor was Wilhelm Blaschke. He was appointed Professor in Königsberg in 1934, and subsequently held posts in a number of universities until 1974. Sperner's theorem, from 1928, says that the size of an antichain in the power set of an ''n''-set (a Sperner family) is at most the middle binomial coefficient(s). It has several proofs and numerous generalizations, including the Sperner property of a partially ordered set. Sperner's lemma, from 1928, states that every Sperner coloring of a triangulation of an ''n''-dimensional simplex contains a cell colored with a complete set of colors. It was proven by Sperner to provide an alternate proof of a theorem of Lebesgue characterizing ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Prusinowice, Opole Voivodeship
Prusinowice (German ''Waltdorf'') is a village in the administrative district of Gmina Pakosławice, within Nysa County, Opole Voivodeship, in south-western Poland. It lies approximately east of Pakosławice, north-east of Nysa, and west of the regional capital Opole. Notable residents * Emanuel Sperner Emanuel Sperner (9 December 1905 – 31 January 1980) was a German mathematician, best known for two theorems. He was born in Waltdorf (near Neiße, Upper Silesia, now Nysa, Poland), and died in Sulzburg-Laufen, West Germany. He was a student a ... (1905–1980), German mathematician References Villages in Nysa County {{Nysa-geo-stub ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Theorem
In mathematics and formal logic, a theorem is a statement (logic), statement that has been Mathematical proof, proven, or can be proven. The ''proof'' of a theorem is a logical argument that uses the inference rules of a deductive system to establish that the theorem is a logical consequence of the axioms and previously proved theorems. In mainstream mathematics, the axioms and the inference rules are commonly left implicit, and, in this case, they are almost always those of Zermelo–Fraenkel set theory with the axiom of choice (ZFC), or of a less powerful theory, such as Peano arithmetic. Generally, an assertion that is explicitly called a theorem is a proved result that is not an immediate consequence of other known theorems. Moreover, many authors qualify as ''theorems'' only the most important results, and use the terms ''lemma'', ''proposition'' and ''corollary'' for less important theorems. In mathematical logic, the concepts of theorems and proofs have been formal system ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Simplex
In geometry, a simplex (plural: simplexes or simplices) is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example, * a 0-dimensional simplex is a point, * a 1-dimensional simplex is a line segment, * a 2-dimensional simplex is a triangle, * a 3-dimensional simplex is a tetrahedron, and * a 4-dimensional simplex is a 5-cell. Specifically, a -simplex is a -dimensional polytope that is the convex hull of its vertices. More formally, suppose the points u_0, \dots, u_k are affinely independent, which means that the vectors u_1 - u_0,\dots, u_k-u_0 are linearly independent. Then, the simplex determined by them is the set of points C = \left\. A regular simplex is a simplex that is also a regular polytope. A regular -simplex may be constructed from a regular -simplex by connecting a new vertex to all original vertices by the common ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Triangulation (geometry)
In geometry, a triangulation is a subdivision of a plane (geometry), planar object into triangles, and by extension the subdivision of a higher-dimension geometric object into simplex, simplices. Triangulations of a three-dimensional volume would involve subdividing it into tetrahedra packed together. In most instances, the triangles of a triangulation are required to meet edge-to-edge and vertex-to-vertex. Types Different types of triangulations may be defined, depending both on what geometric object is to be subdivided and on how the subdivision is determined. * A triangulation T of \mathbb^d is a subdivision of \mathbb^d into d-dimensional simplices such that any two simplices in T intersect in a common face (a simplex of any lower dimension) or not at all, and any bounded set in \mathbb^d intersects only finite set, finitely many simplices in T. That is, it is a locally finite simplicial complex that covers the entire space. * A point-set triangulation, i.e., a triangulation ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Sperner Coloring
In mathematics, Sperner's lemma is a combinatorial result on colorings of triangulations, analogous to the Brouwer fixed point theorem, which is equivalent to it. It states that every Sperner coloring (described below) of a triangulation of an simplex contains a cell whose vertices all have different colors. The initial result of this kind was proved by Emanuel Sperner, in relation with proofs of invariance of domain. Sperner colorings have been used for effective computation of fixed points and in root-finding algorithms, and are applied in fair division (cake cutting) algorithms. According to the Soviet ''Mathematical Encyclopaedia'' (ed. I.M. Vinogradov), a related 1929 theorem (of Knaster, Borsuk and Mazurkiewicz) had also become known as the ''Sperner lemma'' – this point is discussed in the English translation (ed. M. Hazewinkel). It is now commonly known as the Knaster–Kuratowski–Mazurkiewicz lemma. Statement One-dimensional case In one dimension, Sperner' ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Sperner Property Of A Partially Ordered Set
In order theory, order-theoretic mathematics, a graded poset, graded partially ordered set is said to have the Sperner property (and hence is called a Sperner poset), if no antichain within it is larger than the largest rank level (one of the sets of elements of the same rank) in the poset.. Since every rank level is itself an antichain, the Sperner property is equivalently the property that some rank level is a maximum antichain. The Sperner property and Sperner posets are named after Emanuel Sperner, who proved Sperner's theorem stating that the powerset, family of all subsets of a finite set (partially ordered by set inclusion) has this property. The lattice of partitions of a finite set typically lacks the Sperner property. Variations A ''k''-Sperner poset is a graded poset in which no union of ''k'' antichains is larger than the union of the ''k'' largest rank levels, or, equivalently, the poset has a maximum k-family consisting of ''k'' rank levels. A strict Sperner poset i ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Binomial Coefficient
In mathematics, the binomial coefficients are the positive integers that occur as coefficients in the binomial theorem. Commonly, a binomial coefficient is indexed by a pair of integers and is written \tbinom. It is the coefficient of the term in the polynomial expansion of the binomial power ; this coefficient can be computed by the multiplicative formula : \binom nk = \frac, which using factorial notation can be compactly expressed as : \binom = \frac. For example, the fourth power of is : \begin (1 + x)^4 &= \tbinom x^0 + \tbinom x^1 + \tbinom x^2 + \tbinom x^3 + \tbinom x^4 \\ &= 1 + 4x + 6 x^2 + 4x^3 + x^4, \end and the binomial coefficient \tbinom =\tfrac = \tfrac = 6 is the coefficient of the term. Arranging the numbers \tbinom, \tbinom, \ldots, \tbinom in successive rows for gives a triangular array called Pascal's triangle, satisfying the recurrence relation : \binom = \binom + \binom . The binomial coefficients occur in many areas of mathematics, and espe ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Sperner Family
In combinatorics, a Sperner family (or Sperner system; named in honor of Emanuel Sperner), or clutter, is a family ''F'' of subsets of a finite set ''E'' in which none of the sets contains another. Equivalently, a Sperner family is an antichain in the inclusion lattice over the power set of ''E''. A Sperner family is also sometimes called an independent system or irredundant set. Sperner families are counted by the Dedekind numbers, and their size is bounded by Sperner's theorem and the Lubell–Yamamoto–Meshalkin inequality. They may also be described in the language of hypergraphs rather than set families, where they are called clutters. Dedekind numbers The number of different Sperner families on a set of ''n'' elements is counted by the Dedekind numbers, the first few of which are :2, 3, 6, 20, 168, 7581, 7828354, 2414682040998, 56130437228687557907788 . Although accurate asymptotic estimates are known for larger values of ''n'', it is unknown whether there exists ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Power Set
In mathematics, the power set (or powerset) of a set is the set of all subsets of , including the empty set and itself. In axiomatic set theory (as developed, for example, in the ZFC axioms), the existence of the power set of any set is postulated by the axiom of power set. The powerset of is variously denoted as , , , \mathbb(S), or . Any subset of is called a ''family of sets'' over . Example If is the set , then all the subsets of are * (also denoted \varnothing or \empty, the empty set or the null set) * * * * * * * and hence the power set of is . Properties If is a finite set with the cardinality (i.e., the number of all elements in the set is ), then the number of all the subsets of is . This fact as well as the reason of the notation denoting the power set are demonstrated in the below. : An indicator function or a characteristic function of a subset of a set with the cardinality is a function from to the two-element set , denoted as , ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Antichain
In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable. The size of the largest antichain in a partially ordered set is known as its width. By Dilworth's theorem, this also equals the minimum number of chains (totally ordered subsets) into which the set can be partitioned. Dually, the height of the partially ordered set (the length of its longest chain) equals by Mirsky's theorem the minimum number of antichains into which the set can be partitioned. The family of all antichains in a finite partially ordered set can be given join and meet operations, making them into a distributive lattice. For the partially ordered system of all subsets of a finite set, ordered by set inclusion, the antichains are called Sperner families and their lattice is a free distributive lattice, with a Dedekind number of elements. More generally, counting the number of antichains of a finite ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Königsberg
Königsberg (; ; ; ; ; ; , ) is the historic Germany, German and Prussian name of the city now called Kaliningrad, Russia. The city was founded in 1255 on the site of the small Old Prussians, Old Prussian settlement ''Twangste'' by the Teutonic Knights during the Northern Crusades, Baltic Crusades. It was named in honour of King Ottokar II of Bohemia, who led a campaign against the pagan Old Prussians, a Baltic tribe. A Baltic Sea, Baltic port city, it successively became the capital of the State of the Teutonic Order, the Duchy of Prussia and the provinces of East Prussia and Province of Prussia, Prussia. Königsberg remained the coronation city of the Prussian monarchy from 1701 onwards, though the capital was Berlin. From the thirteenth to the twentieth centuries on, the inhabitants spoke predominantly German language, German, although the city also had a profound influence upon the Lithuanian and Polish cultures. It was a publishing center of Lutheranism, Lutheran literatu ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Hamburg University
The University of Hamburg (, also referred to as UHH) is a public research university in Hamburg, Germany. It was founded on 28 March 1919 by combining the previous General Lecture System ('' Allgemeines Vorlesungswesen''), the Hamburg Colonial Institute ('' Hamburgisches Kolonialinstitut''), and the Academic College ('' Akademisches Gymnasium''). The main campus is located in the central district of Rotherbaum, with affiliated institutes and research centres distributed around the city-state. Seven Nobel Prize winners and one Wolf Prize winner are affiliated with UHH. History Founding At the beginning of the 20th century, wealthy individuals made several unsuccessful petitions to the Hamburg Senate and Parliament requesting the establishment of a university. Senator Werner von Melle worked towards the merging of existing institutions into one university, but this plan failed. Much of the establishment wanted to see Hamburg limited to its role as a trading center, and wer ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]