Related papers: The probability that two elements with large $1$-e…
We show that up to commensurability there are only finitely many cocompact arithmetic Kleinian groups generated by rotations. This implies, in particular, that there exist only finitely many conjugacy classes of cocompact two generated…
Let $G$ be a finite $2$-generated non-cyclic group. The spread of $G$ is the largest integer $k$ such that for any nontrivial elements $x_1, \ldots, x_k$, there exists $y \in G$ such that $G = \langle x_i, y\rangle$ for all $i$. The more…
We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…
We produce a probabilistic space from logic, both classical and quantum, which is in addition partially ordered in such a way that entropy is monotone. In particular do we establish the following equation: Quantitative Probability = Logic +…
We shall prove that the celebrated R\'enyi entropy is the first example of a new family of infinitely many multi-parametric entropies. We shall call them the $Z$-entropies. Each of them, under suitable hypotheses, generalizes the celebrated…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific…
The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…
Let $G$ be a simple algebraic group over the algebraic closure of $GF(p)$ ($p$ prime), and let $G(q)$ denote a corresponding finite group of Lie type over $GF(q)$, where $q$ is a power of $p$. Let $X$ be an irreducible subvariety of $G^r$…
We derive some Quantum Central Limit Theorems for expectation values of macroscopically coarse-grained observables, which are functions of coarse-grained hermitean operators. Thanks to the hermicity constraints, we obtain positive-definite…
We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…
Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an $n$ vertex graph, and need to output a clique. We show that if the input graph is drawn at random from $G_{n,\frac{1}{2}}$ (and hence…
We show that for every $N\ge 3$ the free unitary group $U^+_N$ is topologically generated by its classical counterpart $U_N$ and the lower-rank $U^+_{N-1}$. This allows for a uniform inductive proof that a number of finiteness properties,…
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…
Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…
A one-dimensional long-range model of classical rotators with an extended degree of complexity, as compared to paradigmatic long-range systems, is introduced and studied. Working at constant density, in the thermodynamic limit one can prove…
We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it…
In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…