Related papers: Quadrant marked mesh patterns in 132-avoiding perm…
Distribution matching (DM) transforms independent and Bernoulli(1/2) distributed bits into a sequence of output symbols with a desired distribution. A fixed-to-fixed length, invertible DM architecture based on shell mapping is presented. It…
We consider permutations sortable by $k$ passes through a deterministic pop stack. We show that for any $k\in\mathbb N$ the set is characterised by finitely many patterns, answering a question of Claesson and Gu{\dh}mundsson. Our…
Computational analysis with the finite element method requires geometrically accurate meshes. It is well known that high-order meshes can accurately capture curved surfaces with fewer degrees of freedom in comparison to low-order meshes.…
We consider the asymptotic behavior as $n\to\infty$ of the spectra of random matrices of the form \[\frac{1}{\sqrt{n-1}}\sum_{k=1}^{n-1}Z_{nk}\rho_n ((k,k+1)),\] where for each $n$ the random variables $Z_{nk}$ are i.i.d. standard Gaussian…
Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…
The flavour neutrino puzzle is often addressed by considering neutrino mass matrices $m$ with a certain number of vanishing entries ($m_{ij}=0$ for some values of the indices), since a reduction in the number of free parameters increases…
We define a variation of Stirling permutations, called quasi-Stirling permutations, to be permutations on the multiset $\{1,1,2,2,\ldots, n,n\}$ that avoid the patterns 1212 and 2121. Their study is motivated by a known relationship between…
We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs. The involutions switching nesting and crossing numbers for set…
This paper focuses on the size-biased permutation of $n$ independent and identically distributed (i.i.d.) positive random variables. This is a finite dimensional analogue of the size-biased permutation of ranked jumps of a subordinator…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We present several multi-variable generating functions for a new pattern matching condition on the wreath product of the cyclic group and the symmetric group. Our new pattern matching condition requires that the underlying permutations…
A new class of Markov chain Monte Carlo (MCMC) algorithms, based on simulating piecewise deterministic Markov processes (PDMPs), have recently shown great promise: they are non-reversible, can mix better than standard MCMC algorithms, and…
The Standard Model lacks an organizing principle to describe quark and lepton ``flavours''. Neutrino oscillation experiments show that leptons mix very differently from quarks, adding a major challenge to the flavour puzzle. We briefly…
Let $C_{n,g}$ be the number of rooted cubic maps with $2n$ vertices on the orientable surface of genus $g$. We show that the sequence $(C_{n,g}:g\ge 0)$ is asymptotically normal with mean and variance asymptotic to $(1/2)(n-\ln n)$ and…
In the absence of a Grand Unified Theory framework, connecting the values of the mixing parameters in the quark and lepton sector is a difficult task, unless one introduces ad-hoc relations among the matrices that diagonalize such different…
Permutation invariant Gaussian matrix models were recently developed for applications in computational linguistics. A 5-parameter family of models was solved. In this paper, we use a representation theoretic approach to solve the general…
Discrepancy measures between probability distributions are at the core of statistical inference and machine learning. In many applications, distributions of interest are supported on different spaces, and yet a meaningful correspondence…
A more sums than differences (MSTD) set is a finite subset S of the integers such |S+S| > |S-S|. We show that the probability that a uniform random subset of {0, 1, ..., n} is an MSTD set approaches some limit rho > 4.28 x 10^{-4}. This…
In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms…