Related papers: Trees meet octahedron comparison
We resolve a problem of Anderson and Fulton by providing a symmetric and positive product rule for the equivariant cohomology of projective space.
Let T be a tree with an action of a finitely generated group G. Given a suitable equivalence relation on the set of edge stabilizers of T (such as commensurability, co-elementarity in a relatively hyperbolic group, or commutation in a…
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the…
We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
We prove that an irreducible lattice acting on a product of two or more locally finite, biregular trees is finitely generated.
A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a…
Two tetrahedra are called orthologic if the lines through vertices of one and perpendicular to corresponding faces of the other are intersecting. This is equivalent to the orthogonality of non-corresponding edges. We prove that the…
We present a new probabilistic proof of Otter's asymptotic formula for the number of unlabelled trees with a given number of vertices. We additionally prove a new approximation result, showing that the total variation distance between…
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…
In this note we give a proof-by-formula of certain important embedding inequalities on dyadic tree. This is done with the help of Bellman function. We also consider the case of a bi-tree, where a different approach is explained.
It has been proved by Bergh and Thaule that the higher mapping cone axiom is equivalent to the higher octahedral axiom for n-angulated categories. In this note, we use homotopy cartesian diagrams to give several new equivalent statements of…
We show the equivalence of several notions in the theory of taut foliations and the theory of tight contact structures. We prove equivalence, in certain cases, of existence of tight contact structures and taut foliations.
For a given metric space $(P,\phi)$, a tree cover of stretch $t$ is a collection of trees on $P$ such that edges $(x,y)$ of trees receive length $\phi(x,y)$, and such that for any pair of points $u,v\in P$ there is a tree $T$ in the…
For horocyclic products of percolation subtrees of regular trees, we show almost sure amenability. Under a symmetry condition concerning the growth of the two percolation trees, we show the existence of an increasing Foelner sequence (which…
We construct a pair of non-isomorphic, bipartite graphs which are not distinguished by counting the number of homomorphisms to any tree. This answers a question motivated by Atserias et al. (LICS 2021). In order to establish the…
In order to study convergences of looptrees, we construct continuum trees and looptrees from real-valued c\`adl\`ag functions without negative jumps called excursions. We then provide a toolbox to manipulate the two resulting codings of…
We show that uniformly finite homology of products of $n$ trees vanishes in all degrees except degree $n$, where it is infinite dimensional. Our method is geometric and applies to several large scale homology theories, including almost…
For a simple drawing $D$ of the complete graph $K_n$, two (plane) subdrawings are compatible if their union is plane. Let $\mathcal{T}_D$ be the set of all plane spanning trees on $D$ and $\mathcal{F}(\mathcal{T}_D)$ be the compatibility…
Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…
This is a report on a talk to high school mathematics students. It gives some combinatorial connections for the entries of the boustrophedon triangle whose sides are the Taylor coefficients for the tangent and secant functions.