Related papers: Is being a higher rank lattice a first order prope…

Let $F= < a,b>$ be a rank two free group. A word $W(a,b)$ in $F$ is {\sl primitive} if it, along with another group element, generates the group. It is a {\sl palindrome} (with respect to $a$ and $b$) if it reads the same forwards and…

We introduce the finite-horizon first-order rank profile of a language $L \subseteq \Sigma^*$: the least quantifier rank needed by an $\mathrm{FO}[<]$ sentence to classify membership in $L$ correctly on all words of length at most $n$. The…

We prove a variation of Thompson's Theorem. Namely, if the first column of the character table of a finite group $G$ contains only two distinct values not divisible by a given prime number $p>3$, then $O^{pp'pp'}(G)=1$. This is done by…

Let $\Gamma$ be the fundamental group of a manifold modeled on three dimensional Sol geometry. We prove that $\Gamma$ has a finite index subgroup $G$ which has a rational growth series with respect to a natural generating set. We do this by…

It is well known that the discrete analogue of a lattice is a linear code which is a vector subspace of Hamming space $\mathbb{F}^n$. The set $\mathbb{F}$ is a finite field and $n \in \mathbb{Z}_{>0}$. Our attempt is to construct a class of…

In this paper we derive an explicit formula for the Hirzebruch-Mumford volume of an indefinite lattice L of rank at least 3. If \Gamma is an arithmetic subgroup of the group O(L) of isometries of L and L has signature (2,n), then an…

A systematic study is made, for an arbitrary finite relational language with at least one symbol of arity at least 2, of classes of nonrigid finite structures. The well known results that almost all finite structures are rigid and that the…

For any positive integer $n$, we exhibit a cofinite subgroup $\Gamma_n$ of the mapping class group of a surface of genus at most two such that $\Gamma_n$ admits an epimorphism onto a free group of rank $n$. We conclude that…

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated…

We show that given a finitely generated LERF group $G$ with positive rank gradient, and finitely generated subgroups $A,B \leq G$ of infinite index, one can find a finite index subgroup $B_0$ of $B$ such that $[G : \langle A \cup B_0…

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove the existence of a uniform quantifier elimination procedure for formulas of minimal rank (probably the superstable part of the…

Let k be a global field and let k_v be the completion of k with respect to v, a non-archimedean place of k. Let \mathbf{G} be a connected, simply-connected algebraic group over k, which is absolutely almost simple of k_v-rank 1. Let…

The \emph{large rank} of a finite semigroup $\Gamma$, denoted by $r_5(\Gamma)$, is the least number $n$ such that every subset of $\Gamma$ with $n$ elements generates $\Gamma$. Howie and Ribeiro showed that $r_5(\Gamma) = |V| + 1$, where…

Let F be a finitely generated field of characteristic zero and \Gamma<GL_n(F) a finitely generated subgroup. For an element g in \Gamma, let Gal(F(g)/ F) be the Galois group of the splitting field of the characteristic polynomial of g over…

We investigate criteria ensuring that a one-relator group $G$ contains a right-angled Artin subgroup $A(\Gamma)$, corresponding to a finite graph $\Gamma$. In particular, we prove that if $\Gamma$ is a forest with at least one edge and the…

In Team Semantics, a dependency notion is strongly first order if every sentence of the logic obtained by adding the corresponding atoms to First Order Logic is equivalent to some first order sentence. In this work it is shown that all…

The Feferman-Vaught theorem provides a way of evaluating a first order sentence $\varphi$ on a disjoint union of structures by producing a decomposition of $\varphi$ into sentences which can be evaluated on the individual structures and the…

The classical homomorphism preservation theorem, due to {\L}o\'s, Lyndon and Tarski, states that a first-order sentence $\phi$ is preserved under homomorphisms between structures if, and only if, it is equivalent to an existential positive…

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…