Search arXivSearch

arXiv · 2606.08834

Area and water-capacity statistics for upper hulls of Dyck paths

Abstract

We study Dyck paths refined simultaneously by proper area and water capacity, where water capacity is measured above the path and below its lattice-path upper hull. The finite-height ingredients used in the enumeration are classical bounded-height area-polynomial and continued-fraction objects. The upper-hull decomposition produces a coupled area--capacity substitution, which gives an exact four-variable height expansion with denominator branches indexed by the height levels. The full generating function is asymmetric in the two weights, while the height summands admit a symmetric unreduced denominator representation under interchange of the area and capacity weights. In the open square $0<p,q<1$, we prove that the length radius of $G(x,1,p,q)$ is the minimum of the positive real denominator branches. The proof combines uniform normal convergence of the height expansion below this first branch with a Perron-root representation of the branch locations and an interval log-submodularity theorem for spectral radii of weighted paths. On the diagonal $p=q=s$, the classical Chebyshev specialisation gives explicit branch crossings and a $(1-s)^{2/3}$ branch-envelope accumulation law at the Dyck critical point.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aleksander L. Owczarek, Thomas Prellberg. 2026-06-07. Area and water-capacity statistics for upper hulls of Dyck paths. https://arxiv.org/abs/2606.08834

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO