Related papers: On the model theory of higher rank arithmetic grou…

This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…

We introduce a model-complete theory which completely axiomatizes the structure $Z_{\alpha}=(Z, +, 0, 1, f)$ where $f : x \to \lfloor{\alpha} x \rfloor $ is a unary function with $\alpha$ a fixed transcendental number. When $\alpha$ is…

Let $\Gamma$ be a group which is virtually free of rank at least 2 and let $\mathcal{F}_{td}(\Gamma)$ be the family of totally disconnected, locally compact groups containing $\Gamma$ as a co-compact lattice. We prove that the values of the…

For a fixed countably infinite structure \Gamma\ with finite relational signature \tau, we study the following computational problem: input are quantifier-free \tau-formulas \phi_0,\phi_1,...,\phi_n that define relations R_0,R_1,...,R_n…

It is well known that whenever a class of structures $\mathcal{K}_1$ is interpretable in a class of structures $\mathcal{K}_2$, then the hereditary undecidability of (a fragment of) the theory of $\mathcal{K}_1$ implies the hereditary…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

We will prove bi-interpretability of the arithmetic $\N = \langle N, +,\cdot, 0, 1\rangle$ and the weak second order theory of $\N$ with the free monoid $\mathbb{M}_X$ of finite rank greater than 1 and with a non-trivial partially…

We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…

When the standard representation of a crystallographic Coxeter group $\Gamma$ is reduced modulo an odd prime $p$, a finite representation in some orthogonal space over $\mathbb{Z}_p$ is obtained. If $\Gamma$ has a string diagram, the latter…

Let $K$ be a global function field of characteristic $p$, and let $\Gamma$ be a finite-index subgroup of an arithmetic group defined with respect to $K$ and such that any torsion element of $\Gamma$ is a $p$-torsion element. We define…

We study definable ranks of ordered fields, ordered abelian groups, and linear orders. For an arbitrary linear order $\Gamma$, we construct an ordered abelian group $G$ with archimedian spine $\Gamma$ and an ordered field $K$ with natural…

Given an irreducible lattice $\Gamma$ in the product of higher rank simple Lie groups, we prove a co-finiteness result for the $\Gamma$-invariant von Neumann subalgebras of the group von Neumann algebra $\mathcal{L}(\Gamma)$, and for the…

Let $X$ be a locally finite irreducible affine building of dimension $\geq 2$ and $\Gamma \leq \mathrm{Aut}(X)$ be a discrete group acting cocompactly. The goal of this paper is to address the following question: When is $\Gamma$ linear?…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…

In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…

Let $p$ be a prime and let $\mathbb{C}$ be the complex field. We explicitly classify the finite solvable irreducible monomial subgroups of $\mathrm{GL}(p,\mathbb{C})$ up to conjugacy. That is, we give a complete and irredundant list of…