Related papers: Four heads are better than three

We prove a conjecture dating back to a 1978 paper of D.R.\ Musser~\cite{musserirred}, namely that four random permutations in the symmetric group $\mathcal{S}_n$ generate a transitive subgroup with probability $p_n > \epsilon$ for some…

In 1983 Silverman and Tate showed that the set of points in a 1-dimensional family of abelian varieties where a section of infinite order has `small height' is finite. We conjecture a generalisation to higher-dimensional families, where we…

We study a generalized version of reversal bounded Turing machines where, apart from several tapes on which the number of head reversals is bounded by r(n), there are several further tapes on which head reversals remain unrestricted, but…

Existentially closed groups are, informally, groups that contain solutions to every consistent finite system of equations and inequations. They were introduced in 1951 in an algebraic context and subsequent research elucidated deep…

A new characterization of rational torsion subgroups of elliptic curves is found, for points of order greater than 4, through the existence of solution for systems of Thue equations.

Let E be an elliptic curve defined over Q and let G = E(Q)_tors be the associated torsion subgroup. We study, for a given G, which possible groups G <= H could appear such that H=E(K)_tors, for [K:Q]=4 and H is one of the possible torsion…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

Elementary abelian groups are finite groups in the form of $A=(\mathbb{Z}/p\mathbb{Z})^r$ for a prime number $p$. For every integer $\ell>1$ and $r>1$, we prove a non-trivial upper bound on the $\ell$-torsion in class groups of every…

Groups of finite type (also called finitely constrained groups), introduced by Grigorchuk, are known to be the closure of regular branch groups. This article explores many of their properties. Firstly, we prove that being finitely…

In the monograph arXiv:2108.03453, we define the notion of a unipotent representation of a complex reductive group. The representations we define include, as a proper subset, all special unipotent representations in the sense of…

In physical systems possessing symmetry, reconstructing the underlying causal structure from observational data constitutes an inverse problem of fundamental importance. In this work, we formulate the inverse problem of causal inference…

We study the inverse problem of inferring the state of a finite-level quantum system from expected values of a fixed set of observables, by maximizing a continuous ranking function. We have proved earlier that the maximum-entropy inference…

The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…

In this paper we investigate the computational power of a set of mobile robots with limited visibility. At each iteration, a robot takes a snapshot of its surroundings, uses the snapshot to compute a destination point, and it moves toward…

In an election where $n$ voters rank $m$ candidates, a Condorcet winning set is a committee of $k$ candidates such that for any outside candidate, a majority of voters prefer some committee member. Condorcet's paradox shows that some…

Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…

We show that every Grigorchuk group $G_\omega$ embeds in (the commutator subgroup of) the topological full group of a minimal subshift. In particular, the topological full group of a Cantor minimal system can have subgroups of intermediate…

A classical theorem on character degrees states that if a finite group has fewer than four character degrees, then the group is solvable. We prove a corresponding result on character values by showing that if a finite group has fewer than…

An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to…

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…