English
Related papers

Related papers: A human proof of Gessel's lattice path conjecture

200 papers

For cofinite Kleinian groups, with finite-dimensional unitary representations, we derive the Selberg trace formula. As an application we define the corresponding Selberg zeta-function and compute its divisor, thus generalizing results of…

Number Theory · Mathematics 2007-05-23 Joshua S. Friedman

Roughly ten years ago, the following "Gorenstein Interval Conjecture" (GIC) was proposed: Whenever $(1,h_1,\dots,h_i,\dots,h_{e-i},\dots,h_{e-1},1)$ and $(1,h_1,\dots,h_i+\alpha,\dots,h_{e-i}+\alpha,\dots,h_{e-1},1)$ are both Gorenstein…

Commutative Algebra · Mathematics 2019-01-23 Sung Gi Park , Richard P. Stanley , Fabrizio Zanello

We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…

Quantum Physics · Physics 2016-04-21 Norio Konno , Hideo Mitsuhashi , Iwao Sato

Let $\mathcal{L}_n$ denote the set of all paths from $[0,0]$ to $[n, n]$ which consist of either unit north steps $N$ or unit east steps $E$ or, equivalently, the set of all words $L \in \{E,N\}^*$ with $n$ $E$'s and $n$ $N$'s. Given $L \in…

Combinatorics · Mathematics 2017-08-25 Ran Pan , Jeffrey B. Remmel

We give a combinatorial interpretation of vector continued fractions obtained by applying the Jacobi-Perron algorithm to a vector of $p\geq 1$ resolvent functions of a banded Hessenberg operator of order $p+1$. The interpretation consists…

Combinatorics · Mathematics 2023-05-09 Abey López-García , Vasiliy A. Prokhorov

We obtain an explicit formula to enumerate closed random walks on a cubic lattice with a specified length and 3D algebraic area. The 3D algebraic area is defined as the sum of algebraic areas obtained from the walk's projection onto the…

Mathematical Physics · Physics 2023-11-07 Li Gan

We consider singular (aka genus $0$) walks in the quarter plane and their associated generating functions $Q(x,y,t)$, which enumerate the walks starting from the origin, of fixed endpoint (encoded by the spatial variables $x$ and $y$) and…

Combinatorics · Mathematics 2025-04-21 Alin Bostan , Lucia Di Vizio , Kilian Raschel

Let $G$ be a complex semisimple simply connected linear algebraic group. Let $\lambda$ be a dominant weight for $G$ and $\mathcal{I} = (i_1, i_2, \ldots, i_n)$ a word decomposition for an element $w = s_{i_1} s_{i_2} \cdots s_{i_n}$ of the…

Combinatorics · Mathematics 2016-01-20 Megumi Harada , Eunjeong Lee

Let $a_n$ denote the number of ways in which a chess rook can move from a corner cell to the opposite corner cell of an $n \times n \times n$ three-dimensional chessboard, assuming that the piece moves closer to the goal cell at each step.…

Symbolic Computation · Computer Science 2011-10-03 Alin Bostan , Frédéric Chyzak , Mark van Hoeij , Lucien Pech

For nonsupersymmetric theories, the one-loop effective action can be computed via zeta function regularization in terms of the functional trace of the heat kernel associated with the operator which appears in the quadratic part of the…

High Energy Physics - Theory · Physics 2009-10-30 I. N. McArthur , T. D. Gargett

We give two combinatorial interpretations of the Matrix Ansatz of the PASEP in terms of lattice paths and rook placements. This gives two (mostly) combinatorial proofs of a new enumeration formula for the partition function of the PASEP.…

Combinatorics · Mathematics 2021-01-26 Sylvie Corteel , Matthieu Josuat-Verges , Thomas Prellberg , Martin Rubey

Around 2000, J.-Y. Girard developed a logical theory, called Ludics. This theory was a step in his program of Geometry of Interaction, the aim of which being to account for the dynamics of logical proofs. In Ludics, objects called designs…

Logic in Computer Science · Computer Science 2023-06-22 Christophe Fouqueré , Myriam Quatrini

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

Probability · Mathematics 2012-06-11 Frank den Hollander , Alex A. Opoku

In this paper, following the recent paper on Walk/Zeta Correspondence by the first author and his coworkers, we compute the zeta function for the three- and four-state quantum walk and correlated random walk, and the multi-state random walk…

Quantum Physics · Physics 2022-03-04 Norio Konno , Shunya Tamura

It is classically known that the proportion of lattice points visible from the origin via functions of the form $f(x)=nx$ with $n\in \mathbb{Q}$ is $\frac{1}{\zeta(2)}$ where $\zeta(s)$ is the classical Reimann zeta function. Goins, Harris,…

Number Theory · Mathematics 2017-12-27 Pamela E. Harris , Mohamed Omar

We discuss the combinatorics of the decorated Dyck paths appearing in the Delta conjecture framework of Haglund, Remmel and Wilson (2015) and Zabrocki (2016), by introducing two new statistics, bounce and bounce'. We then provide plethystic…

Combinatorics · Mathematics 2017-09-27 Michele D'Adderio , Anna Vanden Wyngaerd

Quantum random walks are constructed on operator spaces with the aid of matrix-space lifting, a type of ampliation intermediate between those provided by spatial and ultraweak tensor products. Using a form of Wiener-Ito decomposition, a…

Operator Algebras · Mathematics 2010-03-16 Alexander C. R. Belton

This paper explores analogies between the Weil proof of the Riemann hypothesis for function fields and the geometry of the adeles class space, which is the noncommutative space underlying Connes' spectral realization of the zeros of the…

Number Theory · Mathematics 2007-05-23 Alain Connes , Caterina Consani , Matilde Marcolli

In this paper, we work on a class of self-interacting nearest neighbor random walks, introduced in [Probab. Theory Related Fields 154 (2012) 149-163], for which there is competition between repulsion of neighboring edges and attraction of…

Probability · Mathematics 2016-03-16 Daniel Kious

A growing self-avoiding walk (GSAW) is a stochastic process that starts from the origin on a lattice and grows by occupying an unoccupied adjacent lattice site at random. A sufficiently long GSAW will reach a state in which all adjacent…

Combinatorics · Mathematics 2022-07-04 Alexander R. Klotz , Everett Sullivan
‹ Prev 1 8 9 10 Next ›