Related papers: On the First-Order Free Group Factor Alternative
Our result contains as special cases the Frobenius theorem (1895) on the~number of solutions to the equation $x^n=1$ in a finite group and the Solomon theorem (1969) on the number of solutions in a group to systems of equations with fewer…
Let $A$ be an infinitely generated free abelian group. We prove that the automorphism group $\aut A$ first-order interprets the full second-order theory of the set $|A|$ with no structure. In particular, this implies that the automorphism…
Every word in a free group $F$ induces a probability measure on every finite group in a natural manner. It is an open problem whether two words that induce the same measure on every finite group, necessarily belong to the same orbit of…
Let $F_k$ be the free group on $k$ generators, and let $H\le J\le \F_k$ be subgroups of finite rank. We present a new elementary algorithm to determine whether $H$ is a free factor of $J$. In particular, this algorithm can determine whether…
This is the second in a series of four papers (with research announcement posted on this arXiv) that together develop a decomposition theory for subgroups of Out(F_n). In this paper we relativize the "Kolchin-type theorem" from the work of…
Recently, in Axioms 10(2): 119 (2021), a nonclassical first-order theory T of sets and functions has been introduced as the collection of axioms we have to accept if we want a foundational theory for (all of) mathematics that is not weaker…
From the analogue of Boehm's Theorem proved for the typed lambda calculus, without product types and with them, it is inferred that every cartesian closed category that satisfies an equality between arrows not satisfied in free cartesian…
We construct entropy increasing monotone factors in the context of a Bernoulli shift over the free group of rank at least two.
In this paper we show various new structural properties of free group factors using the recent resolution (due independently to Belinschi-Capitaine and Bordenave-Collins) of the Peterson-Thom conjecture. These results include the resolution…
This paper investigates the asymptotic behaviour of the minimal number of generators of finite index subgroups in residually finite groups. We analyze three natural classes of groups: amenable groups, groups possessing an infinite soluble…
Let $G$ be the group of automorphisms of a free group $F_\infty$ of infinite order. Let $H$ be the stabilizer of first $m$ generators of $F_\infty$. We show that the double cosets of $\Gamma$ with respect to $H$ admit a natural semigroup…
A celebrated argument of F. Hartogs (1915) deduces the Axiom of Choice from the hypothesis of comparability for any pair of cardinals. We show how each of a sequence of seemingly much weaker hypotheses suffices. Fixing a finite number…
The Johnson filtration of the automorphism group of a free group is composed of those automorphisms which act trivially on nilpotent quotients of the free group. We compute cohomology classes as follows: (i) we analyze analogous classes for…
We provide an elementary proof that subgroups of free groups are free via group actions.
We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…
We develop and compare two algorithms for computing first-order right-hand factors in the ring of linear Mahler operators$\ell_r M^r + \dots + \ell_1 M + \ell_0$where $\ell_0, \dots, \ell_r$ are polynomials in~$x$ and $Mx = x^b M$ for some…
We generalize first-species counterpoint theory to arbitrary rings and obtain some new counting and maximization results that enrich the theory of admitted successors, pointing to a structural approach, beyond computations. The…
We prove a Kurosh type theorem for free-product type II_1 factors. In particular, if M = LF_2 \otimes R, then the free-product type II_1 factors M*...*M are all prime and pairwise non-isomorphic. This paper is a continuation of [N. Ozawa,…
We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).
Given two languages, a separator is a third language that contains the first one and is disjoint from the second one. We investigate the following decision problem: given two regular input languages of finite words, decide whether there…