Related papers: R\'edei permutations with the same cycle structure

We examine the non-symmetric Macdonald polynomials $E_\lambda(x;q,t)$ at $q=1$, as well as the more general permuted-basement Macdonald polynomials. When $q=1$, we show that $E_\lambda(x;1,t)$ is symmetric and independent of $t$ whenever…

Transfer systems are combinatorial objects which classify $N_\infty$ operads up to homotopy. By results of A. Blumberg and M. Hill, every transfer system associated to a linear isometries operad is also saturated (closed under a particular…

A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine…

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…

We present an integral formula for the universal R-matrix of quantum affine algebra with 'Drinfeld comultiplication'. We show that the properties of the universal R-matrix follow from the factorization properties of the cycles in proper…

Let $\mathbb{F}_q$ be the finite field of $q$ elements and $a_1,a_2, \ldots, a_k, b\in \mathbb{F}_q$. We investigate $N_{\mathbb{F}_q}(a_1, a_2, \ldots,a_k;b)$, the number of ordered solutions $(x_1, x_2, \ldots,x_k)\in\mathbb{F}_q^k$ of…

We study joint distributions of cycles and patterns in permutations written in standard cycle form. We explore both classical and generalised patterns of length 2 and 3. Many extensions of classical theory are achieved; bivariate generating…

A universal cycle (u-cycle) for permutations of length $n$ is a cyclic word, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that…

In this paper, we first obtain some analogues of a formula of Zagier (1995) and Stanley (2011). For instance, we prove that the number of pairs of $n$-cycles whose product has $k$ cycles and has $m$ given elements contained in distinct…

In this paper, by some arithmetic properties of the Pell sequence and some $p$-adic tools, we study certain cyclotomic matrices involving squares over finite fields. For example, let $1=s_1,s_2,\cdots,s_{(q-1)/2}$ be all the nonzero squares…

We consider permutations of $\{1,...,n\}$ obtained by $\lfloor\sqrt{n}t\rfloor$ independent applications of random stirring. In each step the same marked stirring element is transposed with probability $1/n$ with any one of the $n$…

We use the BLM procedure to eliminate the renormalization scale ambiguity in the evolution equation for the non-singlet deep-inelastic structure function $F_2^{\text NS}(x,Q).$ The scale of the QCD coupling in the $\overline{\text{MS}}$…

In this paper we investigate some new problems in additive combinatorics. Our problems mainly involve permutations (or circular permutations) $n$ distinct numbers (or elements of an additive abelian group) $a_1,\ldots,a_n$ with adjacent…

We present various results on multiplying cycles in the symmetric group. Our first result is a generalisation of the following theorem of Boccara (1980): the number of ways of writing an odd permutation in the symmetric group on $n$ symbols…

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer…

Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $\chi$ be the quadratic character of $\mathbb{F}_q$, and…

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

Consider $m \in \mathbb{N}$ and $\beta \in (1, m + 1]$. Assume that $a\in \mathbb{R}$ can be represented in base $\beta$ using a development in series $a = \sum^{\infty}_{n = 1}x(n)\beta^{-n}$ where the sequence $x = (x(n))_{n \in…

Let G be a finite group of exponent m and let k be a field of characteristic prime to m, containing the m-th roots of unity. For any Rost cycle module M over k, we construct exact sequences detecting the unramified elements in Serre's group…

We study the problem of identifying an n-bit string using a single quantum query to an oracle that computes the Hamming distance between the query and hidden strings. The standard action of the oracle on a response register of dimension r…