English
Related papers

Related papers: Fuss-Schr\"oder Paths and Rooted Plane Forests

200 papers

We prove some asymptotic results for the radius and the profile of large random rooted planar maps with faces of arbitrary degrees. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted planar maps and certain four-type…

Probability · Mathematics 2007-06-25 Grégory Miermont , Mathilde Weill

Let $n$ be a non-negative integer and $A=\{a_1,\ldots,a_k\}$ be a multi-set with $k$ not necessarily distinct members, where $a_1\leqslant\ldots\leqslant a_k$. We denote by $\Delta(n,A)$ the number of ways to partition $n$ as the form…

Combinatorics · Mathematics 2018-05-22 Toufik Mansour , Madjid Mirzavaziri , Daniel Yaqubi

We study the Short Path Packing problem which asks, given a graph $G$, integers $k$ and $\ell$, and vertices $s$ and $t$, whether there exist $k$ pairwise internally vertex-disjoint $s$-$t$ paths of length at most $\ell$. The problem has…

Data Structures and Algorithms · Computer Science 2024-04-17 Michael Kiran Huber

In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted $U$-polynomial for every $k$; by this we mean that the polynomials agree on terms with degree at most $k+1$. The main tool for this…

Combinatorics · Mathematics 2020-02-20 José Aliste-Prieto , Anna de Mier , José Zamora

We prove the Schr\"oder case, i.e. the case $\langle \cdot,e_{n-d}h_d \rangle$, of the conjecture of Haglund, Remmel and Wilson (Haglund et al. 2018) for $\Delta_{h_m}\Delta_{e_{n-k-1}}'e_n$ in terms of decorated partially labelled Dyck…

Combinatorics · Mathematics 2022-06-06 Michele D'Adderio , Alessandro Iraci , Anna Vanden Wyngaerd

We construct in this article an explicit geometric rough path over arbitrary $d$-dimensional paths with finite $1/\alpha$-variation for any $\alpha\in(0,1)$. The method may be coined as 'Fourier normal ordering', since it consists in a…

Probability · Mathematics 2015-05-13 J. Unterberger

A rooted tree module (RTM) $M:=M(T,F)$ over a zero-relation algebra $\Lambda:=\mathcal KQ/\langle\rho\rangle$ over a field $\mathcal K$ is given by the data of a quiver morphism $F:T\to Q$ from a rooted tree $T$ (either with a source or a…

Representation Theory · Mathematics 2025-08-12 Suraj Mishra , Amit Kuber

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

In 1989 Erd\H{o}s and Sz\'ekely showed that there is a bijection between (i) the set of rooted trees with $n+1$ vertices whose leaves are bijectively labeled with the elements of $[\ell]=\{1,2,\dots,\ell\}$ for some $\ell \leq n$, and (ii)…

Discrete Mathematics · Computer Science 2025-10-29 Vincent Moulton , Andreas Spillner

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

Combinatorics · Mathematics 2020-07-21 Stefan Felsner , Clemens Huemer , Sarah Kappes , David Orden

We consider the problem of enumerating d-irreducible maps, i.e. planar maps whose all cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the…

Combinatorics · Mathematics 2019-02-20 J. Bouttier , E. Guitter

Phylogenetic networks generalize phylogenetic trees, and have been introduced in order to describe evolution in the case of transfer of genetic material between coexisting species. There are many classes of phylogenetic networks, which can…

Combinatorics · Mathematics 2020-03-13 Mathilde Bouvel , Philippe Gambette , Marefatollah Mansouri

For $0\leq k \leq n$, the number $C(n,k)$ represents the number of all lattice paths in the plane from the point $(0,0)$ to the point $(n,k)$, using steps $(1,0)$ and $(0,1)$, that never rise above the main diagonal $y=x$. The Fuss-Catalan…

Combinatorics · Mathematics 2025-03-10 Jovan Mikić

We give a lower bound for the size of a subset of $\mathbb F_q^n$ containing a rich k-plane in every direction, a k-plane Furstenberg set. The chief novelty of our method is that we use arguments on non-reduced subschemes and flat families…

Algebraic Geometry · Mathematics 2016-10-05 Jordan S. Ellenberg , Daniel Erman

We prove that a uniform rooted plane map with n edges converges in distribution after a suitable normalization to the Brownian map for the Gromov-Hausdorff topology. A recent bijection due to Ambj{\o}rn and Budd allows to derive this result…

Probability · Mathematics 2014-08-20 Jérémie Bettinelli , Emmanuel Jacob , Grégory Miermont

In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…

Combinatorics · Mathematics 2015-12-15 Ricky X. F. Chen , Christian M. Reidys

In this paper, we investigate the weighted Catalan, Motzkin and Schr\"oder numbers together with the corresponding weighted paths. The relation between these numbers is illustrated by three equations, which also lead to some known and new…

Combinatorics · Mathematics 2016-08-17 Zhi Chen , Hao Pan

Let $A$ be a commutative $k$-algebra over a field of $k$ and $\Xi$ a linear operator defined on $A$. We define a family of $A$-valued invariants $\Psi$ for finite rooted forests by a recurrent algorithm using the operator $\Xi$ and show…

Combinatorics · Mathematics 2009-02-02 Wenhua Zhao

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

Number Theory · Mathematics 2024-12-17 Jens Marklof

The Gessel number $P(n,r)$ represents the number of lattice paths in a plane with unit horizontal and vertical steps from $(0,0)$ to $(n+r,n+r-1)$ that never touch any of the points from the set $\{(x,x)\in \mathbb{Z}^2: x \geq r\}$. In…

Combinatorics · Mathematics 2022-03-25 Jovan Mikić