Related papers: s-Overlap Cycles for Permutations

A k-uniform linear cycle of length s is a cyclic list of k-sets A_1,..., A_s such that consecutive sets intersect in exactly one element and nonconsecutive sets are disjoint. For all k at least 5 and s at least 3 and sufficiently large n we…

Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…

Given a field $k$ and a finite group $H$, {\it{an $H$-parametric extension over $k$}} is a finite Galois extension of $k(T)$ of Galois group containing $H$ which is regular over $k$ and has all the Galois extensions of $k$ of group $H$…

We discuss linearization of skew-periodic loops. We generalize the situation to linearization of non-commutative loops and $\mathbb S^1$-cocycles.

A general explicit upper bound is obtained for the proportion $P(n,m)$ of elements of order dividing $m$, where $n-1 \le m \le cn$ for some constant $c$, in the finite symmetric group $S_n$. This is used to find lower bounds for the…

Kitaev, Potapov, and Vajnovszki [On shortening u-cycles and u-words for permutations, Discrete Appl. Math, 2019] described how to shorten universal words for permutations, to length $n!+n-1-i(n-1)$ for any $i \in [(n-2)!]$, by introducing…

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…

For each $n\ge5$, we give an $S_n$-equivariant basis for $H_4(\overline{\mathcal{M}_{0,n}},\mathbb{Q})$, as well as for $H_{2(n-5)}(\overline{\mathcal{M}_{0,n}},\mathbb{Q})$. Such a basis exists for…

A Universal Cycle for t-multisets of [n]={1,...,n} is a cyclic sequence of $\binom{n+t-1}{t}$ integers from [n] with the property that each t-multiset of [n] appears exactly once consecutively in the sequence. For such a sequence to exist…

We prove bijectively that the total number of cycles of all even permutations of $[n]=\{1,2,...,n\}$ and the total number of cycles of all odd permutations of $[n]$ differ by $(-1)^n(n-2)!$, which was stated as an open problem by Mikl\'{o}s…

We study covering codes of permutations with the $\ell_\infty$-metric. We provide a general code construction, which uses smaller building-block codes. We study cyclic transitive groups as building blocks, determining their exact covering…

Shallow permutations were defined in 1977 to be those that satisfy the lower bound of the Diaconis-Graham inequality. Recently, there has been renewed interest in these permutations. In particular, Berman and Tenner showed they satisfy…

Let $k$ be a nonnegative integer, and let $\alpha$ and $\beta$ be two permutations of $n$ symbols. We say that $\alpha$ and $\beta$ $k$-commute if $H(\alpha\beta, \beta\alpha)=k$, where $H$ denotes the Hamming metric between permutations.…

We solve four similar problems: For every fixed $s$ and large $n$, we describe all values of $n_1,\ldots,n_s$ such that for every $2$-edge-coloring of the complete $s$-partite graph $K_{n_1,\ldots,n_s}$ there exists a monochromatic (i)…

Two new sufficient conditions for generalized cycles (including Hamilton and dominating cycles as special cases) in an arbitrary k-connected graph (k=1,2,...) are derived, which prove the truth of Bondy's (1980) famous conjecture for some…

We shall be interested in the following Erdos-Ko-Rado-type question. Fix some subset B of [n]. How large a family A of subsets of [n] can we find such that the intersection of any two sets in A contains a cyclic translate (modulo n) of B?…

We explore the cycles and convergence of Generalized Collatz Sequence, where $3n+1$ in original collatz function is replaced with $3n+k$. We present a generating function for cycles of GCS and show a particular inheritance structure of…

We are able to rederive in a very simple way the standard generalized Wick's theorem for overlaps of mean field wave functions by using the extension of the statistical Wick's theorem (Gaudin's theorem) in the appropriate limits.

A universal partial cycle (or upcycle) for $\mathcal{A}^n$ is a cyclic sequence that covers each word of length $n$ over the alphabet $\mathcal{A}$ exactly once -- like a De Bruijn cycle, except that we also allow a wildcard symbol…