Related papers: Automorphic word maps and Amit--Ashurst conjecture
The circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups is studied. The best upper bound for this problem is $\mathsf{coRP}$, which is shown by a reduction to polynomial identity…
The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations…
The target of this article is to discuss the concept of \textit{commuting probability} of finite groups which, in short, is a probabilistic measure of how abelian our group is. We shall compute the value of commuting probability for many…
We combine two of Igusa's conjectures with recent semi-continuity results by Musta\c{t}\u{a} and Popa to form a new, natural conjecture about bounds for exponential sums. These bounds have a deceivingly simple and general formulation in…
We show that the compressed word problem in a finitely-generated fully residually free group (F -group) is decidable in polynomial time, and use the result to show that the word problem in the automorphism group of such a group is decidable…
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…
A celebrated result of J. Thompson says that if a finite group $G$ has a fixed-point-free automorphism of prime order, then $G$ is nilpotent. The main purpose of this note is to extend this result to finite inverse semigroups. An earlier…
We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…
In many applications of natural language processing (NLP) it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine which of the two word combinations ``eat a peach'' and…
We provide finite-sample distribution approximations, that are uniform in the parameter, for inference in linear mixed models. Focus is on variances and covariances of random effects in cases where existing theory fails because their…
We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of…
In the present note we prove a conjecture of Demailly for finite sets of sufficiently many very general points in projective spaces. This gives a lower bound on Waldschmidt constants of such sets. Waldschmidt constants are asymptotic…
Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertainty set or are governed by any probability distribution from…
We show that, for any (symmetric) finite generating set of the Torelli group of a closed surface, the probability that a random word is not pseudo-Anosov decays exponentially in terms of the length of the word.
We develop new computational methods for studying potential counterexamples to the Andrews-Curtis conjecture, in particular, Akbulut-Kurby examples AK(n). We devise a number of algorithms in an attempt to disprove the most interesting…
We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…
Group-invariant probability distributions appear in many data-generative models in machine learning, such as graphs, point clouds, and images. In practice, one often needs to estimate divergences between such distributions. In this work, we…
Ramsey theory for words over a finite alphabet was unified in the work of Carlson and Furstenberg-Katznelson. Carlson, in the same work, outlined a method to extend the theory for words over an infinite alphabet, but subject to a fixed…
We prove many new cases of Zimmer's conjecture for actions by lattices in non-$\mathbb{R}$-split semisimple Lie groups $G$. By prior arguments, Zimmer's conjecture reduces to studying certain probability measures invariant under a minimal…
We give conceptual proofs of some results on the automorphism group of an Enriques surface X, for which only computational proofs have been available. Namely, there is an obvious upper bound on the image of Aut(X) in the isometry group of…