Related papers: Card shuffling and $P$-partitions
We give a positive answer to a question raised by Davis et al. ({\em Discrete Mathematics} 341, 2018), concerning permutations with the same pinnacle set. Given $\pi\in S_n$, a {\em pinnacle} of $\pi$ is an element $\pi_i$ ($i\neq 1,n$)…
Bit-flip mutation is a common mutation operator for evolutionary algorithms applied to optimize functions over binary strings. In this paper, we develop results from the theory of landscapes and Krawtchouk polynomials to exactly compute the…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
We study the entanglement spectrum of a translationally-invariant lattice system under a random partition, implemented by choosing each site to be in one subsystem with probability $p\in[0, 1]$. We apply this random partitioning to a…
We consider MAP estimators for structured prediction with exponential family models. In particular, we concentrate on the case that efficient algorithms for uniform sampling from the output space exist. We show that under this assumption…
We consider the algebra of Hecke correspondences (elementary transformations at a single point) acting on the algebraic K-theory groups of the moduli spaces of stable sheaves on a smooth projective surface S. We derive quadratic relations…
The prefix exchange distance of a permutation is the minimum number of exchanges involving the leftmost element that sorts the permutation. We give new combinatorial proofs of known results on the distribution of the prefix exchange…
We examine crossing probabilities and free energies for conformally invariant critical 2-D systems in rectangular geometries, derived via conformal field theory and Stochastic L\"owner Evolution methods. These quantities are shown to…
This is an investigation of the role of shuffling and concatenating in the theory of graph drawing. A simple syntactic description of these and related operations is proved complete in the context of finite partial orders, as general as…
Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…
By resorting to sequential constructions of exchangeable random partitions (Pitman, 2006), and exploiting some known facts about generalized Stirling numbers, we derive a generalized Chinese restaurant process construction of exchangeable…
Fractional calculus allows one to generalize the linear, one-dimensional, diffusion equation by replacing either the first time derivative or the second space derivative by a derivative of fractional order. The fundamental solutions of…
We assess the probability of resonances between sufficiently distant states in a combinatorial graph serving as the configuration space of an N-particle disordered quantum system. This includes the cases where the transition "shuffles" the…
The paper considers implementations of some randomized algorithms in connection with obtaining a random $n^2 \times n^2$ Sudoku matrix with programming language C++. For this purpose we describes the set $\Pi_n$ of all $(2n) \times n$…
A permutation $\pi$ contains a pattern $\sigma$ if and only if there is a subsequence in $\pi$ with its letters are in the same relative order as those in $\sigma$. Partially ordered patterns (POPs) provide a convenient way to denote…
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees. This opens a powerful tool set to study enumerative and…
Let G be a finite group. Let pi be a permutation from S{n}. We study the distribution of probabilities of equality a{1} a{2} ...a{n-1}a{n}=a{pi{1}}^{epsilon{1}} a{pi_{2}}^{epsilon{2}}...a{pi{n-1}}^{epsilon_{n-1}} a_{pi_{n}}^{epsilon{n}},…
A class of probability distributions is characterized via equalities in law between two order statistics shifted by independent exponential variables. An explicit formula for the quintile function of the identified family of distributions…
Let $(X_1,X_2,...)$ be a random partition of the unit interval $[0,1]$, i.e. $X_i\geq0$ and $\sum_{i\geq1} X_i=1$, and let $(\varepsilon_1,\varepsilon_2,...)$ be i.i.d. Bernoulli random variables of parameter $p \in (0,1)$. The Bernoulli…
We characterise and enumerate permutations that are sortable by n-4 passes through a stack. We conjecture the number of permutations sortable by n-5 passes, and also the form of a formula for the general case n-k, which involves a…