A lattice on Dyck paths close to the Tamari lattice

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Baril, Jean-Luc, Kirgizov, Sergey, Naima, Mehdi
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Enumeration in the lattice of $q$-decreasing words
by: Baril, Jean-Luc, et al.
Published: (2025)

Grand zigzag knight's paths
by: Baril, Jean-Luc, et al.
Published: (2024)

The ascent lattice on Dyck paths
by: Baril, Jean-Luc, et al.
Published: (2024)

The Combinatorics of Motzkin Polyominoes
by: Baril, Jean-Luc, et al.
Published: (2024)

Emerging consecutive pattern avoidance
by: Hassler, Nathanaël, et al.
Published: (2025)

Endhered patterns in matchings and RNA
by: Biane, Célia, et al.
Published: (2024)

Progressive and Rushed Dyck Paths
by: Bacher, Axel
Published: (2024)

Structure and growth of $\mathbb{R}$-bonacci words
by: Dovgal, Sergey, et al.
Published: (2023)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Dyck Paths Enumerated by the Q-bonacci Numbers
by: Barcucci, Elena, et al.
Published: (2024)

Centered colorings in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Ramsey Goodness of paths and unbalanced graphs
by: Botler, Fábio, et al.
Published: (2024)

Weak coloring numbers of minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2024)

Directed treewidth is closed under taking butterfly minors
by: Kim, Gunwoo, et al.
Published: (2025)

Adjacency labelling for proper minor-closed graph classes
by: Dujmović, Vida, et al.
Published: (2026)

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

Bipartite Turán number of paths and other trees
by: Bonamy, Marthe, et al.
Published: (2025)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

Centered colorings and weak coloring numbers in minor-closed graph classes
by: Hodor, Jędrzej, et al.
Published: (2026)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Non-empty intersection of longest paths in $H$-free graphs
by: Long Jr., James A., et al.
Published: (2023)

Characterizing the optimum bases of a convex geometry using quasi-closed hypergraphs
by: Meunier, Anthony, et al.
Published: (2026)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

Computing random $r$-orthogonal Latin squares
by: Bereg, Sergey
Published: (2023)

Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
by: Bonnet, Édouard, et al.
Published: (2022)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

Dyck Words, Pattern Avoidance, and Automatic Sequences
by: Mol, Lucas, et al.
Published: (2023)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

Strong isometric path complexity of graphs: Asymptotic minors, restricted holes, and graph operations
by: Chakraborty, Dibyayan, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Topological graph drawing (part I)
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part IV)
by: Kurapov, Sergey, et al.
Published: (2025)

Algorithmic methods of finite discrete structures. Isomorphism of Nonseparable Graphs
by: Kurapov, Sergey, et al.
Published: (2024)

Algorithmic methods of finite discrete structures. Topological graph drawing (part II)
by: Kurapov, Sergey, et al.
Published: (2024)

Recoverable systems and the maximal hard-core model on the triangular lattice
by: Wang, Geyang, et al.
Published: (2026)

Forbidden Patterns in Mixed Linear Layouts
by: Haun, Deborah, et al.
Published: (2024)