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

Let $S_{\rm div}(n)$ denote the set of permutations $\pi$ of $n$ such that for each $1\leq j \leq n$ either $j \mid \pi(j)$ or $\pi(j) \mid j$. These permutations can also be viewed as vertex-disjoint directed cycle covers of the divisor…

We study properties of 3-restricted min-wise independent sets of permutations and prove that the class of these sets is isomorphic to the class of subsets of vertices of multi-dimentional hypercube of certain size with certain pair-wise…

Let $\mathbb{K}$ be a field of characteristic $0$. For each choice of distinct $a_1, \ldots, a_n\in \mathbb{K}$ and distinct $b_1, \ldots, b_n\in \mathbb{K}$, consider the sum $S=\sum_{i=1}^n a_i b_{\pi(i)}$ as $\pi$ ranges over the…

A set $S$ of permutations is forcing if for any sequence $\{\Pi_i\}_{i \in \mathbb{N}}$ of permutations where the density $d(\pi,\Pi_i)$ converges to $\frac{1}{|\pi|!}$ for every permutation $\pi \in S$, it holds that $\{\Pi_i\}_{i \in…

We describe the statistical properties of the dynamics of the quadratic polynomials P_a(z):=e^{2\pi a i} z+z^2 on the complex plane, with a of high return times. In particular, we show that these maps are uniquely ergodic on their measure…

Building on the work of Grinberg and Stanley, we begin a systematic study of permutations with a prescribed $X$-descent set. In particular, for a set $X \subseteq \mathbb{N}^2$, and $I \subseteq [n-1]$, we study the permutations $\pi \in…

The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…

R. Pavlov and S. Schmieding provided recently some results about generic $\mathbb{Z}$-shifts, which rely mainly on an original theorem stating that isolated points form a residual set in the space of $\mathbb{Z}$-shifts such that all other…

We characterize the d x d matrices whose numerical ranges are invariant by rotations of angle 2$\pi$/d.

Given a permutation $\pi$ chosen uniformly from $S_n$, we explore the joint distribution of $\pi(1)$ and the number of descents in $\pi$. We obtain a formula for the number of permutations with $\des(\pi)=d$ and $\pi(1)=k$, and use it to…

We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In…

The scope of this paper is two-fold. First, to present to the researchers in combinatorics an interesting implementation of permutations avoiding generalized patterns in the framework of discrete-time dynamical systems. Indeed, the orbits…

In this paper we investigate a class of (d+1) dimensional cosmological models with a cosmological constant possessing an R^d simply transitive symmetry group and show that it can be written in a form that manifests the effect of a…

We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…

In this paper, we introduce plane permutations, i.e. pairs $\mathfrak{p}=(s,\pi)$ where $s$ is an $n$-cycle and $\pi$ is an arbitrary permutation, represented as a two-row array. Accordingly a plane permutation gives rise to three distinct…

A pure excedance in a permutation $\pi=\pi_1\pi_2\ldots \pi_n$ is a position $i<\pi_i$ such that there is no $j<i$ with $i\leq \pi_j<\pi_i$. We present a one-to-one correspondence on the symmetric group that transports pure excedances to…