English
Related papers

Related papers: Permutations of $\mathbb{Z}^d$ with restricted mov…

200 papers

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

Probability · Mathematics 2007-05-23 Majid Hosseini , Krishnamurthi Ravishankar

We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…

Dynamical Systems · Mathematics 2014-12-02 Ethan Coven , Reem Yassawi

In this paper, we study the generating functions for the number of pattern restricted Stirling permutations with a given number of plateaus, descents and ascents. Properties of the generating functions, including symmetric properties and…

Combinatorics · Mathematics 2016-07-21 David Callan , Shi-Mei Ma , Toufik Mansour

Let $\{X(v), v \in \Bbb Z^d \times \Bbb Z_+\}$ be an i.i.d. family of random variables such that $P\{X(v)= e^b\}=1-P\{X(v)= 1\} = p$ for some $b>0$. We consider paths $\pi \subset \Bbb Z^d \times \Bbb Z_+$ starting at the origin and with…

Probability · Mathematics 2007-06-26 Harry Kesten , Vladas Sidoravicius

For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…

Dynamical Systems · Mathematics 2017-05-02 Kevin McGoff , Ronnie Pavlov

Multistable coupled map lattices typically support travelling fronts, separating two adjacent stable phases. We show how the existence of an invariant function describing the front profile, allows a reduction of the infinitely-dimensional…

chao-dyn · Physics 2009-10-31 R. Carretero-González , D. K. Arrowsmith , F. Vivaldi

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

Combinatorics · Mathematics 2023-06-30 Gal Beniamini , Nir Lavee , Nati Linial

A descent $k$ of a permutation $\pi=\pi_{1}\pi_{2}\dots\pi_{n}$ is called a big descent if $\pi_{k}>\pi_{k+1}+1$; denote the number of big descents of $\pi$ by $\operatorname{bdes}(\pi)$. We study the distribution of the…

Combinatorics · Mathematics 2024-09-02 Sergi Elizalde , Johnny Rivera , Yan Zhuang

For each prime number $p$, the dynamical behavior of the square mapping on the ring $\mathbb{Z}_p$ of $p$-adic integers is studied. For $p=2$, there are only attracting fixed points with their attracting basins. For $p\geq 3$, there are a…

Dynamical Systems · Mathematics 2014-08-21 Shilei Fan , Lingmin Liao

We show how the small perturbations of a linear cocycle have a relative rotation number associated with an invariant measure of the base dynamics an with a $2$-dimensional bundle of the finest dominated splitting (provided that some…

Dynamical Systems · Mathematics 2022-06-24 Nicolas Gourmelon

We show that the number of geometric permutations of an arbitrary collection of $n$ pairwise disjoint convex sets in $\mathbb{R}^d$, for $d\geq 3$, is $O(n^{2d-3}\log n)$, improving Wenger's 20 years old bound of $O(n^{2d-2})$.

Computational Geometry · Computer Science 2010-07-20 Natan Rubin , Haim Kaplan , Micha Sharir

A single permutation, seen as union of disjoint cycles, represents a regular graph of degree two. Consider $d$ many independent random permutations and superimpose their graph structures. It is a common model of a random regular (multi-)…

Probability · Mathematics 2014-12-30 Shirshendu Ganguly , Soumik Pal

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

Probability · Mathematics 2023-01-09 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

We provide a class of examples of interacting particle systems on $\mathbb{Z}^d$, for $d\in\{1,2\}$, that admit a unique translation-invariant stationary measure, which is not the long-time limit of all translation-invariant starting…

Probability · Mathematics 2025-09-24 Jonas Köppl , Benedikt Jahnel

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

Combinatorics · Mathematics 2007-06-22 Guo-Niu Han , Guoce Xin

We study branching random walks in random i.i.d. environment in $\Z^d, d \geq 1$. For this model, the population size cannot decrease, and a natural definition of recurrence is introduced. We prove a dichotomy for recurrence/transience,…

Probability · Mathematics 2007-05-23 Francis Comets , Serguei Popov

In this article, we study the behaviour of discrete one-dimensional dynamical systems associated to functions on finite sets. We formalise the global orbit pattern formed by all the periodic orbits (gop) as the ordered set of periods when…

Dynamical Systems · Mathematics 2009-07-12 Rene Lozi , Clarisse Fiol

In this article we answer a question asked by Chien et al. in arXiv:2304.06050 in which they study the numerical range of weighted cyclic matrices under permutation of their entries. Namely, we are interested in how $w(A_\sigma)$ fluctuates…

Functional Analysis · Mathematics 2025-12-30 Simon Marionnet

The graph of overlapping permutations is defined in a way analogous to the De Bruijn graph on strings of symbols. That is, for every permutation $\pi = \pi_{1} \pi_{2} ... \pi_{n+1}$ there is a directed edge from the standardization of…

Combinatorics · Mathematics 2014-10-08 Richard Ehrenborg , Sergey Kitaev , Einar Steingrimsson

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…

Probability · Mathematics 2025-10-07 Jacopo Borga , Sourav Chatterjee , Persi Diaconis
‹ Prev 1 4 5 6 7 8 10 Next ›