Related papers: Permutations and negative beta-shifts

We present a simplified variant of Biane's bijection between permutations and 3-colored Motzkin paths with weight that keeps track of the inversion number, excedance number and a statistic so-called depth of a permutation. This generalizes…

We present positive maps and matrix inequalities for variables from the positive cone. These inequalities contain partial transpose and reshuffling operations, and can be understood as positive multilinear maps that are in one-to-one…

An n x n permutative matrix is a matrix in which every row is a permutation of the first row. In this paper the result given by Paparella in [Electron. J. Linear Algebra 31 (2016) 306-312] is extended to a more general lists of real and…

A reformulation of the path length of binary search trees is given in terms of permutations, allowing to extend the definition to the instance of words, where the letters are obtained by independent geometric random variables (with…

In inference problems involving a multi-dimensional parameter $\theta$, it is often natural to consider decision rules that have a risk which is invariant under some group $G$ of permutations of $\theta$. We show that this implies that the…

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

We consider a number of generalizations of the $\beta$-extended MacMahon Master Theorem for a matrix. The generalizations are based on replacing permutations on multisets formed from matrix indices by partial permutations or derangements…

We obtain an upper and lower bound for the number of reduced words for a permutation in terms of the number of braid classes and the number of commutation classes of the permutation. We classify the permutations that achieve each of these…

Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining…

$\beta(1,0)$-trees provide a convenient description of rooted non-separable planar maps. The involution $h$ on $\beta(1,0)$-trees was introduced to prove a complicated equidistribution result on a class of pattern-avoiding permutations. In…

We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

We consider independent edge percolation models on Z, with edge occupation probabilities p_<x,y> = p if |x-y| = 1, 1 - exp{- beta / |x-y|^2} otherwise. We prove that oriented percolation occurs when beta > 1 provided p is chosen…

In this letter, we generalize the convolutional NMF by taking the $\beta$-divergence as the contrast function and present the correct multiplicative updates for its factors in closed form. The new updates unify the $\beta$-NMF and the…

A recent paper by Zapletal arXiv:2404.10612 discusses permutation models of set theory which arise from dynamical ideals and highlights properties of the dynamical ideal which relate to fragments of choice in the permutation model. In this…

In model-driven development, an ordered model transformation is a nested set of transformations between source and target classes, in which each transformation is governed by its own pre and post- conditions, but structurally dependent on…

Suppose we are given an infinite sequence of input cells, each initialized with a uniform random symbol from $[n]$. How hard is it to output a sequence in $[n]^n$ that is close to a uniform random permutation? Viola (SICOMP 2020)…

We consider a one dimensional affine switched system obtained from a formal limit of a two dimensional linear system. We show this is equivalent to minimising the average digit in beta representations with unrestricted digits. We give a…

The random beta-transformation K is isomorphic to a full shift. This relation gives an invariant measure for K that yields the Bernoulli convolution by projection. We study the local dimension of the invariant measure for K for special…

We consider the derived category of permutation modules for a finite group, in positive characteristic. We stratify this tensor triangulated category using Brauer quotients. We describe the spectrum of its compact objects, by reducing the…