Related papers: Factorizations of cycles and multi-noded rooted tr…

We introduce $(r+1)$-completed cycles $k$-leaky Hurwitz numbers and prove piecewise polynomiality as well as establishing their chamber polynomiality structure and their wall crossing formulae. For $k=0$ the results recover previous results…

We study the problem of enumerating all rooted directed spanning trees (arborescences) of a directed graph (digraph) $G=(V,E)$ of $n$ vertices. An arborescence $A$ consisting of edges $e_1,\ldots,e_{n-1}$ can be represented as a monomial…

Arborified multiple zeta values are a generalization of multiple zeta values associated with rooted trees. There are two types of decorated rooted trees, corresponding respectively to the series and the integral expressions. Manchon…

For rings R with identity, we define a class of nonlinear higher order recurrences on unitary left R-modules that include linear recurrences as special cases. We obtain conditions under which a recurrence of order k+1 in this class is…

Our main objective in this paper (which is expository for the most part) is to study the necessary steps to prove a factorization formula for a certain triple product $p$-adic $L$-function guided by the Artin formalism. The key ingredients…

Let $\gamma_n$ be the permutation on $n$ symbols defined by $\gamma_n = (1\ 2\...\ n)$. We are interested in an enumerative problem on colored permutations, that is permutations $\beta$ of $n$ in which the numbers from 1 to $n$ are colored…

We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…

We compute the number of (weak) equivalence classes of branched covers from a surface of genus g to the sphere, with 3 branching points, degree 2k, and local degrees over the branching points of the form (2,...,2), (2h+1,1,2,...,2),…

The paper has two parts. First we prove that the specialization maps on R-equivalence and on the Chow group of zero cycles are isomorphisms for families over a local, Henselian, Dedekind ring when the special fiber is smooth and separably…

This is the central article of a series of three papers on cross product bialgebras. We present a universal theory of bialgebra factorizations (or cross product bialgebras) with cocycles and dual cocycles. We also provide an equivalent…

We describe double Hurwitz numbers as intersection numbers on the moduli space of curves. Assuming polynomiality of the Double Ramification Cycle (which is known in genera 0 and 1), our formula explains the polynomiality in chambers of…

An attempt to come closer to a resolution of the Collatz conjecture is presented. The central idea is the formation of a tree consisting of positive odd numbers with number 1 as root. Functions for generating the tree from the root are…

We give a short proof of Cayley's tree formula for counting the number of different labeled trees on $n$ vertices. The following nonlinear recursive relation for the number of labeled trees on $n$ vertices is deduced from a combinatorial…

We present a very simple bijective proof of Cayley's formula due to Foata and Fuchs (1970). This bijection turns out to be very useful when seen through a probabilistic lens; we explain some of the ways in which it can be used to derive…

We characterize the classical Boltzmann distribution as the unique solution to a certain combinatorial Hodge theory problem in homological degree zero on a finite graph. By substituting for the graph a CW complex and a degree d, we are able…

Multi-edge trees as introduced in a recent paper of Dziemia\'nczuk are plane trees where multiple edges are allowed. We first show that $d$-ary multi-edge trees where the out-degrees are bounded by $d$ are in bijection with classical…

Phylogenetic tree shapes capture fundamental signatures of evolution. We consider ``ranked'' tree shapes, which are equipped with a total order on the internal nodes compatible with the tree graph. Recent work has established an elegant…

Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and the Matrix-Tree Theorem, we give a combinatorial proof that…

Multigraded linear series generalize the classical morphism to the linear series of a basepoint-free line bundle on a scheme. We investigate the collection of the natural cornering morphisms into elementary bigraded linear series obtained…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…