Related papers: Increasing trees and Kontsevich cycles
This article studies the sequence of iterative degrees of a birational map of the plane. This sequence is known either to be bounded or to have a linear, quadratic or exponential growth. The classification elements of infinite order with a…
We show that corner polyhedra and 3-connected Schnyder labelings join the growing list of planar structures that can be set in exact correspondence with (weighted) models of quadrant walks via a bijection due to Kenyon, Miller, Sheffield…
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on…
We resolve a question of Gillespie, Griffin, and Levinson that asks for a combinatorial bijection between two classes of trivalent trees, tournament trees and slide trees, that both naturally arise in the intersection theory of the moduli…
Several tools have been developed to enhance automation of theorem proving in the 2D plane. However, in 3D, only a few approaches have been studied, and to our knowledge, nothing has been done in higher dimensions. In this paper, we present…
Combinatorial aspects of the Torelli-Johnson-Morita theory of surface automorphisms are extended to certain subgroups of the mapping class groups. These subgroups are defined relative to a specified homomorphism from the fundamental group…
We find the generating function for the contributions of $n$-cylinder square-tiled surfaces to the Masur-Veech volume of $\mathcal{H}(2g-2)$. It is a bivariate generalization of the generating function for the total volumes obtained by…
Recently F\'eray, Goulden and Lascoux gave a proof of a new hook summation formula for unordered increasing trees by means of a generalization of the Pr\"ufer code for labelled trees and posed the problem of finding a bijection between…
This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…
Higher order cohomology of arithmetic groups is expressed in terms of (g,K)-cohomology. Generalizing results of Borel, it is shown that the latter can be computed using functions of (uniform) moderate growth. A higher order versions of…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
The classical matrix-tree theorem was discovered by G.~Kirchhoff in 1847. It relates the principal minor of the Laplace (nxn)-matrix to a particular sum of monomials indexed by the set of trees with n vertices. The aim of this paper is to…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
We begin by introducing schemes of binoids, invertible $\mathcal{O}_M$-sets and cohomology of sheaves of abelian groups defined on schemes of binoids. We define the so-called punctured combinatorial \v{C}ech-Picard complex, whose first…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
In this paper, we introduce the notion of a grammatical labeling to describe a recursive process of generating combinatorial objects based on a context-free grammar. For example, by labeling the ascents and descents of a Stirling…
A combinatorial formula for the Pontrjagin classes of a triangulated manifold is given. The main ingredients are oriented matroid theory and a modified formulation of Chern-Weil theory.
This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…
The circular coordinates algorithm, a key tool in topological data analysis, relies on a theoretically unvalidated lifting step to convert cocycles from a prime field to integer coefficients. We provide a rigorous analysis of this…
We present Collaborative Trees, a novel tree model designed for regression prediction, along with its bagging version, which aims to analyze complex statistical associations between features and uncover potential patterns inherent in the…