Related papers: Equations in virtually abelian groups: languages a…
We discuss various methods and their effectiveness for solving linear equations over finitely generated abelian groups. More precisely, if $\varphi\colon G\to H$ is a homomorphism of finitely generated abelian groups and $b\in H$, we…
Let $G$ be an acylindrically hyperbolic group on a $\delta$-hyperbolic space $X$. Assume there exists $M$ such that for any finite generating set $S$ of $G$, the set $S^M$ contains a hyperbolic element on $X$. Suppose that $G$ is…
We study the growth of torsion in the abelianizations of finite index subgroups in finitely generated metabelian groups. This complements earlier work of Kar, Kropholler and the author which covered the finitely presented amenable groups.
Let $G$ be a virtually special group. Then the residual finiteness growth of $G$ is at most linear. This result cannot be found by embedding $G$ into a special linear group. Indeed, the special linear group $\text{SL}_k(\mathbb{Z})$, for $k…
Answer Set Programming (ASP) is a prominent problem-modeling and solving framework, whose solutions are called answer sets. Epistemic logic programs (ELP) extend ASP to reason about all or some answer sets. Solutions to an ELP can be seen…
Current representations used in reasoning steps of large language models can mostly be categorized into two main types: (1) natural language, which is difficult to verify; and (2) non-natural language, usually programming code, which is…
I describe a class of groups acting on rooted trees. The original claim was that all have intermediate word growth between polynomial and exponential. The argument constructs a functional equation on the growth formal power series, and…
It is well-known that abelian varieties are projective, and so that there exist explicit polynomial and rational functions which define both the variety and its group law. It is however difficult to find any explicit polynomial and rational…
We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…
We consider strong expansions of the theory of ordered abelian groups. We show that the assumption of strength has a multitude of desirable consequences for the structure of definable sets in such theories, in particular as relates to…
We investigate the rate of growth of the function of n which counts the number of complex irreducible representations of a fixed group of degree less than or equal to n. The emphasis is on linear groups, especially compact real and p-adic…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
This paper concerns the development of metatheory for extensible languages. It uses as its starting point a view that programming languages tailored to specific application domains are to be constructed by composing components from an open…
The problem of finding the number of ordered commuting tuples of elements in a finite group is equivalent to finding the size of the solution set of the system of equations determined by the commutator relations that impose commutativity…
This document aims to give a self-contained account of the parts of abelian group theory that are most relevant for algebraic topology. It is almost purely expository, although there are some slightly unusual features in the treatment of…
Dialectical frameworks are a unifying model of formal argumentation, where argumentative relations between arguments are represented by assigning acceptance conditions to atomic arguments. Their generality allow them to cover a number of…
Green [Geometric and Functional Analysis 15 (2005), 340--376] established a version of the Szemer\'edi Regularity Lemma for abelian groups and derived the Removal Lemma for abelian groups as its corollary. We provide another proof of his…
We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of…
Systems of equations with sets of integers as unknowns are considered. It is shown that the class of sets representable by unique solutions of equations using the operations of union and addition $S+T=\makeset{m+n}{m \in S, \: n \in T}$ and…
The issue of so-called maximal regularity is discussed within a Hilbert space framework for a class of evolutionary equations. Viewing evolutionary equations as a sums of two unbounded operators, showing maximal regularity amounts to…