Related papers: Pattern-functions, statistics, and shallow permuta…
This paper gives a method for computing distributions associated with patterns in the state sequence of a hidden Markov model, conditional on observing all or part of the observation sequence. Probabilities are computed for very general…
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…
Arrow patterns were introduced by Berman and Tenner as a generalization of vincular patterns. They observed that arrow patterns have the potential to bridge the divide between a permutation's cycle notation and its one-line notation; in…
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…
This study involves definitions for multiple-counting regular and summation sequences of rho. My paper introduces and proves recurrent relationships for multiple-counting sequences and shows their association with Fermat's little theorem. I…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
Consider the number of permutations in the symmetric group on n letters that contain c copies of a given pattern. As c varies (with n held fixed) these numbers form a sequence whose properties we study for the monotone patterns and the…
We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…
We consider certain scalar product of symmetric functions which is parameterized by a function $r$ and an integer $n$. One the one hand we have a fermionic representation of this scalar product. On the other hand we get a representation of…
A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…
The Pascal matrix, $P$, is an upper diagonal matrix whose entries are the binomial coefficients. In 1993 Call and Velleman demonstrated that it satisfies the beautiful relation $P=\exp(H)$ in which $H$ has the numbers 1, 2, 3, etc. on its…
In the statistical analysis of objects, samples and populations with quantitative variables, in many occasions we are interested in knowing the proportions that exist between the different variables from a same object; if these proportions…
Learning arguably involves the discovery and memorization of abstract rules. The aim of this paper is to study associative memory mechanisms. Our model is based on high-dimensional matrices consisting of outer products of embeddings, which…
We study fluctuation properties of embedded random matrix ensembles of non-interacting particles. For ensemble of two non-interacting particle systems, we find that unlike the spectra of classical random matrices, correlation functions are…
Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…
We study a novel spline-like basis, which we name the "falling factorial basis", bearing many similarities to the classic truncated power basis. The advantage of the falling factorial basis is that it enables rapid, linear-time computations…
A Mahonian d-function is a Mahonian statistic that can be expressed as a linear combination of vincular pattern statistics of length at most d. Babson and Steingrimsson classified all Mahonian 3-functions up to trivial bijections and…
We set up a new notion of local convergence for permutations and we prove a characterization in terms of proportions of \emph{consecutive} pattern occurrences. We also characterize random limiting objects for this new topology introducing a…
We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…
Arslan, Altoum, and Zaarour introduced an inversion statistic for generalized symmetric groups. In this work, we study the distribution of this statistic over colored permutations, including derangements and involutions. By establishing a…