English
Related papers

Related papers: On a conjecture of Ira Gessel

200 papers

We analyze time-discrete and continuous `fractional' random walks on undirected regular networks with special focus on cubic periodic lattices in $n=1,2,3,..$ dimensions. The fractional random walk dynamics is governed by a master equation…

For the OEIS sequence A214615, defined by $a(n) = M_{n}(1)$ where $M_{n}$ is the $n$-th Meixner polynomial satisfying $M_{n+1}(x) = x\,M_{n}(x) - n^{2}\,M_{n-1}(x)$, R.~J.~Mathar contributed on 6~March 2013 the conjectured order-2…

Combinatorics · Mathematics 2026-05-07 Tong Niu

We consider lattice walks in $\R^k$ confined to the region $0<x_1<x_2...<x_k$ with fixed (but arbitrary) starting and end points. The walks are required to be "reflectable", that is, we assume that the number of paths can be counted using…

Combinatorics · Mathematics 2010-12-17 Thomas Feierl

We interpret walks in the first quadrant with steps {(1,1),(1,0),(-1,0), (-1,-1)} as a generalization of Dyck words with two sets of letters. Using this language, we give a formal expression for the number of walks in the steps above…

Combinatorics · Mathematics 2011-04-20 Arvind Ayyer

Let $f_1=1,f_2=2$ and $f_i=f_{i-1}+f_{i-2}$ for $i>2$ be the sequence of Fibonacci numbers. Let $\Phi_h(n)$ be the quantity of partitions of natural number $n$ into $h$ different Fibonacci numbers. In terms of Zeckendorf partition of $n$ I…

Number Theory · Mathematics 2018-05-15 F. V. Weinstein

We enumerate the number of monotonic lattice paths starting at $(0,0)$ and terminating at $(m,n)$ in which $l$ of the first $k$ steps lie below the line $y=x\ (0\leq k\leq m\leq n)$. These closed formulas consist of terms which are a…

Combinatorics · Mathematics 2015-08-21 Charles Hoffman , Corey Manack

We study the enumeration of closed walks of given length and algebraic area on the honeycomb lattice. Using an irreducible operator realization of honeycomb lattice moves, we map the problem to a Hofstadter-like Hamiltonian and show that…

Mathematical Physics · Physics 2022-02-04 Li Gan , Stéphane Ouvry , Alexios P. Polychronakos

Gessel's walks are the planar walks that move within the positive quadrant $\mathbb{Z}_{+}^{2}$ by unit steps in any of the following directions: West, North-East, East and South-West. In this paper, we find an explicit expression for the…

Combinatorics · Mathematics 2011-10-04 Irina Kurkova , Kilian Raschel

We study a certain two-parameter family of non-standard graded complete intersections $A(m,n)$. In case $n=2$, we show that $A(m,2)$ has the strong Lefschetz property and the complex Hodge-Riemann property if and only if $m$ is even. This…

Commutative Algebra · Mathematics 2024-06-13 Nancy Abdallah , Chris McDaniel

A conjecture of J.M. Carnicer, E. Mainar and J.M. Pe\~{n}a states that the critical length of the space $P_{n}\odot C_{1}$ generated by the functions $x^{k}\sin x$ and $x^{k}\cos x$ for $k=0,...n$ is equal to the first positive zero…

Classical Analysis and ODEs · Mathematics 2025-05-16 Ognyan Kounchev , Hermann Render

Many recent papers deal with the enumeration of 2-dimensional walks with prescribed steps confined to the positive quadrant. The classification is now complete for walks with steps in $\{0, \pm 1\}^2$: the generating function is D-finite if…

Combinatorics · Mathematics 2025-04-11 Alin Bostan , Mireille Bousquet-Mélou , Manuel Kauers , Stephen Melczer

Various lattice path models are reviewed. The enumeration is done using generating functions. A few bijective considerations are woven in as well. The kernel method is often used. Computer algebra was an essential tool. Some results are…

Combinatorics · Mathematics 2022-01-26 Helmut Prodinger

We consider the enumeration of walks on the non-negative lattice $\mathbb{N}^d$, with steps defined by a set $\mathcal{S} \subset \{-1, 0, 1\}^d \setminus \{\mathbf{0}\}$. Previous work in this area has established asymptotics for the…

Combinatorics · Mathematics 2019-05-09 Stephen Melczer , Mark C. Wilson

It is shown that if $\gamma$ is a path of finite $p$ variation ($1\leq p< 2$) in a euclidean vector space and $f,g,h$ are Lipschitz functions on the trace of $\gamma$ then $s\mapsto F(s)=\int_\gamma f^sg dh$ defines an entire holomorphic…

Classical Analysis and ODEs · Mathematics 2016-01-14 Andrew Ursitti

Random walks are a series of up, down, and level steps that enumerate distinct paths from $(0,0)$ to $(2n,0)$, where $n$ is the semi-length of the path. We used these paths to analyze Catalan, Schr\"{o}der, and Motzkin number sequences…

Combinatorics · Mathematics 2018-11-08 Tonia Bell , Shakuan Frankson , Nikita Sachdeva , Myka Terry

We present two classes of random walks restricted to the quarter plane whose generating function is not holonomic. The non-holonomy is established using the iterated kernel method, a recent variant of the kernel method. This adds evidence…

Combinatorics · Mathematics 2011-02-10 Marni Mishna , Andrew Rechnitzer

The partition function of the O(n) loop model on the honeycomb lattice is mapped to that of the O(n) loop model on the 3-12 lattice. Both models share the same operator content and thus critical exponents. The critical points are related…

Statistical Mechanics · Physics 2015-06-25 M. T. Batchelor

We study a number of combinatorial and algebraic structures arising from walks on the two-dimensional integer lattice. To a given step set $X\subseteq\mathbb Z^2$, there are two naturally associated monoids: $\mathscr F_X$, the monoid of…

Combinatorics · Mathematics 2021-05-28 James East , Nicholas Ham

Let $a,n \in \mathbb{Z}^+$, with $a<n$ and $\gcd(a,n)=1$. Let $P_{a,n}$ denote the lattice parallelogram spanned by $(1,0)$ and $(a,n)$, that is, $$P_{a,n} = \left\{ t_1(1,0)+ t_2(a,n) \, : \, 0\leq t_1,t_2 \leq 1 \right\}, $$ and let…

Number Theory · Mathematics 2019-09-04 Gabriel Khan , Mizan R. Khan , Joydip Saha , Peng Zhao

Let $F(n,k)$ be a hypergeometric function that may be expressed so that $n$ appears within initial arguments of inverted Pochhammer symbols, as in factors of the form $\frac{1}{(n)_{k}}$. Only in exceptional cases is $F(n, k)$ such that…

Classical Analysis and ODEs · Mathematics 2024-03-27 John M. Campbell , Paul Levrie