Related papers: s-Overlap Cycles for Permutations
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…
A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridge's formula by using cycle…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
A general result on the explicit form of the general error locator polynomial for all cyclic codes is given, along with several results for infinite classes of cyclic codes with $t=2$ and $t=3$. From these, a theoretically justification of…
The orbit problem is at the heart of symmetry reduction methods for model checking concurrent systems. It asks whether two given configurations in a concurrent system (represented as finite strings over some finite alphabet) are in the same…
Can a list of binary strings be ordered so that consecutive strings differ in a single bit? Can a list of permutations be ordered so that consecutive permutations differ by a swap? Can a list of non-crossing set partitions be ordered so…
Given a field $k$ and a finite group $G$, the Beckmann--Black problem asks whether every Galois field extension $F/k$ with group $G$ is the specialization at some $t_0 \in k$ of some Galois field extension $E/k(T)$ with group $G$ and $E…
In this note, the Sherrington Kirkpatrick model of interacting spins is under consideration. In the high temperature region, we give an asymptotic expansion for the expected value of some genereral polynomial of the overlap of the system…
We investigate circular planar nearrings constructed from finite fields as well the complex number field using a multiplicative subgroup of order $k$, and characterize the overlaps of the basic graphs which arise in the associated…
We analyze the dynamics of a class of $\mathbb{Z}_{2n}$-equivariant differential equations on the plane, depending on 4 real parameters. This study is the generalisation to $\mathbb{Z}_{2n}$ of previous works with $\mathbb{Z}_4$ and…
Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…
The second author had previously obtained explicit generating functions for moments of characteristic polynomials of permutation matrices (n points). In this paper, we generalize many aspects of this situation. We introduce random shifts of…
For $0\leq \ell <k$, a Hamiltonian $\ell$-cycle in a $k$-uniform hypergraph $H$ is a cyclic ordering of the vertices of $H$ in which the edges are segments of length $k$ and every two consecutive edges overlap in exactly $\ell$ vertices. We…
We show that the minimum number of orientations of the edges of the n-vertex complete graph having the property that every triangle is made cyclic in at least one of them is $\lceil\log_2(n-1)\rceil$. More generally, we also determine the…
The permutation group $S_N$ has a quantum analogue $S_N^+$, which is infinite at $N\geq4$. We review the known facts regarding $S_N^+$, and notably its easiness property, Weingarten calculus, and the isomorphism $S_4^+=SO_3^{-1}$ and its…
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the…
A de Bruijn array code is a set of $r \times s$ binary doubly-periodic arrays such that each binary $n \times m$ matrix is contained exactly once as a window in one of the arrays. Such a set of arrays can be viewed as a two-dimensional…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…
In this paper we introduce a multiparameter version of the quantum universal enveloping superalgebras introduced by Yamane in [H. Yamane, "Quantized enveloping algebras associated to simple Lie superalgebras and their universal…
Let ${\mathcal W}_n$ denote any of the three families of classical Weyl groups: the symmetric groups ${\mathcal S}_n$, the hyperoctahedral groups (signed permutation groups) ${\mathcal S}^B_n$, or the even-signed permutation groups…