Toric partial orders
From MaRDI portal
Abstract: We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite posets under the equivalence relation generated by converting minimal elements into maximal elements, or sources into sinks. We derive toric analogues for several features of ordinary partial orders, such as chains, antichains, transitivity, Hasse diagrams, linear extensions, and total orders.
Recommendations
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- A decomposition theorem for partially ordered sets
- A Dual of Dilworth's Decomposition Theorem
- A Salvetti complex for toric arrangements and its fundamental group
- A Shannon-McMillan theorem for motley names
- A Tutte polynomial for toric arrangements
- Acyclic orientations of graphs
- Affine and toric hyperplane arrangements
- Arithmetic matroids, the Tutte polynomial and toric arrangements
- Combinatorial problems of commutation and rearrangements
- Conjugacy of Coxeter elements.
- Convex, acyclic, and free sets of an oriented matroid
- Faces of generalized permutohedra
- scientific article; zbMATH DE number 1713119 (Why is no real title available?)
- scientific article; zbMATH DE number 3479762 (Why is no real title available?)
- scientific article; zbMATH DE number 3604927 (Why is no real title available?)
- scientific article; zbMATH DE number 3411070 (Why is no real title available?)
- scientific article; zbMATH DE number 3424078 (Why is no real title available?)
- Killing and the Coxeter transformation of Kac-Moody algebras
- Modules of derivations for toral arrangements.
- On enumeration of conjugacy classes of Coxeter elements
- On reorienting graphs by pushing down maximal vertices
- On the geometry of toric arrangements
- On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
- Orientations, lattice polytopes, and group arrangements I: Chromatic and tension polynomials of graphs
- Partial and complete cyclic orders
- Posets from admissible Coxeter sequences.
- Powers of Coxeter elements in infinite groups are reduced
- Syzygies of oriented matroids
- The enumeration of Coxeter elements
- The Poincaré polynomial of an mp arrangement
- The subposet lattice and the order polynomial
- The theory of convex geometries
Cited in
(22)- Order-preserving maps from a poset to a chain, the order polytope, and the Todd class of the associated toric variety.
- Toric arrangements associated to graphs
- Toeplitz order
- Friends and strangers walking on graphs
- An Ordering on the Even Discrete Torus
- Friends and strangers walking on graphs
- Toric promotion
- scientific article; zbMATH DE number 7203434 (Why is no real title available?)
- Morphisms and order ideals of toric posets
- Cycle equivalence of finite dynamical systems containing symmetries
- Enriched toric \([\vec{D}]\)-partitions
- Connectivity of old and new models of friends-and-strangers graphs
- Asynchronous, finite dynamical systems
- Bender-Knuth involutions on linear extensions of posets
- Lipschitz continuity under toric equivalence for asynchronous Boolean networks
- On the diameters of friends-and-strangers graphs
- Permutoric promotion: gliding globs, sliding stones, and colliding coins
- Torsors and tilings from toric toggling
- A toric analogue for Greene's rational function of a poset
- Bender-Knuth billiards in Coxeter groups
- Noncrossing partitions, toggles, and homomesies
- Characterization of cyclically fully commutative elements in finite and affine Coxeter groups
This page was built for publication: Toric partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787971)