Cover Image

Two-count interval representation of a permutation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Biró, Csaba, Kézdy, André E., Lehel, Jenő
Format:	Preprint
Published:	2024
Subjects:	Combinatorics 06A06, 90C27, 05C62, 52B05, 05C20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The length polyhedron of an interval order
by: Biró, Csaba, et al.
Published: (2024)

The Schrijver system of the length polyhedron of an interval order
by: Kézdy, André E., et al.
Published: (2024)

Lower bounds for cube-ideal set-systems
by: Abdi, Ahmad, et al.
Published: (2025)

Two-edge-connected (not necessarily spanning) subgraphs and polyhedra
by: Bruckamp, Justus, et al.
Published: (2024)

Permutation Flows I: Triangulations of Flow Polytopes (Research Announcement)
by: D'León, Rafael S. González, et al.
Published: (2025)

Equivalence of labeled graphs and lattices
by: Bhavale, Ashok Nivrutti
Published: (2025)

The $k$-fold circuit property for matroids
by: Jackson, Bill, et al.
Published: (2024)

$2$-colourability of the maximum ranked elements of a combinatorially sphere-like ranked poset
by: Mondal, Anupam, et al.
Published: (2026)

Fully Leafed Induced Subtrees in Penrose P2 Tilings
by: Cloutier, Mathieu, et al.
Published: (2026)

Penrose P2 Tilings: A Study of Fully Leafed Induced Subtrees
by: Cloutier, Mathieu, et al.
Published: (2026)

Lattice Size of Width One Lattice Polytopes in $\mathbb{R}^3$
by: Alajmi, Abdulrahman, et al.
Published: (2022)

Allocation of Indivisible Items with a Common Preference Graph: Minimizing Total Dissatisfaction
by: Chiarelli, Nina, et al.
Published: (2024)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
by: Chiarelli, Nina, et al.
Published: (2023)

Reinterpreting the Middle-Levels Theorem via Natural Enumeration of Ordered Trees
by: Dejter, Italo J.
Published: (2019)

A numeral system for the middle-levels graphs
by: Dejter, Italo J.
Published: (2010)

On the $f$-vectors of flow polytopes for the complete graph
by: Dugan, William T.
Published: (2024)

Generalized Pitman-Stanley polytope: vertices and faces
by: Dugan, William T., et al.
Published: (2023)

Thin MC left regular bands
by: Dermenjian, Aram
Published: (2024)

Boundaries of pseudointegral polygons
by: McAllister, Tyrrell B., et al.
Published: (2024)

The Pinnacle Sets of a Graph
by: Bozeman, Chassidy, et al.
Published: (2024)

Root polytopes and Jaeger-type dissections for directed graphs
by: Kálmán, Tamás, et al.
Published: (2021)

A note on the sizes of bipartite 1-planar graphs
by: Wang, Guiping
Published: (2025)

Quasisymmetric functions distinguishing trees
by: Aval, Jean-Christophe, et al.
Published: (2022)

Lattice Minors and Eulerian Posets
by: Gustafson, William
Published: (2022)

The Rhodes semilattice of a biased graph
by: Gottstein, Michael J., et al.
Published: (2023)

Extended Abstract: Canonical join complex and cubical coordinates for all framing lattices
by: Berggren, Jonah, et al.
Published: (2026)

The Chain Matrix of Bouquets of Geometric Lattices and its Determinant
by: Hochstättler, Winfried, et al.
Published: (2024)

The Poincaré-extended ab-index
by: Dorpalen-Barry, Galen, et al.
Published: (2023)

Operahedron Lattices
by: Defant, Colin, et al.
Published: (2024)

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers
by: Borgwardt, Steffen, et al.
Published: (2025)

Lattice characterization of cyclic interval hypergraphic posets
by: Gélinas, Félix, et al.
Published: (2026)

The immersion poset on partitions
by: Johnston, Lisa, et al.
Published: (2024)

On Circuit Imbalance and 0/1 Circuits for Coloring and Spanning Forest Problems
by: Borgwardt, Steffen, et al.
Published: (2025)

Linear extensions and directed clique counts via modular partitions
by: Santander, Daniela Egas, et al.
Published: (2026)

$c$-Birkhoff polytopes
by: Banaian, Esther, et al.
Published: (2025)

On self-duality and unigraphicity for $3$-polytopes
by: Maffucci, Riccardo W.
Published: (2023)

Construction numbers: How to build a graph?
by: Kainen, Paul C.
Published: (2023)

On lattice triangles satisfying $\boldsymbol{B(T)=3}$ with collinear interior lattice points
by: Li, Eddy, et al.
Published: (2025)

Good Triangulations of Cosmological Polytopes
by: Benjes, Aenne, et al.
Published: (2025)

Pseudo-Euclidean representations of switching classes of Johnson and Hamming graphs with minimal dimension
by: Nozaki, Hiroshi, et al.
Published: (2025)