Search arXivSearch

arXiv · 2309.15209

Logarithmic terms in discrete heat kernel expansions in the quadrant

Abstract

In the context of lattice walk enumeration in cones, we consider the number of walks in the quarter plane with fixed starting and ending points, prescribed step-set and given length. After renormalization, this number may be interpreted as a discrete heat kernel in the quadrant. We propose a new method to compute complete asymptotic expansions of these numbers of walks as their length tends to infinity, based on two main ingredients: explicit expressions for the underlying generating functions in terms of elliptic Jacobi theta functions along with a duality known as Jacobi transformation. This duality allows us to pass from a classical Taylor expansion of the series to an expansion at the critical point of the model. We work through two examples. First, we present our approach on the well-known Kreweras model, which is algebraic, and show how to obtain a complete asymptotic expansion in this case. We then consider a more generic (so-called infinite group) model, and find the associated complete asymptotic expansion. In this second case, we prove the existence of logarithmic terms in the asymptotic expansion, and we relate the coefficients appearing in the expansion to polyharmonic functions. To our knowledge, this is the first time that logarithmic terms have been observed in the asymptotics of a class of lattice walks confined to a quadrant.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andrew Elvey-Price, Andreas Nessmann, Kilian Raschel. 2023-09-26. Logarithmic terms in discrete heat kernel expansions in the quadrant. https://arxiv.org/abs/2309.15209

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO