Related papers: Dense Random Finitely Generated Subgroups of Lie G…

We provide characterizations of Lie groups as compact-like groups in which all closed zero-dimensional metric (compact) subgroups are discrete. The "compact-like" properties we consider include (local) compactness, (local)…

We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small subsets have many common neighbors. Recently this technique…

Let $G$ be a finite group, define $I(G)=\{x\in G : x^{2}=1\}$, $C(G)=$ set of the cyclic subgroups of $G$, $i(G)=|I(G)|$ and $c(G)=|C(G)|$. In this article, we will classify finite groups with $i(G)=c(G)-r$ for $r=0,1,$ and $2$. We also…

Let $G$ be a group and let $K$ be a commensurated subgroup of $G$. Then there is a totally disconnected, locally compact (t.d.l.c.) group $\hat{G}_K$ that contains the profinite completion of $K$ as an open compact subgroup and also…

Let $X = G/\Gamma$ be a quotient of a real Lie group by a non-uniform lattice. Consider a one-parameter subgroup $F$ of $G$ that is $\operatorname{Ad}$-diagonalizable over $\mathbb{C}$ and whose action on $(X,m_X)$ is mixing. In this…

Let $G$ be a group. A subset $D$ of $G$ is a determining set of $G$, if every automorphism of $G$ is uniquely determined by its action on $D$. The determining number of $G$, denoted by $\alpha(G)$, is the cardinality of a smallest…

Given $p \in (0,1)$, we let $Q_p= Q_p^d$ be the random subgraph of the $d$-dimensional hypercube $Q^d$ where edges are present independently with probability $p$. It is well known that, as $d \rightarrow \infty$, if $p>\frac12$ then with…

We introduce a new class of locally compact groups, namely the strongly compactly covered groups, which are the Hausdorff topological groups $G$ such that every element of $G$ is contained in a compact open normal subgroup of $G$. For…

We examine subgroups of locally compact groups that are continuous homomorphic images of connected Lie groups and we give a criterion for being such an image. We also provide a new characterisation of Lie groups and a characterisation of…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

Given a finite group $G,$ let $e(G)$ be expected number of elements of $G$ which have to be drawn at random, with replacement, before a set of generators is found. If all the Sylow subgroups of $G$ can be generated by $d$ elements, then…

Let $X$ be an affine algebraic variety with a transitive action of the algebraic automorphism group. Suppose that $X$ is equipped with several non-degenerate fixed point free $SL_2$-actions satisfying some mild additional assumption. Then…

Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…

We prove that a finitely generated group $G$ is virtually free if and only if there exists a generating set for $G$ and $k > 0$ such that all $k$-locally geodesic words with respect to that generating set are geodesic.

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…

For a given finitely generated multiplicative subgroup of the rationals which possibly contain negative numbers, we derive, subject to GRH, formulas for the densities of primes for which the index of the reduction group has a given value.…

An $n$-vertex graph $G$ is locally dense if every induced subgraph of size larger than $\zeta n$ has density at least $d > 0$, for some parameters $\zeta, d > 0$. We show that the number of induced subgraphs of $G$ with $m$ vertices and…

We provide a full and rigorous proof of a theorem attributed to \.Zuk, stating that random groups in the Gromov density model for d > 1/3 have property (T) with high probability. The original paper had numerous gaps, in particular, crucial…

If we pick $n$ random points uniformly in $[0,1]^d$ and connect each point to its $k-$nearest neighbors, then it is well known that there exists a giant connected component with high probability. We prove that in $[0,1]^d$ it suffices to…

A group $G$ given by a presentation $G = < \mathcal A \| \mathcal R >$ is called weakly finitely presented if every finitely generated subgroup of $G$, generated by (images of) some words in $\mathcal A^{\pm 1}$, is naturally isomorphic to…