中文
相关论文

相关论文: Dense Random Finitely Generated Subgroups of Lie G…

200 篇论文

A finitely generated subgroup {\Gamma} of a real Lie group G is said to be Diophantine if there is \beta > 0 such that non-trivial elements in the word ball B_\Gamma(n) centered at the identity never approach the identity of G closer than…

We introduce a wide class of countable groups, called properly proximal, which contains all non-amenable bi-exact groups, all non-elementary convergence groups, and all lattices in non-compact semi-simple Lie groups, but excludes all inner…

算子代数 · 数学 2018-11-15 Rémi Boutonnet , Adrian Ioana , Jesse Peterson

The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…

群论 · 数学 2007-05-23 Yi Ming Zou

A graph G is well-covered if all its maximal independent sets are of the same cardinality. Assume that a weight function w is defined on its vertices. Then G is w-well-covered if all maximal independent sets are of the same weight. For…

离散数学 · 计算机科学 2016-11-22 Vadim E. Levit , David Tankus

The $k$-gonal models of random groups are defined as the quotients of free groups on $n$ generators by cyclically reduced words of length $k$. As $k$ tends to infinity, this model approaches the Gromov density model. In this paper we show…

群论 · 数学 2021-04-14 MurphyKate Montee

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

群论 · 数学 2022-07-08 Ashot Minasyan

Let $G$ be a connected Lie group. An unrefinable chain of $G$ is a chain of subgroups $G = G_0 > G_1 > \cdots > G_t = 1$, where each $G_i$ is a maximal connected subgroup of $G_{i-1}$. In this paper, we introduce the notion of the length…

群论 · 数学 2019-04-12 Timothy C. Burness , Martin W. Liebeck , Aner Shalev

Let L be a Lie group and Lambda a lattice in L. Suppose G is a non-compact simple Lie group realized as a Lie subgroup of L, and the image of G on L/Lambda is dense. Let c be a diagonalizable element of G not contained in a compact…

表示论 · 数学 2007-05-23 Nimish A. Shah

We give an alternative proof to the theorem recently proved by Louvaris, Wise and Yehuda, that the growth rates of finitely generated subgroups of $F_r$ are dense in $[1,2r-1]$.

群论 · 数学 2026-01-21 Ádám Timár

Gowers has elegantly characterized the finite groups $G$ in which $A_1A_2A_3 = G$ for any positive density subsets $A_1,A_2,A_3$. This property, quasi-randomness, holds if and only if G does not admit a nontrivial irreducible representation…

群论 · 数学 2021-03-23 Mark Sellke

Let M be a real analytic manifold modeled on a locally convex space and K be a non-empty compact subset of M. We show that if an open neighborhood of K in M admits a complexification which is a regular topological space, then the germ of…

微分几何 · 数学 2016-01-07 Rafael Dahmen , Helge Glockner , Alexander Schmeding

Assume that $\mathcal{P}$ is a topological property of a space $X$, then we say that $X$ is {\it dense-$\mathcal{P}$} if each dense subset of $X$ has the property $\mathcal{P}$. In this paper, we mainly discuss dense subsets of a space $X$,…

一般拓扑 · 数学 2023-04-10 Fucai Lin , Qiyun Wu

Let $G$ be a regular graph and $H$ a subgraph on the same vertex set. We give surprisingly compact formulas for the number of copies of $H$ one expects to find in a random subgraph of $G$.

组合数学 · 数学 2025-06-26 Aaron Abrams , Rod Canfield , Andrew Granville

There are strong analogies between groups definable in o-minimal structures and real Lie groups. Nevertheless, unlike the real case, not every definable group has maximal definably compact subgroups. We study definable groups G which are…

逻辑 · 数学 2009-12-25 Annalisa Conversano

Given a finite group $G$, we denote by $\nu(G)$ the probability that two randomly chosen elements of $G$ generate a nilpotent subgroup. We prove that if $\nu(G)>1/12,$ then $G$ is solvable.

群论 · 数学 2026-04-07 Andrea Lucchini

We study fibers of word maps in finite, profinite, and residually finite groups. Our main result is that, for any word w in the free group on d generators, there exists $\epsilon > 0$ such that if G is a residually finite group with…

群论 · 数学 2017-06-27 Michael Larsen , Aner Shalev

We address two questions of Simon Thomas. First, we show that for any n>2 one can find a four generated free subgroup of SLn(Z) which is profinitely dense. More generally, we show that an arithmetic group \Gamma which admits the congruence…

群论 · 数学 2012-05-08 Menny Aka , Tsachik Gelander , Gregory A. Soifer

The probability that a randomly chosen element of a finite group is an $r$--th root (for any integer $r\geq2$) has been studied largely in case $r=2$. Certain techniques may be generalized for $r>2$ and here we find the exact value of this…

We prove that any Lie subgroup $G$ (with finitely many connected components) of an infinite-dimensional topological group $\mathcal G$ which is an amalgamated product of two closed subgroups, can be conjugated to one factor. We apply this…

复变函数 · 数学 2022-02-01 Frank Kutzschebauch , Andreas Lind

A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…

组合数学 · 数学 2019-09-18 Yilun Shang