English
Related papers

Related papers: The Integrable Snake Model

200 papers

For any positive integer $N$, we describe a natural complex representation of the symmetric group $\Sigma_N$ on the vector space spanned by its involutions that contains each irreducible representation exactly once.

Representation Theory · Mathematics 2007-05-23 Vijay Kodiyalam , D. -N. Verma

We introduce a non-perturbative framework for computing structure constants of single-trace operators in the N=4 SYM theory at large N. Our approach features new vertices, with hexagonal shape, that can be patched together into three- and…

High Energy Physics - Theory · Physics 2015-05-27 Benjamin Basso , Shota Komatsu , Pedro Vieira

Snake robots enable mobility through extreme terrains and confined environments in terrestrial and space applications. However, robust perception and localization for snake robots remain an open challenge due to the proximity of the sensor…

We consider localized states in a discrete bistable Allen-Cahn equation. This model equation combines bistability and local cell-to-cell coupling in the simplest possible way. The existence of stable localized states is made possible by…

Pattern Formation and Solitons · Physics 2009-10-05 Christopher R. N. Taylor , Jonathan H. P. Dawes

We analyse the conformational behaviour of a linear semiflexible homo-polymer chain confined by two geometrical constraints under a good solvent condition in two dimensions. The constraints are stair shaped impenetrable surfaces. The…

Soft Condensed Matter · Physics 2014-07-14 Pramod Kumar Mishra

We study the computational complexity of routing multiple objects through a network in such a way that only few collisions occur: Given a graph $G$ with two distinct terminal vertices and two positive integers $p$ and $k$, the question is…

Computational Complexity · Computer Science 2017-05-11 Till Fluschnik , Marco Morik , Manuel Sorge

In this article we propose a general transformation for decorated spin models. The advantage of this transformation is to perform a direct mapping of a decorated spin model onto another effective spin thus simplifying algebraic computations…

Statistical Mechanics · Physics 2015-03-18 Onofre Rojas , S. M. de Souza

The asymmetric simple exclusion process (ASEP) is a paradigmatic driven-diffusive system that describes the asymmetric diffusion of particles with hardcore interactions in a lattice. Although the ASEP is known as an exactly solvable model,…

Statistical Mechanics · Physics 2024-05-16 Yuki Ishiguro , Jun Sato

The cluster complex on one hand, parking functions on the other hand, are two combinatorial (po)sets that can be associated to a finite real reflection group. Cluster parking functions are obtained by taking an appropriate fiber product…

Combinatorics · Mathematics 2025-05-05 Theo Douvropoulos , Matthieu Josuat-Vergès

By generalizing the algebra of operators of the Asymmetric Simple Exclusion Process (ASEP), a multi-species ASEP in which particles can overtake each other,is defined on both open and closed one dimensional chains. On the ring the steady…

Condensed Matter · Physics 2009-10-31 V. karimipour

Bioinspired snake robotics has been a highly active area of research over the years and resulted in many prototypes. Much of these prototypes takes the form of serially jointed-rigid bodies. The emergence of soft robotics contributed to a…

Robotics · Computer Science 2019-08-15 Isuru S. Godage

The totally asymmetric simple exclusion process (TASEP) is a stochastic model for the unidirectional dynamics of interacting particles on a $1$D-lattice that is much used in systems biology and statistical physics. Its master equation…

Statistical Mechanics · Physics 2024-08-01 Kilian Pioch , Thomas Kriecherbauer , Michael Margaliot , Lars Grüne

Recently, the one dimensional model of $N$ spins with $S=\frac{1}{2}$ on a circle, interacting with an exchange that falls off with the inverse square of the separation: $H_{\rm ISE} =\sum_{i\neq j} \frac{1}{[\frac{N}{\pi}…

Condensed Matter · Physics 2007-05-23 Johan Cornelis Talstra

We use the topology of simplicial complexes to model political structures following [1]. Simplicial complexes are a natural tool to encode interactions in the structures since a simplex can be used to represent a subset of compatible…

Physics and Society · Physics 2021-12-07 Andrea Mock , Ismar Volic

We introduce a new rule of motion for a totally asymmetric exclusion process (TASEP) representing pedestrian traffic on a lattice. Its characteristic feature is that the positions of the pedestrians, modeled as hard-core particles, are…

Statistical Mechanics · Physics 2017-09-20 C. Appert-Rolland , J. Cividini , H. J. Hilhorst

This paper studies random lozenge tilings of general non-convex polygonal regions. We show that the pairwise interaction of the non-convexities leads asymptotically to new kernels and thus to new statistics for the tiling fluctuations. The…

Mathematical Physics · Physics 2018-11-21 Mark Adler , Kurt Johansson , Pierre van Moerbeke

We examine the notion of anticonfinement and the role it has to play in the singularity analysis of discrete systems. A singularity is said to be anticonfined if singular values continue to arise indefinitely for the forward and backward…

Mathematical Physics · Physics 2017-11-17 Takafumi Mase , Ralph Willox , Alfred Ramani , Basil Grammaticos

We show that if the Stokes matrix of a connection with a pole of order two and no ramification gives rise, when added to its adjoint, to a positive semi-definite Hermitian form, then the associated integrable twistor structure (or TERP…

Algebraic Geometry · Mathematics 2011-07-20 Claus Hertling , Claude Sabbah

Motivated by recent applications in rough volatility and regularity structures, notably the notion of singular modelled distribution, we study paths, rough paths and related objects with a quantified singularity at zero. In a pure path…

Probability · Mathematics 2024-03-13 Carlo Bellingeri , Peter K. Friz , Máté Gerencsér

A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…

Combinatorics · Mathematics 2023-06-13 Jennifer Elder , Pamela E. Harris , Zoe Markman , Izah Tahir , Amanda Verga