Related papers: Length and area generating functions for height-re…
We propose generating functions which encode the degeneracies and wall-crossing phenomena of $\mathcal{N}=2$ BPS structures. The generating functions have a representation-theoretic origin and are the analogs of the 1/4-BPS dyon counting…
We study mean convergence of multiple ergodic averages, where the iterates arise from smooth functions of polynomial growth that belong to a Hardy field. Our results include all logarithmico-exponential functions of polynomial growth, such…
Motivated by the problem of bounding the number of iterations of the Simplex algorithm we investigate the possible lengths of monotone paths followed by the Simplex method inside the oriented graphs of polyhedra (oriented by the objective…
The intrinsic volumes induced by a stationary Poisson k-flat process inside a compact and convex sampling window are considered. Using techniques from stochastic analysis, more precisely calculus with multiple stochastic integrals and a…
Motivated by the classical ideas of generating functions for orthogonal polynomials, we initiate a new line of investigation on "generating operators" for a family of differential operators between two manifolds. We prove a novel formula of…
We review recent progress on the study of the Kardar-Parisi-Zhang (KPZ) equation in a periodic setting, which describes the random growth of an interface in a cylindrical geometry. The main results include central limit theorems for the…
In this paper we consider the length minimizing properties of Hamiltonian paths generated by quasi-autonomous Hamiltonians on symplectically aspherical manifolds. Motivated by the work of L. Polterovich and M. Schwarz, we study the role of…
We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…
The success of generative modeling in continuous domains has led to a surge of interest in generating discrete data such as molecules, source code, and graphs. However, construction histories for these discrete objects are typically not…
We propose a formalism to analyze discrete stochastic processes with finite-state-level N. By using an (N+1)-dimensional representation of su(2) Lie algebra, we re-express the master equation to a time-evolution equation for the state…
We develop a model in two dimensions to characterise the growth rate of a tracer gradient mixed by a statistically homogeneous flow with rapid temporal variations. % % The model is based on the orientation dynamics of the passive-tracer…
In last passage percolation models, the energy of a path is maximized over all directed paths with given endpoints in a random environment, and the maximizing paths are called geodesics. The geodesics and their energy can be scaled so that…
The enumeration of standard Young tableaux (SYTs) of shape {\lambda} can be easily computed by the hook-length formula. In 1981, Amitai Regev proved that the number of SYTs having at most three rows with n entries equals the nth Motzkin…
We present a perturbation approach to calculate the short-time propagator, or transition density, of the one-dimensional Fokker-Planck equation, to in principle arbitrary order in the time increment. Our approach preserves probability…
Iterative linear solvers have gained recent popularity due to their computational efficiency and low memory footprint for large-scale linear systems. The relaxation method, or Motzkin's method, can be viewed as an iterative method that…
We revisit the long standing problem of the geometric free variable approach to computing the generating function for disk amplitudes in the matrix model formulation of the 3-state Potts model coupled to 2D discrete gravity. This method is…
We propose a method to exactly generate bridge run-and-tumble trajectories that are constrained to start at the origin with a given velocity and to return to the origin after a fixed time with another given velocity. The method extends the…
We consider inhomogeneous lattice walk models in a half-space and in the quarter plane. For the models in a half-space, we show by a generalization of the kernel method to linear systems of functional equations that their generating…
The question of classifying the nature of the generating functions of restricted lattice walks has enjoyed much attention in past years. We prove that a certain class of octant walks have a D-finite generating function using the theory of…
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…