Supersolvable lattices
From MaRDI portal
Publication:2558874
Cites work
- scientific article; zbMATH DE number 3127542 (Why is no real title available?)
- scientific article; zbMATH DE number 3137403 (Why is no real title available?)
- scientific article; zbMATH DE number 3136688 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- scientific article; zbMATH DE number 3420754 (Why is no real title available?)
- A Contribution to the Theory of Groups of Prime-Power Order
- Modular elements of geometric lattices
- Modularity in the theory of lattices
- Natural Partial Orders
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Ordered structures and partitions
- THE EULERIAN FUNCTIONS OF A GROUP
- The Tutte polynomial
- Théorie géométrique des polynômes eulériens
- q-Bernoulli and Eulerian Numbers
Cited in
(only showing first 100 items - show all)- Minimal paths between maximal chains in finite rank semimodular lattices
- Koszulness and supersolvability for Dirichlet arrangements
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Supersolvability and the Koszul property of root ideal arrangements
- Diameter of graphs of reduced words and galleries.
- A note on linear extensions of irreducible elements in a finite lattice
- For Which Finite Groups G is the Lattice ℒ(G) of Subgroups Gorenstein?
- An Inequality for the Möbius Function of a Geometric Lattice
- Modular elements of higher-weight Dowling lattices
- The lattice of closure relations on a poset
- Diagrams and rectangular extensions of planar semimodular lattices
- Supersolvable LL-lattices of binary trees
- A characterization of signed graphs with generalized perfect elimination orderings
- Extended linial hyperplane arrangements for root systems and a conjecture of Postnikov and Stanley
- Pattern-avoiding polytopes
- Supersolvable simplicial arrangements
- A generalization of Sylow's third theorem
- Varieties of Combinatorial Geometries
- A lexicographic shellability characterization of geometric lattices
- A homotopy complementation formula for partially ordered sets
- The Varchenko-Gel'fand ring of a cone
- Rank-metric lattices
- Arrangements of ideal type
- Addition-deletion theorems for factorizations of Orlik-Solomon algebras and nice arrangements
- Dowling group geometries and the critical problem
- Supersolvable saturated matroids and chordal graphs
- The morphology of partially ordered sets
- Congruences derived from group action
- Counting chambers in restricted Coxeter arrangements
- Derivation modules of orthogonal duals of hyperplane arrangements
- Free subarrangements of Shi arrangements
- scientific article; zbMATH DE number 3931075 (Why is no real title available?)
- Combinatorial polar orderings and recursively orderable arrangements
- Cohomology of Local Sheaves on Arrangement Lattices
- Some combinatorial and algebraic properties of Coxeter complexes and Tits buildings
- A modular characterization of supersolvable lattices
- Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)
- \(SB\)-labelings and posets with each interval homotopy equivalent to a sphere or a ball
- Modular flats of oriented matroids and poset quasi-fibrations
- Nice reflection arrangements.
- Posets of shuffles
- Parallel connections and bundles of arrangements
- Chains of modular elements and shellability
- A new subgroup lattice characterization of finite solvable groups.
- Irreducible representations of semisimple algebraic groups and supersolvable lattices.
- The Bernardi formula for nontransitive deformations of the braid arrangement
- Supersolvable frame-matroid and graphic-lift lattices
- On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture
- A probabilistic scheme of independent random elements distributed over a finite lattice. II: The method of lattice moments
- Binomial posets, Möbius inversion, and permutation enumeration
- Möbius functions of lattices
- On an explicit correspondence between \(nbc\)-basis, chambers and minimal complex for real supersolvable arrangements
- The noncrossing bond poset of a graph
- Connectivity of \(h\)-complexes.
- Fiber-type arrangements and factorization properties
- Hyperplane arrangements with a lattice of regions
- A homological characterization for freeness of multi-arrangements
- Modular elements in the lattice \(L(A)\) when \(A\) is a real reflection arrangement.
- Optimum basis of finite convex geometry
- Free arrangements of hyperplanes and supersolvable lattices
- A generalization of semimodular supersolvable lattice
- Relational lattices: from databases to universal algebra
- Flag-accurate arrangements
- Whitney numbers of some geometric lattices
- A basis for the top homology of a generalized partition lattice
- On valuations, the characteristic polynomial, and complex subspace arrangements
- Biased expansions of biased graphs and their chromatic polynomials
- Broken circuit complexes: Factorizations and generalizations
- Increasing spanning forests in graphs and simplicial complexes
- Factorizations of the Orlik-Solomon algebras
- Chains of modular elements and lattice connectivity
- Extremality, left-modularity and semidistributivity
- On graphic arrangement groups
- The number of slim rectangular lattices.
- Surmise relations between tests -- preliminary results of the mathematical modeling
- A construction of semisimple tensor categories
- Whitney numbers of the second kind of finite modular lattices
- Factored arrangements of hyperplanes
- Pattern-avoiding polytopes
- Lattices of parabolic subgroups in connection with hyperplane arrangements
- Nice restrictions of reflection arrangements
- Coxeter multiarrangements with quasi-constant multiplicities
- Shelling the \(m=1\) amplituhedron
- Characteristic polynomials of the weak order on classical and affine Coxeter groups
- Two flags in a semimodular lattice generate an antimatroid
- Supersolvable posets and fiber-type abelian arrangements
- On the Cohen-Macaulay connectivity of supersolvable lattices and the homotopy type of posets
- Left-modular elements of lattices
- Supersolvable reflection arrangements.
- Combinatorics of inductively factored arrangements
- Chordal matroids arising from generalized parallel connections
- Cohomology of a real toric variety and shellability of posets arising from a graph
- Supersolvability and freeness for \(\psi\)-graphical arrangements
- Catenarian FCP ring extensions
- Finite lattices and Jordan-Hölder sets
- Mappings of subspaces into subsets
- Basic derivations for subarrangements of Coxeter arrangements
- The sorting order on a Coxeter group.
- EL-labelings, supersolvability and 0-Hecke algebra actions on posets
- An abstraction of Whitney's broken circuit theorem
This page was built for publication: Supersolvable lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558874)
