Eulerian Poset
   HOME
*





Eulerian Poset
In combinatorial mathematics, an Eulerian poset is a graded poset in which every nontrivial interval has the same number of elements of even rank as of odd rank. An Eulerian poset which is a lattice is an Eulerian lattice. These objects are named after Leonhard Euler. Eulerian lattices generalize face lattices of convex polytopes and much recent research has been devoted to extending known results from polyhedral combinatorics, such as various restrictions on ''f''-vectors of convex simplicial polytopes, to this more general setting. Examples * The face lattice of a convex polytope, consisting of its faces, together with the smallest element, the empty face, and the largest element, the polytope itself, is an Eulerian lattice. The odd–even condition follows from Euler's formula. * Any simplicial generalized homology sphere is an Eulerian lattice. * Let ''L'' be a regular cell complex such that , ''L'', is a manifold with the same Euler characteristic as the sphere of the same ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Combinatorics
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is gra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

N-sphere
In mathematics, an -sphere or a hypersphere is a topological space that is homeomorphic to a ''standard'' -''sphere'', which is the set of points in -dimensional Euclidean space that are situated at a constant distance from a fixed point, called the ''center''. It is the generalization of an ordinary sphere in the ordinary three-dimensional space. The "radius" of a sphere is the constant distance of its points to the center. When the sphere has unit radius, it is usual to call it the unit -sphere or simply the -sphere for brevity. In terms of the standard norm, the -sphere is defined as : S^n = \left\ , and an -sphere of radius can be defined as : S^n(r) = \left\ . The dimension of -sphere is , and must not be confused with the dimension of the Euclidean space in which it is naturally embedded. An -sphere is the surface or boundary of an -dimensional ball. In particular: *the pair of points at the ends of a (one-dimensional) line segment is a 0-sphere, *a circle, which i ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Abstract Polytope
In mathematics, an abstract polytope is an algebraic partially ordered set which captures the dyadic property of a traditional polytope without specifying purely geometric properties such as points and lines. A geometric polytope is said to be a ''realization'' of an abstract polytope in some real N-dimensional space, typically Euclidean. This abstract definition allows more general combinatorial structures than traditional definitions of a polytope, thus allowing new objects that have no counterpart in traditional theory. Introductory concepts Traditional versus abstract polytopes In Euclidean geometry, two shapes that are not similar can nonetheless share a common structure. For example a square and a trapezoid both comprise an alternating chain of four vertices and four sides, which makes them quadrilaterals. They are said to be isomorphic or “structure preserving”. This common structure may be represented in an underlying abstract polytope, a purely algebra ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Dehn–Sommerville Equations
In mathematics, the Dehn–Sommerville equations are a complete set of linear relations between the numbers of faces of different dimension of a simplicial polytope. For polytopes of dimension 4 and 5, they were found by Max Dehn in 1905. Their general form was established by Duncan Sommerville in 1927. The Dehn–Sommerville equations can be restated as a symmetry condition for the ''h''-vector'' of the simplicial polytope and this has become the standard formulation in recent combinatorics literature. By duality, analogous equations hold for simple polytopes. Statement Let ''P'' be a ''d''-dimensional simplicial polytope. For ''i'' = 0, 1, ..., ''d'' − 1, let ''f''''i'' denote the number of ''i''-dimensional faces of ''P''. The sequence : f(P)=(f_0,f_1,\ldots,f_) is called the ''f''-vector of the polytope ''P''. Additionally, set : f_=1, f_d=1. Then for any ''k'' = −1, 0, ..., ''d'' − 2, the following Dehn–Sommerville equation ho ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


H-vector
In algebraic combinatorics, the ''h''-vector of a simplicial polytope is a fundamental invariant of the polytope which encodes the number of faces of different dimensions and allows one to express the Dehn–Sommerville equations in a particularly simple form. A characterization of the set of ''h''-vectors of simplicial polytopes was conjectured by Peter McMullen and proved by Lou Billera and Carl W. Lee and Richard Stanley ( ''g''-theorem). The definition of ''h''-vector applies to arbitrary abstract simplicial complexes. The ''g''-conjecture stated that for simplicial spheres, all possible ''h''-vectors occur already among the ''h''-vectors of the boundaries of convex simplicial polytopes. It was proven in December 2018 by Karim Adiprasito. Stanley introduced a generalization of the ''h''-vector, the toric ''h''-vector, which is defined for an arbitrary ranked poset, and proved that for the class of Eulerian posets, the Dehn–Sommerville equations continue to hold. A different ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Ranked Poset
In mathematics, a ranked partially ordered set or ranked poset may be either: * a graded poset, or * a poset with the property that for every element ''x'', all maximal chains among those with ''x'' as greatest element have the same finite length, or * a poset in which all maximal chains have the same finite length. The second definition differs from the first in that it requires all minimal elements to have the same rank; for posets with a least element, however, the two requirements are equivalent. The third definition is even more strict in that it excludes posets with infinite chains and also requires all maximal elements to have the same rank. Richard P. Stanley Richard Peter Stanley (born June 23, 1944) is an Emeritus Professor of Mathematics at the Massachusetts Institute of Technology, in Cambridge, Massachusetts. From 2000 to 2010, he was the Norman Levinson Professor of Applied Mathematics. He r ... defines a graded poset of length ''n'' as one in which all maximal ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Richard P
Richard is a male given name. It originates, via Old French, from Frankish language, Old Frankish and is a Compound (linguistics), compound of the words descending from Proto-Germanic language, Proto-Germanic ''*rīk-'' 'ruler, leader, king' and ''*hardu-'' 'strong, brave, hardy', and it therefore means 'strong in rule'. Nicknames include "Richie", "Dick (nickname), Dick", "Dickon", "Dickie (name), Dickie", "Rich (given name), Rich", "Rick (given name), Rick", "Rico (name), Rico", "Ricky (given name), Ricky", and more. Richard is a common English, German and French male name. It's also used in many more languages, particularly Germanic, such as Norwegian, Danish, Swedish, Icelandic, and Dutch, as well as other languages including Irish, Scottish, Welsh and Finnish. Richard is cognate with variants of the name in other European languages, such as the Swedish "Rickard", the Catalan "Ricard" and the Italian "Riccardo", among others (see comprehensive variant list below). People ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Incidence Algebra
In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for every locally finite partially ordered set and commutative ring with unity. Subalgebras called reduced incidence algebras give a natural construction of various types of generating functions used in combinatorics and number theory. Definition A locally finite poset is one in which every closed interval : 'a, b''= is finite. The members of the incidence algebra are the functions ''f'' assigning to each nonempty interval 'a, b''a scalar ''f''(''a'', ''b''), which is taken from the ''ring of scalars'', a commutative ring with unity. On this underlying set one defines addition and scalar multiplication pointwise, and "multiplication" in the incidence algebra is a convolution defined by :(f*g)(a, b)=\sum_f(a, x)g(x, b). An incidence algebra is finite-dimensional if and only if the underlying poset is finite. Related concepts An incidence algebra is analogous to a group algebr ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Bruhat Order
In mathematics, the Bruhat order (also called strong order or strong Bruhat order or Chevalley order or Bruhat–Chevalley order or Chevalley–Bruhat order) is a partial order on the elements of a Coxeter group, that corresponds to the inclusion order on Schubert varieties. History The Bruhat order on the Schubert varieties of a flag manifold or a Grassmannian was first studied by , and the analogue for more general semisimple algebraic groups was studied by . started the combinatorial study of the Bruhat order on the Weyl group, and introduced the name "Bruhat order" because of the relation to the Bruhat decomposition introduced by François Bruhat. The left and right weak Bruhat orderings were studied by . Definition If (''W'', ''S'') is a Coxeter system with generators ''S'', then the Bruhat order is a partial order on the group ''W''. Recall that a reduced word for an element ''w'' of ''W'' is a minimal length expression of ''w'' as a product of elements of ''S'', and the ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Coxeter Group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 . Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac–Moody algebras. Standard ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Poset
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a Set (mathematics), set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable. Informal definition A partial order defines a notion of Comparability, comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x''  ''y'', ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Manifold
In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a neighborhood that is homeomorphic to an open subset of n-dimensional Euclidean space. One-dimensional manifolds include lines and circles, but not lemniscates. Two-dimensional manifolds are also called surfaces. Examples include the plane, the sphere, and the torus, and also the Klein bottle and real projective plane. The concept of a manifold is central to many parts of geometry and modern mathematical physics because it allows complicated structures to be described in terms of well-understood topological properties of simpler spaces. Manifolds naturally arise as solution sets of systems of equations and as graphs of functions. The concept has applications in computer-graphics given the need to associate pictures with coordinates (e.g ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]