Related papers: Approximate subgroups of linear groups

The goal of this paper is to construct and describe certain arithmetic subgroups of the automorphism group of a partially commutative group. More precisely, given an arbitrary finite graph $\Gamma$ we construct an arithmetic subgroup…

Let $H$ and $G$ be graphs such that $H$ has at least 3 vertices and is connected. The $H$-line graph of $G$, denoted by $HL(G)$, is that graph whose vertices are the edges of $G$ and where two vertices of $HL(G)$ are adjacent if they are…

The spectrum of a finite group is the set of orders of its elements. We are concerned with finite groups having the same spectrum as a direct product of nonabelian simple groups with abelian Sylow $2$-subgroups. For every positive integer…

We classify all triples $(G,V,H)$ such that $SL_n(q)\leq G\leq GL_n(q)$, $V$ is a representation of $G$ of dimension greater than one over an algebraically closed field $\FF$ of characteristic coprime to $q$, and $H$ is a proper subgroup of…

We prove the conjugacy of Sylow $p$-subgroups of linear pseudofinite groups under the assumption of the existence of a finite Sylow $p$-subgroup. We also give an example of a linear pseudofinite group with non-conjugate Sylow $2$-subgroups.

We examine the relationship between finitely and infinitely generated relatively hyperbolic groups, in two different contexts. First, we elaborate on a remark from math.GR/0601311, which states that the version of Dehn filling in relatively…

This work provides closed-form solutions and minimum achievable errors for a large class of low-rank approximation problems in Hilbert spaces. The proposed theorem generalizes to the case of bounded linear operators the previous results…

Let I be a countably infinite set, S = Sym(I) the group of permutations of I, and E = End(I) the monoid of self-maps of I. Given two subgroups G, G' of S, let us write G \approx_S G' if there exists a finite subset U of S such that the…

We introduce and systematically study linear sofic groups and linear sofic algebras. This generalizes amenable and LEF groups and algebras. We prove that a group is linear sofic if and only if its group algebra is linear sofic. We show that…

We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…

In the hyperalgebra of the $r$-th Frobenius kernel of a universal Chevalley group over a field of characteristic $p>0$, we study some subsets and the subalgebras generated by them and give some results. We are particularly interested in the…

Let $G$ be a connected linear algebraic group over a number field $K$, let $\Gamma$ be a finitely generated Zariski dense subgroup of $G(K)$ and let $Z\subseteq G(K)$ be a thin set, in the sense of Serre. We prove that, if…

It is a theorem of Artin, Tits et al. that a finite simple group is determined by its order, with the exception of the groups (A_3(2), A_2(4)) and (B_n(q), C_n(q)) for n > 2, q odd. We investigate the situation for finite semisimple groups…

This paper gathers four lectures, based on a mini-course at IMA in 2014, whose aim was to discuss the structure of approximate subgroups of an arbitrary group, following the works of Hrushovski and of Green, Tao and the author. Along the…

In this paper we give an alternative proof of Schreiber's theorem which says that an infinite discrete approximate subgroup in $\mathbb{R}^d$ is relatively dense around a subspace. We also deduce from Schreiber's theorem two new results.…

We provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, effectively showing how every hyperlinear approximation to such a group is simulated by a suitable sofic approximation. The…

We prove that any quasirandom uniform hypergraph $H$ can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our results also apply to multipartite hypergraphs and even to the…

We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…

Let $G$ be a finite almost simple group and let $H$ be a Sylow $p$-subgroup of $G$. As a special case of a theorem of Zenkov, there exist $x,y \in G$ such that $H \cap H^x \cap H^y = 1$. In fact, if $G$ is simple, then a theorem of Mazurov…

Following Isaacs (see [Isa08, p. 94]), we call a normal subgroup N of a finite group G large, if $C_G(N) \leq N$, so that N has bounded index in G. Our principal aim here is to establish some general results for systematically producing…