Related papers: Card shuffling and $P$-partitions
In order to verify Percival's conjecture [J. Phys. B 6,L229 (1973)] we study a planar billiard in its classical and quantum versions. We provide an evaluation of the nearest-neighbor level-spacing distribution for the Cassini oval billiard,…
Pancake flipping, a famous open problem in computer science, can be formalised as the problem of sorting a permutation of positive integers using as few prefix reversals as possible. In that context, a prefix reversal of length k reverses…
There are several measures for fairness in ranking, based on different underlying assumptions and perspectives. PL optimization with the REINFORCE algorithm can be used for optimizing black-box objective functions over permutations. In…
The coefficient of restitution of a spherical particle in contact with a flat plate is investigated as a function of the impact velocity. As an experimental observation we notice non-trivial (non-Gaussian) fluctuations of the measured…
We extend the shuffle algebra perspective on scalar-valued non-commutative probability theory to the operator-valued case. Given an operator-valued probability space with an algebra $B$ acting on it (on the left and on the right), we…
In the game of Scrabble, letter tiles are drawn uniformly at random from a bag. The variability of possible draws as the game progresses is a source of variation that makes it more likely for an inferior player to win a head-to-head match…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
Probabilistic graphical models have emerged as a powerful modeling tool for several real-world scenarios where one needs to reason under uncertainty. A graphical model's partition function is a central quantity of interest, and its…
We study a family of shuffling operators on the symmetric group $S_n$, which includes the top-to-random shuffle. The general shuffling scheme consists of removing one card at a time from the deck (according to some probability distribution)…
Kingman's House-of-Cards model is a simple and celebrated model to describe the evolution of population under the competition of selection and mutation. Letting mutation probabilities vary on generations makes the model more realistic and…
We show that the theory of sorting by reversals fits into the well-established theory of circuit partitions of 4-regular multigraphs (which also involves the combinatorial structures of circle graphs and delta-matroids). In this way, we…
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…
Optimal shelflisting invites profit maximization to become sensitive to the ways in which purchasing decisions are order-dependent. We study the computational complexity of the corresponding product arrangement problem when consumers are…
In this paper, we study the staircase encoding of permutations, which maps a permutation to a staircase grid with cells filled with permutations. We consider many cases, where restricted to a permutation class, the staircase encoding…
Random sets are used to get a continuous partition of the cardinality of the union of many overlapping sets. The formalism uses M\"obius transforms and adapts Shapley's methodology in cooperative game theory, into the context of set theory.…
Within framework of the quantum calculus, we represent the partition function and the mass exponent of a multifractal, as well as the average of random variables distributed over self-similar set, on the basis of the deformed expansion in…
We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1…
By a random billiard we mean a billiard system in which the standard specular reflection rule is replaced with a Markov transition probabilities operator P that, at each collision of the billiard particle with the boundary of the billiard…
A noncommutative and noncocommutative Hopf algebra on finite topologies H_T is introduced and studied (freeness, cofreeness, self-duality...). Generalizing Stanley's definition of P-partitions associated to a special poset, we define the…
A systematic study of the probability distribution of superimposed random codes is presented through the use of generating functions. Special attention is paid to the cases of either uniformly distributed but not necessarily independent or…