By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

All papers

Claims

Findings

Baumslag-Solitar-free one-relator groups are hyperbolic

Let XX be a finite set and let r∈F(X)r \in F(X). If the one-relator group G=⟨X∣r⟩G = \langle X \mid r \rangle contains no subgroup isomorphic to BS(m,n)\mathrm{BS}(m, n) for any nonzero integers m,nm, n, then GG is word-hyperbolic.

Let Γ\Gamma be a finite connected graph, and let λ:S1→Γ\lambda : S^1 \to \Gamma be a nontrivial immersed circuit representing a non-power in π1Γ\pi_1\Gamma. Attach a 2-cell along λ\lambda, obtaining YY. If π1Y\pi_1Y is Baumslag–Solitar-free, then, for every connected subgraph S⊆ΓS \subseteq \Gamma with λ(S1)⊈S\lambda(S^1) \nsubseteq S, the map π1S→π1Y\pi_1S \to \pi_1Y is injective and its image is quasiconvex.

Let HH be a torsion-free word-hyperbolic group, let A,B≤HA, B \le H be finitely generated free quasiconvex subgroups, and let ϕ:A→B\phi: A \to B be an isomorphism. Set G=⟨H,t∣tat−1=ϕ(a) (a∈A)⟩G = \langle H, t \mid tat^{-1} = \phi(a)\ (a \in A)\rangle, P=AP = A, I=A∩BI = A \cap B, J=t−1It≤PJ = t^{-1}It \le P. Assume that (i) for M,N∈{A,B}M, N \in \{A, B\} and g∈Hg \in H, the intersection M∩gNg−1M \cap gNg^{-1} is at most cyclic unless g∈MNg \in MN, and (ii) the groups I,JI, J are finitely generated and each E∈{I,J}E \in \{I, J\} satisfies ∑SpE∈S\P/Erˉ(E∩p−1Sp)≤rˉ(S)\sum_{SpE \in S\backslash P/E} \bar{r}(E \cap p^{-1}Sp) \le \bar{r}(S) for every finitely generated S≤PS \le P. If GG contains no subgroup isomorphic to BS(m,n)\mathrm{BS}(m, n) for any nonzero integers m,nm, n, then GG is word-hyperbolic.

Let Γ\Gamma be a finite connected graph, and let λ:S1→Γ\lambda: S^1 \to \Gamma be a nontrivial immersed circuit representing a non-power in π1Γ\pi_1\Gamma. If π1(Γ∪λD2)\pi_1(\Gamma \cup_\lambda D^2) is Baumslag–Solitar-free, then it is word-hyperbolic.

Under the hypotheses of Theorem 3.1, if GG is not hyperbolic, there exist currents μs∈Curr(P)\mu_s \in \mathrm{Curr}(P) for s∈Zs \in \mathbb{Z}, signs ϵs∈{+,−}\epsilon_s \in \{+, -\}, and transition types τs\tau_s with signs (ϵs,ϵs+1)(\epsilon_s, \epsilon_{s+1}) such that (i) ∥μ0∥=1\|\mu_0\| = 1, every μs\mu_s is nonzero, and sup⁡s∈Z∥μs∥<∞\sup_{s\in\mathbb{Z}} \|\mu_s\| < \infty; (ii) for every ss there is νs∈Curr(Kτs)\nu_s \in \mathrm{Curr}(K_{\tau_s}) with μs=(θτs,0)∗νs\mu_s = (\theta_{\tau_s,0})_*\nu_s and μs+1=(θτs,1)∗νs\mu_{s+1} = (\theta_{\tau_s,1})_*\nu_s; and (iii) all types are essential.

Under the assumptions of Proposition 4.4, there exist a nonzero current ν\nu on II and a nonzero atomless current μ\mu on PP such that i∗ν=j∗ν=μi_*\nu = j_*\nu = \mu.

The closed support Ω=supp μ⊂∂2P\Omega = \mathrm{supp}\,\mu \subset \partial^2 P contains no periodic line.

Let XX be finite, let r∈F(X)r \in F(X), and suppose that G=F(X)/⟨⟨r⟩⟩G = F(X)/\langle\langle r \rangle\rangle contains no subgroup isomorphic to BS(m,n)\mathrm{BS}(m, n) for any nonzero integers m,nm, n. There are a finite-index subgroup H≤GH \le G, an integer d≥0d \ge 0, an automorphism α\alpha of the rank-dd free group FdF_d, and an embedding H↪Fd⋊αZH \hookrightarrow F_d \rtimes_\alpha \mathbb{Z}. Consequently HH fits into an exact sequence 1→K→H→Q→11 \to K \to H \to Q \to 1 with KK free and Q≤ZQ \le \mathbb{Z}, so GG is virtually free-by-cyclic.

Methods

Capping linear words in an intersection subgroup by a suffix of length at most one to bridge based word length and cyclic counting-current norm when passing to current limits.

Source excerpts

“Lemma 3.9 (Capping linear words). Fix an injection θ : Q → F of nontrivial finite-rank free groups with fixed bases. For each nonempty reduced word W in Q, there is a suffix b of length at most one such that W b is cyclically reduced.” · Show in paper

Suppressing degree-two vertices in finite core graphs of window stabilizers to obtain a bounded-complexity natural graph and extracting a fixed small subgraph Γsm\Gamma^{\mathrm{sm}} from edges with bounded labels.

Source excerpts

“Definition 5.2. Pass to a subsequence n → ∞ on which the natural graph of Γn has a fixed abstract type, and identify those natural graphs with one fixed finite graph. Pass to a further subsequence on which each natural edge has either a fixed label or length tending to infinity. For every edge of the latter kind, arrange convergence of all finite prefixes of its label in both orientations. The small graph Γ sm consists of the natural vertices and the natural edges with fixed labels, subdivided according to those labels.” · Show in paper

Approximating an arbitrary free-group current by finite nonnegative linear combinations of counting currents via directed cycle decompositions of circulations on length-kk word graphs.

Source excerpts

“The masses ⟨u, σ⟩ of directed segment cylinders based at the identity and labeled by length-k words u form a nonnegative circulation: both incoming and outgoing sums at a vertex equal its length-(k − 1) cylinder mass. Any such circulation is a finite nonnegative sum of directed cycle circulations.” · Show in paper

Constructing a finite domain in a connected cyclic cover of a finite graph with a nonempty tree overlap, and enlarging or modifying it to realize a non-power graph presentation as an HNN extension of strictly smaller lexicographic complexity.

Source excerpts

“Lemma 8.2. Every connected cyclic cover of a finite connected graph has a domain D for which D ∩ τD is a nonempty tree.” · Show in paper

“Lemma 8.3. Suppose rank π1Γ ≥ 2 and that λ represents a non-power in π1Γ. There are a domain U ⊂ Γe and a closed lift eλ: S 1 → U with the following properties.” · Show in paper