相关论文: Virtual Geometricity is Rare

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…

Let G be the fundamental group of a connected, closed, orientable 3-manifold. We explicitly compute its virtually cyclic geometric dimension. Among the tools we use are the prime and JSJ decompositions of M, several push-out type…

We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…

The virtual singular braid group arises as a natural common generalization of classical singular braid groups and virtual braid groups. In this paper, we study several algebraic properties of the virtual singular braid group $VSG_n$. We…

We study random words in a weighted regular language that achieve the maximal free energy using thermodynamics formalism. In particular, typical words in the language are algorithmically generated which have applications in computer…

The objective of this paper is to further study the anabelian object referred to as \emph{pointed virtual curves}. Building upon previous work that investigated these fundamental-group-theoretic pullbacks of Galois sections in the…

We give a geometric proof of a well known theorem that describes splittings of a free group as an amalgamated product or HNN extension over the integers. The argument generalizes to give a similar description of splittings of a virtually…

Consider a random multigraph with given vertex degrees constructed by the configuration model. We give a new proof of the fact that, asymptotically for a sequence of such multigraphs with the number of edges tending to infinity, the…

We obtain a criterion for quasiconvexity of a subgroup of an amalgamated free product of two word hyperbolic groups along a virtually cyclic subgroup. The result provides a method of constructing new word hyperbolic group in class (Q), that…

We study biinvariant word metrics on groups. We provide an efficient algorithm for computing the biinvariant word norm on a finitely generated free group and we construct an isometric embedding of a locally compact tree into the biinvariant…

Consider a random multigraph G* with given vertex degrees d_1,...,d_n, contructed by the configuration model. We show that, asymptotically for a sequence of such multigraphs with the number of edges (d_1+...+d_n)/2 tending to infinity, the…

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to infinity. Whereas random groups are quotients…

Let $\Sigma$ be a compact orientable surface of finite type with at least one boundary component. Let $\Gamma \leq \textup{Mod}(\Sigma)$ be a non virtually solvable subgroup. We answer a question of Lubotzky by showing that there exists a…

In this work, we explore the following question: If two words in a finitely generated free group have identical images as word maps on every finite group, must they be endomorphic to each other? In this regard, we introduce weak profinite…

A theorem of Myasnikov and Roman'kov says that any verbally closed subgroup of a finitely generated free group is a retract. We prove that all free (and many virtually free) verbally closed subgroups are retracts in any finitely generated…

We study universality of geometric gauge sectors in the string landscape in the context of F-theory compactifications. A finite time construction algorithm is presented for $\frac43 \times 2.96 \times 10^{755}$ F-theory geometries that are…

Let $G$ be a virtually compact special Gromov-hyperbolic group. We prove that the double $G *_H G$ along a quasiconvex subgroup $H$ is virtually compact special. More generally, we show that if a finite graph of groups has constant vertex…

In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

We give another proof for a result of Brick stating that the simple connectivity at infinity is a geometric property of finitely presented groups. This allows us to define the rate of vanishing of $\p1i$ for those groups which are simply…