English
Related papers

Related papers: Analytic Combinatorics of Planar Lattice Paths

200 papers

Lattice paths are functional entities that model efficient navigation in discrete/grid maps. This paper presents a new scheme to generate collision-free lattice paths with utmost efficiency using the bijective property to rooted ordered…

Robotics · Computer Science 2022-09-13 Victor Parque

We review various combinatorial applications of field theoretical and matrix model approaches to equilibrium statistical physics involving the enumeration of fixed and random lattice model configurations. We show how the structures of the…

Statistical Mechanics · Physics 2007-05-23 P. Di Francesco

In this paper, we investigate the asymptotic symmetry and monotonicity of positive solutions to a reaction-diffusion equation in the unit ball, utilizing techniques from elliptic geometry. Firstly, we discuss the properties of solutions in…

Analysis of PDEs · Mathematics 2024-09-10 Baiyu Liu , Wenlong Yang

Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…

Quantum Algebra · Mathematics 2009-10-31 Anne Schilling , S. Ole Warnaar

We present a method to derive an upper bound for the entropy density of coupled map lattices with local interactions from local observations. To do this, we use an embedding technique being a combination of time delay and spatial embedding.…

Chaotic Dynamics · Physics 2009-10-31 Eckehard Olbrich , Rainer Hegger , Holger Kantz

This note is a shortened version of my dissertation thesis, defended at Stony Brook University in December 2004. It illustrates how dynamic complexity of a system evolves under deformations. The objects I considered are quartic polynomial…

Dynamical Systems · Mathematics 2007-05-23 Anca Radulescu

Symmetric elliptic integrals, which have been used as replacements for Legendre's integrals in recent integral tables and computer codes, are homogeneous functions of three or four variables. When some of the variables are much larger than…

Classical Analysis and ODEs · Mathematics 2016-09-06 Bille C. Carlson , John L. Gustafson

(Presented at conference on Fundamental Problems in Physics - UMBC - June 1994) It is shown that among the orthogonal sets of EPR (completely entangled) states there is a unique basis (up to equivalence) that is a also a perfectly resolved…

High Energy Physics - Theory · Physics 2009-10-28 Daniel I. Fivel

We study a number of 1+1d lattice models with anti-unitary symmetries that simultaneously reflect space and reverse time. Some of these symmetries are anomalous, leading to Lieb-Schultz-Mattis-type constraints, thus excluding a trivially…

High Energy Physics - Theory · Physics 2025-12-01 Nathan Seiberg , Shu-Heng Shao , Wucheng Zhang

Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also…

Robotics · Computer Science 2021-01-14 Jonathan D. Gammell , Marlin P. Strub

A recent proposal to connect the loop quantization with the spin foam model for cosmology via the path integral is hereby adapted to the case of mechanical systems within the framework of the so called polymer quantum mechanics. The…

General Relativity and Quantum Cosmology · Physics 2017-03-31 Hugo A. Morales-Técotl , Saeed Rastgoo , Juan C. Ruelas

One major systematic uncertainty of lattice QCD results is due to the continuum extrapolation. For an asymptotically free theory like QCD one finds corrections of the form $a^{n_\mathrm{min}}[2b_0\bar{g}^2(1/a)]^{\hat{\Gamma}_i}$ with…

High Energy Physics - Lattice · Physics 2022-12-20 Nikolai Husung

We analyse some enumerative and asymptotic properties of lattice paths below a line of rational slope. We illustrate our approach with Dyck paths under a line of slope $2/5$. This answers Knuth's problem #4 from his "Flajolet lecture"…

Discrete Mathematics · Computer Science 2016-10-06 Cyril Banderier , Michael Wallner

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

Number Theory · Mathematics 2013-09-02 Kathrin Bringmann , Karl Mahlburg

We obtain bivariate asymptotics for the number of (unicellular) combinatorial maps (a model of discrete surfaces) as both the size and the genus grow. This work is related to two research topics that have been very active recently:…

Combinatorics · Mathematics 2026-04-14 Andrew Elvey Price , Wenjie Fang , Baptiste Louf , Michael Wallner

Based on some recent progress on a relation between four dimensional super Yang-Mills gauge theory and quantum integrable system, we study the asymptotic spectrum of the quantum mechanical problems described by the Mathieu equation and the…

Mathematical Physics · Physics 2015-07-29 Wei He

We study two versions of the asymmetric exclusion process (ASEP) -- an ASEP on a semi-infinite lattice with an open left boundary, and an ASEP on a finite lattice with open left and right boundaries -- and we demonstrate a surprising…

Statistical Mechanics · Physics 2012-04-06 Tomohiro Sasamoto , Lauren Williams

We introduce and study the new combinatorial class of Dyck paths with air pockets. We exhibit a bijection with the peakless Motzkin paths which transports several pattern statistics and give bivariate generating functions for the…

Discrete Mathematics · Computer Science 2023-03-07 Jean-Luc Baril , Sergey Kirgizov , Rémi Maréchal , Vincent Vajnovszki

We study the path behavior of the anisotropic random walk on the two-dimensional lattice Z^2. Simultaneous strong approximations of its components are given.

Probability · Mathematics 2022-07-07 Endre Csaki , Antonia Foldes

We describe a new algebraic technique for enumerating self-avoiding walks on the rectangular lattice. The computational complexity of enumerating walks of $N$ steps is of order $3^{N/4}$ times a polynomial in $N$, and so the approach is…

High Energy Physics - Lattice · Physics 2008-11-26 A R Conway , I G Enting , A J Guttmann
‹ Prev 1 8 9 10 Next ›