Search arXivSearch

arXiv · 1907.10184

The asymptotics of reflectable weighted walks in arbitrary dimension

Abstract

Gessel and Zeilberger generalized the reflection principle to handle walks confined to Weyl chambers, under some restrictions on the allowable steps. For those models that are invariant under the Weyl group action, they express the counting function for the walks with fixed starting and endpoint as a constant term in the Taylor series expansion of a rational function. Here, we focus on the simplest case, the Weyl groups $A_1^d$, which correspond to walks in the first orthant $\mathbb{N}^d$ taking steps from a subset of $\{\pm1, 0\}^d$ which is invariant under reflection across any axis. The principle novelty here is the incorporation of weights on the steps and the main result is a very general theorem giving asymptotic enumeration formulas for walks that end anywhere in the orthant. The formulas are determined by singularity analysis of multivariable rational functions, an approach that has already been successfully applied in numerous related cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marni Mishna, Samuel Simon. 2019-09-17. The asymptotics of reflectable weighted walks in arbitrary dimension. https://arxiv.org/abs/1907.10184

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