Related papers: Sieve methods in group theory I: Powers in Linear …

Let $X$ be a set and let $S$ be an inverse semigroup of partial bijections of $X$. Thus, an element of $S$ is a bijection between two subsets of $X$, and the set $S$ is required to be closed under the operations of taking inverses and…

We consider linear groups which do not contain unipotent elements of infinite order, which includes all linear groups in positive characteristic, and show that this class of groups has good properties which resemble those held by groups of…

Symmetry in differential equations reveals invariances and offers a powerful means to reduce model complexity. Lie group analysis characterizes these symmetries through infinitesimal generators, which provide a local, linear criterion for…

We explore the graded and filtered formality properties of finitely generated groups by studying the various Lie algebras over a field of characteristic 0 attached to such groups, including the Malcev Lie algebra, the associated graded Lie…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

Symmetry groups allow to transform solutions of differential equations continuously into other solutions. This property can be used for the observability analysis of infinite-dimensional systems with input and output. In this contribution,…

We say that a finitely generated group $\Gamma$ is self-simulable if every effectively closed action of $\Gamma$ on a closed subset of $\{\texttt{0},\texttt{1}\}^{\mathbb{N}}$ is the topological factor of a $\Gamma$-subshift of finite type.…

Applying E. Kowalski's recent generalization of the large sieve we prove that certain properties expected to be typical (irreducibility of the characteristic polynomial, absence of squares among the matrix coefficients...) are indeed…

We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function…

Given a $\Gamma$-semigroup $S$, we construct a semigroup $\Sigma$ in such a way that one sided ideals and quasi-ideals of $S$ can be regarded as one sided ideals and quasi-ideals respectively of $\Sigma$. This correspondence and other…

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

We survey the recent applications and developments of sieve methods related to discrete groups, especially in the case of infinite index subgroups of arithmetic groups.

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

Suppose that we wish to estimate a finite-dimensional summary of one or more function-valued features of an underlying data-generating mechanism under a nonparametric model. One approach to estimation is by plugging in flexible estimates of…

For $\Gamma$ a Fuchsian Group of the first kind, we obtain large sieve inequalities with weights the hyperbolic periods of Maass forms of even weight. This is inspired by work of Chamizo, who proved a large sieve inequality with weights…

We discuss a partial normalisation of a finite graph of finite groups $(\Gamma(-), X)$ which leaves invariant the fundamental group. In conjunction with an easy graph-theoretic result, this provides a flexible and rather useful tool in the…

We give a new characterisation of virtually free groups using graph minors. Namely, we prove that a finitely generated, infinite group is virtually free if and only if for any finite generating set, the corresponding Cayley graph is minor…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

We prove a new criterion for the solvability of the finite groups, depending on the function $\psi_k(G)$ which is defined as the sum of $k$-th powers of the element orders of $G$. We show that our result can be used to show the solvability…

Given a finitely generated linear group $G$ over $\mathbb{Q}$, we construct a simple group $\Gamma$ that has the same finiteness properties as $G$ and admits $G$ as a quasi-retract. As an application, we construct a simple group of type…