Related papers: Tarski-type problems for free associative algebras

For an abelian variety $A$ over a finitely generated field $K$ of characteristic $p > 0$, we prove that the algebraic rank of $A$ is at most a suitably defined analytic rank. Moreover, we prove that equality, i.e., the BSD rank conjecture,…

Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.

One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…

Suppose $A$ is a graded associative algebra over a field, $I$ is its ideal generated by a set $\alpha$ of homogeneous elements, and B = A/I. In this note, some inequalities between Hilbert series of algebras $A,B$ and the number of elements…

We develop the theory of ``branch algebras'', which are infinite-dimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting…

Let $F$ be a field and let $F \langle X \rangle$ be the free unital associative $F$-algebra on the free generating set $X = \{ x_1, x_2, \dots \}$. A subalgebra (a vector subspace) $V$ in $F \langle X \rangle$ is called a $T$-subalgebra (a…

We present a novel approach to the representation theory of finite dimensional algebras motivated by the emerging theory of graph limits. We introduce the rank spectrum of a finite dimensional algebra $R$ over a finite field. The elements…

We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative…

We describe gradings by finite abelian groups on the associative algebras of infinite matrices with finitely many nonzero entries, over an algebraically closed field of characteristic zero.

A finite Grobner-Shirshov basis is constructed for the plactic algebra of rank 3 over a field K. It is also shown that plactic algebras of rank exceeding 3 do not have finite Grobner-Shirshov bases associated to the natural…

We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…

As an instance of a linear action of a Hopf algebra on a free associative algebra, we consider finite group gradings of a free algebra induced by gradings on the space spanned by the free generators. The homogeneous component corresponding…

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

Let $\Gamma$ be a centerless irreducible higher rank arithmetic lattice in characteristic zero. We prove that if $\Gamma$ is either non-uniform or is uniform of orthogonal type and dimension at least 9, then $\Gamma$ is bi-interpretable…

Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…

We lay the foundations of the first-order model theory of Coxeter groups. Firstly, with the exception of the $2$-spherical non-affine case (which we leave open), we characterize the superstable Coxeter groups of finite rank, which we show…

Based on Bergman's Lemma on centralizers, we obtain a sharp lower degree bound for nonconstant elements in a subalgebra generated by two elements of a free associative algebra over an arbitrary field.

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

We investigate the problem of type isomorphisms in the presence of higher-order references. We first introduce a finitary programming language with sum types and higher-order references, for which we build a fully abstract games model…

We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…