English
Related papers

Related papers: Schubert polynomials, the inhomogeneous TASEP, and…

200 papers

We determine diameters of Markov chains describing one-dimensional N -particle models with an exclusion interaction, namely the Ssep (symmetric simple exclusion process) and one of its non-reversible liftings, the lifted Tasep (totally…

Statistical Mechanics · Physics 2024-10-14 Xusheng Zhang , Werner Krauth

A partial $(n,k,t)_\lambda$-system is a pair $(X,\mathcal{B})$ where $X$ is an $n$-set of vertices and $\mathcal{B}$ is a collection of $k$-subsets of $X$ called blocks such that each $t$-set of vertices is a subset of at most $\lambda$…

Combinatorics · Mathematics 2023-11-23 Daniel Horsley , Padraig Ó Catháin

We introduce a permutation analogue of the celebrated Szemeredi Regularity Lemma, and derive a number of consequences. This tool allows us to provide a structural description of permutations which avoid a specified pattern, a result that…

Combinatorics · Mathematics 2007-05-23 Joshua N. Cooper

Gelfand-Tsetlin polytopes are classical objects in algebraic combinatorics arising in the representation theory of $\mathfrak{gl}_n(\mathbb{C})$. The integer point transform of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ projects to…

Combinatorics · Mathematics 2019-03-28 Ricky Ini Liu , Karola Mészáros , Avery St. Dizier

We give a permutation pattern avoidance criteria for determining when the projection map from the flag variety to a Grassmannian induces a fiber bundle structure on a Schubert variety. In particular, we introduce the notion of a split…

Combinatorics · Mathematics 2018-08-20 Timothy Alland , Edward Richmond

In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of…

Quantum Physics · Physics 2023-01-18 Gergely Bunth , Gábor Maróti , Milán Mosonyi , Zoltán Zimborás

Consider the following Markov chain on permutations of length $n$. At each time step we choose a random position. If the letter at that position is smaller than the letter immediately to the left (cyclically) then these letters swap…

Probability · Mathematics 2013-01-01 Erik Aas

We study the enumeration of diagonally and antidiagonally symmetric alternating sign matrices (DASASMs) of fixed odd order by introducing a case of the six-vertex model whose configurations are in bijection with such matrices. The model…

Combinatorics · Mathematics 2017-08-01 Roger E. Behrend , Ilse Fischer , Matjaž Konvalinka

We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…

Combinatorics · Mathematics 2014-02-07 Avinash J. Dalal , Jennifer Morse

We extend the notion of consecutive pattern avoidance to considering sums over all permutations where each term is a product of weights depending on each consecutive pattern of a fixed length. We study the problem of finding the asymptotics…

Combinatorics · Mathematics 2013-12-10 Richard Ehrenborg , JiYoon Jung

We study the totally asymmetric simple exclusion process (TASEP) on trees where particles are generated at the root. Particles can only jump away from the root, and they jump from $x$ to $y$ at rate $r_{x,y}$ provided $y$ is empty. Starting…

Probability · Mathematics 2024-10-01 Nina Gantert , Nicos Georgiou , Dominik Schmid

Let $st=\{st_1,\ldots,st_k\}$ be a set of $k$ statistics on permutations with $k\geq 1$. We say that two given subset of permutations $T$ and $T'$ are $st$-Wilf-equivalent if the joint distributions of all statistics in $st$ over the sets…

Combinatorics · Mathematics 2021-05-18 Paul M. Rakotomamonjy

It is a classical result that the parity-balance of the number of weak excedances of all permutations (derangements, respectively) of length $n$ is the Euler number $E_n$, alternating in sign, if $n$ is odd (even, respectively).…

Combinatorics · Mathematics 2018-02-06 Sen-Peng Eu , Tung-Shan Fu , Hsiang-Chun Hsu , Hsin-Chieh Liao

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

Combinatorics · Mathematics 2022-08-26 Ross G. Pinsky

For $\tau\in S_3$, let $S_n(\tau)$ denote the set of permutations in $S_n$ which avoid the pattern $\tau$, and let $E_n^\tau$ denote the expectation with respect to the uniformly random probability measure on $S_n(\tau)$. Let…

Probability · Mathematics 2022-03-25 Ross G. Pinsky

In the matrix product states approach to $n$ species diffusion processes the stationary probability distribution is expressed as a matrix product state with respect to a quadratic algebra determined by the dynamics of the process. The…

Statistical Mechanics · Physics 2008-04-24 Boyka Aneva

The purpose of this article is to describe the two approaches to compute exact formulas (which are amenable to asymptotic analysis) for the probability distribution of the current of particles past a given site in the asymmetric simple…

Probability · Mathematics 2013-03-13 Ivan Corwin

Consider the Totally Asymmetric Simple Exclusion Process (TASEP) on the integer lattice $ \mathbb{Z} $. We study the functional Large Deviations of the integrated current $ \mathsf{h}(t,x) $ under the hyperbolic scaling of space and time by…

Probability · Mathematics 2019-02-14 Stefano Olla , Li-Cheng Tsai

Egge and Mansour have recently studied permutations which avoid 1243 and 2143 regarding the occurrence of certain additional patterns. Some of the open questions related to their work can easily be answered by using permutation diagrams.…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

Let us consider a homogeneous Markov chain with discrete time and with a finite set of states $E_0,\ldots,E_n$ such that the state $E_0$ is absorbing, states $E_1,\ldots,E_n$ are nonrecurrent. The goal of this work is to study frequencies…

Information Theory · Computer Science 2013-08-23 Vladimir V. Bochkarev , Eduard Yu. Lerner
‹ Prev 1 8 9 10 Next ›