Related papers: Bells, Motels and Permutation Groups
A bitset is a set that encodes for a binary number. Bitsets are at the basis of a beautiful theory of recombination with n-loci and here we begin from scratch and advance to include the derivation of the fundamental results about the…
Percolation is the paradigm for random connectivity and has been one of the most applied statistical models. With simple geometrical rules a transition is obtained which is related to magnetic models. This transition is, in all dimensions,…
In the context of the genome rearrangement problem, we analyze two well known models, namely the block transposition and the prefix block transposition models, by exploiting the connection with the notion of permutation pattern. More…
For an arbitrary finite permutation group $G$, subgroup of the symmetric group $S_\ell$, we determine the permutations involving only members of $G$ as $\ell$-patterns, i.e., avoiding all patterns in the set $S_\ell \setminus G$. The set of…
This paper concerns the computation and identification of the (homological) Conley index over the integers, in the context of discrete dynamical systems generated by continuous maps. We discuss the significance with respect to nonlinear…
A class of self-similar sets of entangled quantum states is introduced, for which a recursive definition is provided. These sets, the "Bell gems," are defined by the subsystem exchange symmetry characteristic of the Bell states. Each Bell…
The Hultman numbers enumerate permutations whose cycle graph has a given number of alternating cycles (they are relevant to the Bafna-Pevzner approach to genome comparison and genome rearrangements). We give two new interpretations of the…
We explain in detail the connections between the three concepts in the title, and we discuss how the `big' derived category of permutation modules introduced in arXiv:2009.14093 fits into the picture.
Permutation approach is suggested as a method to investigate financial time series in micro scales. The method is used to see how high frequency trading in recent years has affected the micro patterns which may be seen in financial time…
This article explains basic constructions and results on group algebras and their cohomology, starting from the point of view of commutative algebra. It provides the background necessary for a novice in this subject to begin reading Dave…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…
It is shown that the Bell inequalities are closely related to the triangle inequalities involving distance functions amongst pairs of random variables with values $\left\{ 0,1\right\} $. A hidden variables model may be defined as a mapping…
This is a comment on Phys. Rev. A 67, 022104(2003).
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…
This paper gives an overview on and summarizes existing complexity and algorithmic results of some variants of the Stable Marriage and the Stable Roommates problems. The last section defines a list of stable matching problems mentioned in…
Let $\pi=(\pi_1,\pi_2,\hdots,\pi_n)$ be permutation of the elements $1,2,\hdots,n. $ Positive integer $k\leq2^{n-1}$ we call index of $\pi,$ if in its binary notation as $n$-digital binary number, the 1's correspond to the ascent points. We…
This is a survey on permutation classes for the upcoming book Handbook of Enumerative Combinatorics.
We find the numbers of $3 \times 3$ magic, semimagic, and magilatin squares, as functions either of the magic sum or of an upper bound on the entries in the square. Our results on magic and semimagic squares differ from previous ones in…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…