English
Related papers

Related papers: Tamari intervals and blossoming trees

200 papers

In this paper, we exploit the combinatorics and geometry of triangulations of products of simplices to derive new results in the context of Catalan combinatorics of $\nu$-Tamari lattices. In our framework, the main role of "Catalan objects"…

Combinatorics · Mathematics 2017-10-12 Cesar Ceballos , Arnau Padrol , Camilo Sarmiento

We introduce a correspondence between phylogenetic trees and Brauer diagrams, inspired by links between binary trees and matchings described by Diaconis and Holmes (1998). This correspondence gives rise to a range of semigroup structures on…

Populations and Evolution · Quantitative Biology 2022-10-12 Andrew Francis , Peter D Jarvis

We find presentations for subalgebras of invariants of the coordinate algebras of binary symmetric models of phylogenetic trees studied by Buczynska and Wisniewski in \cite{BW}. These algebras arise as toric degenerations of rings of global…

Algebraic Geometry · Mathematics 2016-05-30 Christopher A. Manon

Hex-trees are identified as a particular instance of weighted unary-binary trees. The Horton-Strahler numbers of these objects are revisited, and, thanks to a substitution that is not immediately intuitive, explicit results are possible.…

Combinatorics · Mathematics 2021-08-24 Helmut Prodinger

We describe an involution on Tamari intervals and m-Tamari intervals. This involution switches two sets of statistics known as the "rises" and the "contacts" and so proves an open conjecture from Pr\'eville-Ratelle on intervals of the…

Combinatorics · Mathematics 2019-06-04 Viviane Pons

In 1996, Edelman and Reiner defined the two higher Stasheff--Tamari orders on triangulations of cyclic polytopes and conjectured them to coincide. We open up an algebraic angle for approaching this conjecture by showing how these orders…

Combinatorics · Mathematics 2021-02-22 Nicholas J. Williams

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

Combinatorics · Mathematics 2007-05-23 Frederic Patras , Manfred Schocker

We extend the notion of triangle to "imaginary triangles" with complex valued sides and angles, and parametrize families of such triangles by plane algebraic curves. We study in detail families of triangles with two commensurable angles,…

Metric Geometry · Mathematics 2017-12-21 Sergiy Koshkin

We study some essential arithmetic properties of a new tree-based number representation, {\em hereditarily binary numbers}, defined by applying recursively run-length encoding of bijective base-2 digits. Our representation expresses giant…

Data Structures and Algorithms · Computer Science 2013-06-06 Paul Tarau

In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…

Combinatorics · Mathematics 2025-03-31 William Y. C. Chen , Amy M. Fu

Recently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix. We call such…

Combinatorics · Mathematics 2026-01-21 Valentino Smaldore

We present new links between some remarkable martingales found in the study of the Binary Search Tree, or of the Bisection Problem, looking at them on the probability space of a continuous time binary branching process.

Probability · Mathematics 2007-05-23 B. Chauvin , A. Rouault

Recently, Ehrenborg and Van Willenburg defined a class of bipartite graphs that correspond naturally to Ferrers diagrams, and proved several results about them. We give bijective proofs for the (already known) expressions for the number of…

Combinatorics · Mathematics 2007-05-23 Jason Burns

In [Dugan-Glennon-Gunnells-Steingrimsson-2019], the authors introduce tiered trees to define combinatorial objects counting absolutely indecomposable representations of certain quivers, and torus orbits on certain homogeneous varieties. In…

Combinatorics · Mathematics 2023-03-02 Michele D'Adderio , Alessandro Iraci , Yvan LeBorgne , Marino Romero , Anna Vanden Wyngaerd

In this paper we present with algebraic trees a novel notion of (continuum) trees which generalizes countable graph-theoretic trees to (potentially) uncountable structures. For that purpose we focus on the tree structure given by the branch…

Probability · Mathematics 2021-04-29 Wolfgang Löhr , Anita Winter

Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…

Combinatorics · Mathematics 2022-01-12 Colin Defant

We introduce a new poset structure on Dyck paths where the covering relation is a particular case of the relation inducing the Tamari lattice. We prove that the transitive closure of this relation endows Dyck paths with a lattice structure.…

Combinatorics · Mathematics 2025-05-16 Jean-Luc Baril , Sergey Kirgizov , Mehdi Naima

We introduce a sheaf-theoretic approach to tropical homology, especially for tropical homology with potentially non-compact supports. Our setup is suited to study the functorial properties of tropical homology, and we show that it behaves…

Algebraic Geometry · Mathematics 2019-06-24 Andreas Gross , Farbod Shokrieh

We show that indecomposable two-term presilting complexes over $\Pi_{n}$, the preprojective algebra of $A_{n}$, are in bijection with internal $n$-simplices in the prism $\Delta_{n} \times \Delta_{1}$, the product of an $n$-simplex with a…

Representation Theory · Mathematics 2022-11-15 Osamu Iyama , Nicholas J. Williams

Peca suggested in a recent paper on the arxiv to consider binary butterfly trees and their Horton-Strahler numbers. The trees are obtained by glueing two binary trees together in a special way; the results are again binary trees but with a…

Combinatorics · Mathematics 2025-10-22 Helmut Prodinger