Supersolvable lattices

From MaRDI portal
Revision as of 06:37, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2558874

DOI10.1007/BF02945028zbMath0256.06002OpenAlexW2405154940MaRDI QIDQ2558874

Richard P. Stanley

Publication date: 1972

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02945028




Related Items (only showing first 100 items - show all)

Diagrams and rectangular extensions of planar semimodular latticesShelling the \(m=1\) amplituhedronLower central series and free resolutions of hyperplane arrangementsFor Which Finite Groups G is the Lattice ℒ(G) of Subgroups Gorenstein?Antichain cutsets of strongly connected posetsThe number of slim rectangular lattices.Unnamed ItemMatroid Representations and free ArrangementsSupersolvable reflection arrangementsSign-Coherent Identities for Characteristic Polynomials of MatroidsWhitney Numbers of Combinatorial Geometries and Higher-Weight Dowling LatticesDiscrete Morse functions from lexicographic ordersOptimum basis of finite convex geometryBalanced Cohen-Macaulay ComplexesUnnamed ItemRecent topics of arrangements of hyperplanesNice restrictions of reflection arrangements\(SB\)-labelings and posets with each interval homotopy equivalent to a sphere or a ballFrom the weak Bruhat order to crystal posetsExtremality, left-modularity and semidistributivitySupersolvable simplicial arrangementsMAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labelingSupersolvable saturated matroids and chordal graphsModular flats of oriented matroids and poset quasi-fibrationsCohomology of a real toric variety and shellability of posets arising from a graphChordal matroids arising from generalized parallel connectionsInductive and divisional posetsVertex-weighted digraphs and freeness of arrangements between Shi and IshA lexicographic shellability characterization of geometric latticesA homological characterization for freeness of multi-arrangementsOn the poset of conjugacy classes of subgroups of π-power indexAn Inequality for the Möbius Function of a Geometric LatticeOn the shellability of the order complex of the subgroup lattice of a finite groupVarieties of Combinatorial GeometriesNested set complexes of Dowling lattices and complexes of Dowling treesCohomology of Local Sheaves on Arrangement LatticesShellable nonpure complexes and posets. IIBinary Supersolvable Matroids and Modular ConstructionsA modular characterization of supersolvable latticesSupersolvable LL-lattices of binary treesSimple geometric characterization of supersolvable arrangementsUnnamed ItemExtending a matroid by a cocircuitA construction of semisimple tensor categoriesPattern-avoiding polytopesPattern-avoiding polytopesExpansions of Chromatic Polynomials and Log-ConcavitySupersolvability and the Koszul property of root ideal arrangementsDerivation modules of orthogonal duals of hyperplane arrangementsParallel connections and bundles of arrangementsWhy the characteristic polynomial factorsOn the geometry of real or complex supersolvable line arrangementsThe noncrossing bond poset of a graphThe topology of arrangements of ideal typeKoszulness and supersolvability for Dirichlet arrangementsDiameter of graphs of reduced words and galleriesOn the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness ConjectureElectrical networks and hyperplane arrangementsA probabilistic scheme of independent random elements distributed over a finite lattice. II: The method of lattice momentsPoset edge-labellings and left modularitySupersolvability and freeness for \(\psi\)-graphical arrangementsArrangements of ideal typeAddition-deletion theorems for factorizations of Orlik-Solomon algebras and nice arrangementsThe lattices of closure systems, closure operators, and implicational systems on a finite set: A surveySigned graphs and the freeness of the Weyl subarrangements of type \(B_\ell\)Nice reflection arrangements.Logarithmic vector fields and freeness of divisors and arrangements: new perspectives and applications. Abstracts from the workshop held January 24--30, 2021 (online meeting)Modular elements of lattices and topological fibrationLine-closed combinatorial geometriesRelational lattices: from databases to universal algebraIncreasing spanning forests in graphs and simplicial complexesDowling group geometries and the critical problemFactored arrangements of hyperplanesFast Möbius inversion in semimodular lattices and ER-labelable posetsCombinatorics of inductively factored arrangementsCombinatorial polar orderings and recursively orderable arrangementsOn the Cohen-Macaulay connectivity of supersolvable lattices and the homotopy type of posetsA generalization of Sylow's third theoremMöbius functions of latticesColoring matroidsA generalization of semimodular supersolvable latticeCatenarian FCP ring extensionsHomological properties of determinantal arrangementsThe freeness of Ish arrangementsAn analogue of distributivity for ungraded latticesPosets of shufflesBruhat order on the involutions of classical Weyl groups.Partially ordered sets associated with permutationsChains of modular elements and lattice connectivityMinimal paths between maximal chains in finite rank semimodular latticesSemimodular lattices and semibuildingsOn valuations, the characteristic polynomial, and complex subspace arrangementsBiased expansions of biased graphs and their chromatic polynomialsSupersolvable restrictions of reflection arrangementsConvexity in ordered matroids and the generalized external orderModularity complemented geometric latticesCohen-Macaulay ordered setsCongruences derived from group actionChains of modular elements and shellabilityIrreducible representations of semisimple algebraic groups and supersolvable lattices.




Cites Work




This page was built for publication: Supersolvable lattices