Related papers: On the First-Order Free Group Factor Alternative

We provide an algorithm that, given a finite set of generators for a subgroup $H$ of a finitely generated free group $F$, determines whether $H$ is echelon or not and, in case of affirmative answer, also computes a basis with respect to…

Given a countable group $G$ splitting as a free product $G=G_1\ast\dots\ast G_k\ast F_N$, we establish classification results for subgroups of the group $Out(G,\mathcal{F})$ of all outer automorphisms of $G$ that preserve the conjugacy…

We investigate two open questions in a cohomology theory relative to the family of finite subgroups. The problem of whether the F-cohomological dimension is subadditive is reduced to extensions by groups of prime order. We show that every…

Let $\Free_n$ denote the free group with $n$ generators $g_1, g_2, ..., g_n$. Let $\lambda$ stand for the left regular representation of $\Free_n$ and let $\tau$ be the standard trace associated to $\lambda$. Given any positive integer $d$,…

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

The Friedman--Mineyev theorem, earlier known as the (strengthened) Hanna Neumann conjecture, gives a sharp estimate for the rank of the intersection of two subgroups in a free group. We obtain an analogue of this inequality for any two…

The aim of this expository article is to present recent developments in the centuries old discussion on the interrelations between continuous and differentiable real valued functions of one real variable. The truly new results include,…

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Given a type A in homotopy type theory (HoTT), we can define the free infinity-group on A as the loop space of the suspension of A+1. Equivalently, this free higher group can be defined as a higher inductive type F(A) with constructors unit…

Can one detect free products of groups via their profinite completions? We answer positively among virtually free groups. More precisely, we prove that a subgroup of a finitely generated virtually free group $G$ is a free factor if and only…

We study classes of countable graphs where every member does not contain a given finite graph as an induced subgraph -- denoted by $\mathsf{Free}(\mathcal{G})$ for a given finite graph $\mathcal{G}$. Our main results establish a structural…

Over the last century, the principle of "induction on the continuum" has been studied by different authors in different formats. All of these different readings are equivalent to one of the three versions that we isolate in this paper. We…

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

We prove that for any free ergodic probability measure preserving action \F_n \actson (X,\mu) of a free group on n generators \F_n, 2 \leq n \leq \infty, the associated group measure space II_1 factor $L^\infty(X) \rtimes \F_n$ has…

Let $D_n(x;a)$ and $E_n(x;a)\in\mathbb F_q[x]$ be Dickson polynomials of first and second kind respectively, where $\mathbb F_q$ is a finite field with $q$ elements. In this article we show explicitly the irreducible factors these…

We examine the Johnson filtration of the (outer) automorphism group of a finitely generated group. In the case of a free group, we find a surprising result: the first Betti number of the second subgroup in the Johnson filtration is finite.…

This paper corrects an error in a proof in the original version of the paper published in 1998 in the Oxford Quarterly. The main theorem remains the same: The geometric realization of the partially ordered set of proper free factors in a…

First-order logic is the basis for many knowledge representation formalisms and methods. Providing technological support for learning to write first-order formulas for natural language specifications requires methods to test formulas for…

In this work we continue the syntactic study of completeness that began with the works of Immerman and Medina. In particular, we take a conjecture raised by Medina in his dissertation that says if a conjunction of a second-order and a…

Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO + LFP) formula is equivalent to a first-order formula in K. Here (FO + LFP) is the extension of first-order logic with…