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

An infinite finitely presented simple amenable group

There exists an infinite finitely presented simple amenable group.

For every positive integer mm, the group AmA_m is infinite, perfect, and simple, and [Fm,Fm]=Am[F_m, F_m] = A_m.

For every positive integer mm, the discrete group FmF_m is amenable, and every subgroup of FmF_m, in particular AmA_m, satisfies the finite-set Følner condition.

There is an integer mhomm_{\mathrm{hom}} such that H2(Am;Z)H_2(A_m; \mathbb{Z}) is finitely generated for every finite m≥mhomm \ge m_{\mathrm{hom}}.

There is one finite choice of true initial relations in G^\widehat{G}, for sufficiently large fixed finite mm, such that every finite family of aligned polygon tests has its actual central law, simultaneously on subalphabets, with canonical representations compatible with alphabet restriction, disjoint polygon refinements, and common translations on proper supports.

For all sufficiently large fixed finite mm, there is a finitely presented group G^\widehat{G} and a surjective homomorphism π:G^→Am\pi: \widehat{G} \to A_m whose kernel is central.

If GG is a group with finitely generated H2(G;Z)H_2(G; \mathbb{Z}) and there is a central extension 1→K→E→G→11 \to K \to E \to G \to 1 with EE finitely presented, then GG is finitely presented.

Methods

Constructing a Boolean polygon algebra on a unit square with opposite sides identified using four linear forms ℓ1(x,y)=x\ell_1(x,y)=x, ℓ2(x,y)=y\ell_2(x,y)=y, ℓ3(x,y)=y−λx\ell_3(x,y)=y-\lambda x, and ℓ4(x,y)=x−λy\ell_4(x,y)=x-\lambda y at levels in O=Z[τ]\mathcal{O}=\mathbb{Z}[\tau] (where τ=(1+5)/2\tau=(1+\sqrt{5})/2 and λ=τa\lambda=\tau^a), realizing it as the clopen algebra of a Stone space XX, and forming the alternating subgroup Am≤FmA_m \le F_m generated by even permutations of disjoint translated polygonal pieces on mm tracks.

Source excerpts

“Our four linear forms are ℓ1(x, y) = x, ℓ2(x, y) = y, ℓ3(x, y) = y − λx, ℓ4(x, y) = x − λy. An allowable line is ℓ−1i(t) with t ∈ O.” · Show in paper

“Define Fm to consist of all bijections of mX that have a finite clopen partition on whose pieces they take the form (i, x) 7−→ (j, x + γ), γ ∈ Γ.” · Show in paper

Generating almost-invariant random finite polygonal partitions by thresholding correlated random fields YN=μN+(I+BN)ξY_N = \mu_N + (I + B_N)\xi built from positive semidefinite averaging matrices BNB_N and independent centered noise ξ\xi, then uniformly matching equal-shape cells to lift partition couplings to almost-invariant probability measures on FmF_m.

Source excerpts

“Define YN = µN + (I + BN )ξ, bN (z) = 1{YN (z)>0}.” · Show in paper

“Given a sampled partition P, choose uniformly a shape-preserving bijection from its baseline partition onto P. On each baseline cell use the unique translating identification to the assigned cell.” · Show in paper

Proving finite generation of H2(Am;Z)H_2(A_m; \mathbb{Z}) by establishing homological stability for FmF_m via an ordered-embedding complex Em\mathcal{E}_m, applying three bar constructions and group completion to a symmetric monoidal groupoid B\mathcal{B} of Boolean polygons, and resolving B\mathcal{B} into translation homology of polygonal step functions controlled by a finitely generated corner-symbol module.

Source excerpts

“Let Em be the semisimplicial set whose p-simplices are ordered tuples (e0, . . . , ep) of embeddings with pairwise disjoint images.” · Show in paper

“For f ∈ L, record its sector germ modulo this subgroup at every z. The result is a translation-equivariant map c : L −→ Lz∈V Qz.” · Show in paper

Constructing a finitely presented central cover G^↠Am\widehat{G} \twoheadrightarrow A_m using a lifting calculus of conditional permutations with canonical perfect central extensions Alt(I)∗→Alt(I)\mathrm{Alt}(I)^* \to \mathrm{Alt}(I), small-support presentations, rectangular and sloping law propagation, and private-track routing of five-slot configurations.

Source excerpts

“If L is their maximum length, one possible single presentation is Gb = ⟨Sm | RL⟩, RL = {w : |w| ≤ L, w = 1 in Am}.” · Show in paper

“An admissible routing of S is an aligned word r on an alphabet of at most 25 tracks containing all source and terminal track labels, whose projected action sends its five slots parameterwise to a tuple T on distinct tracks.” · Show in paper