Related papers: Overlap Cycles for Permutations: Necessary and Suf…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
Although well described by mean-field theory in the thermodynamic limit, scaling has long been puzzling for finite systems in high dimensions. This raised questions about the efficacy of the renormalization group and foundational concepts…
Pragmas for loop transformations, such as unrolling, are implemented in most mainstream compilers. They are used by application programmers because of their ease of use compared to directly modifying the source code of the relevant loops.…
An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…
Chen, Kitaev, M\"{u}tze, and Sun recently introduced the notion of universal partial words, a generalization of universal words and de Bruijn sequences. Universal partial words allow for a wild-card character $\diamond$, which is a…
We prove some general results about the asymptotics of the distribution of the number of cycles of given length of a random permutation whose distribution is invariant under conjugation. These results were first established to be applied in…
A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
We investigate mechanisms for language change within a framework where an unconventional signal for a meaning is first innovated, and then subsequently propagated through a speech community to replace the existing convention. We appeal to…
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
In the interchange process on a graph $G=(V,E)$, distinguished particles are placed on the vertices of $G$ with independent Poisson clocks on the edges. When the clock of an edge rings, the two particles on the two sides of the edge…
A combinatorial Gray code for a class of objects is a listing that contains each object from the class exactly once such that any two consecutive objects in the list differ only by a `small change'. Such listings are known for many…
A number of new sufficient conditions for generalized cycles (large cycles including Hamilton and dominating cycles as special cases) in an arbitrary $k$-connected graph $(k=1,2,...)$ and new lower bounds for the circumference (the length…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
In 1981, Alspach conjectured that the complete graph $ K_{n} $ could be decomposed into cycles of arbitrary lengths, provided that the obvious necessary conditions would hold. This conjecture was proved completely by Bryant, Horsley and…
Goulden and Jackson introduced a very powerful method to study the distributions of certain consecutive patterns in permutations, words, and other combinatorial objects which is now called the cluster method. There are a number of natural…
Overlap coincidence is an equivalent criterion to pure discrete spectrum of the dynamics of self affine tilings. In the case of one dimension, strong coincidence on m letter irreducible substitution has been introduced in Dekking (1978) and…
We prove the universality of the large deviations for conjugacy invariant permutations with few cycles. As an application, we establish the universality of large deviation at speeds $n$ and $\sqrt{n}$ for the length of monotone subsequences…
The percolation, Ising, and O($n$) models constitute fundamental systems in statistical and condensed matter physics. For short-range-interacting cases, the nature of their phase transitions is well established by renormalization-group…