Related papers: On the Subgroup Distance Problem in Cyclic Permuta…

We give an overview of various results and methods related to information-theoretic distances of R\'enyi type in the light of their applications to the central limit theorem (CLT). The first part (Sections 1-9) is devoted to the total…

This is the fourth paper in a series. We prove a conjecture made independently by Boston et al and Shalev. The conjecture asserts that there is an absolute positive constant delta such that if G is a finite simple group acting transitively…

We consider a random walk $(Y_N)_{N\geq 0}$ on $\mathbb{R}^2$ generated by successively applying independent random isometries, drawn from a fixed measure $\mu$, to the point $0$. When the support of $\mu$ is finite and includes an…

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a…

This paper proves the NP-completeness of the reachability problem for the class of flat counter machines with difference bounds and, more generally, octagonal relations, labeling the transitions on the loops. The proof is based on the fact…

The Transposition Distance Problem (TDP) is a classical problem in genome rearrangements which seeks to determine the minimum number of transpositions needed to transform a linear chromosome into another represented by the permutations…

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…

Binary cyclic codes having large dimensions and minimum distances close to the square-root bound are highly valuable in applications where high-rate transmission and robust error correction are both essential. They provide an optimal…

Under certain general conditions, we prove that the stable central limit theorem holds in the total variation distance and get its optimal convergence rate for all $\alpha \in (0,2)$. Our method is by two measure decompositions, one step…

This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…

This paper studies the problem of testing if an input (Gamma,*), where Gamma is a finite set of unknown size and * is a binary operation over Gamma given as an oracle, is close to a specified class of groups. Friedl et al. [Efficient…

The asymptotic rate vs. distance problem is a long-standing fundamental problem in coding theory. The best upper bound to date was given in 1977 and has received since then numerous proofs and interpretations. Here we provide a new,…

In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\alpha}$ then some…

Given a finite group $G$ and a set $A$ of generators, the diameter diam$(\Gamma(G,A))$ of the Cayley graph $\Gamma(G,A)$ is the smallest $\ell$ such that every element of $G$ can be expressed as a word of length at most $\ell$ in $A \cup…

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…

We establish that the set of pairs $(\alpha, \beta)$ of real numbers such that $$ \liminf_{q \to + \infty} q \cdot (\log q)^2 \cdot \Vert q \alpha \Vert \cdot \Vert q \beta \Vert > 0, $$ where $\Vert \cdot \Vert$ denotes the distance to the…

Let $\alpha$ and $\beta$ be uniformly random permutations of orders $2$ and $3$, respectively, in $S_{N}$, and consider, say, the permutation $\alpha\beta\alpha\beta^{-1}$. How many fixed points does this random permutation have on average?…

A skew morphism of a finite group $B$ is a permutation $\varphi$ of $B$ that preserves the identity element of $B$ and has the property that for every $a\in B$ there exists a positive integer $i_a$ such that $\varphi(ab) =…

We consider the general supersymmetric one-dimensional quantum system with boundary, critical in the bulk but not at the boundary. The renormalization group flow on the space of boundary conditions is generated by the boundary beta…