Related papers: On effective constructions of existentially closed…

Classes of algebraic structures that are defined by equational laws are called varieties or equational classes. A variety is finitely generated if it is defined by the laws that hold in some fixed finite algebra. We show that every…

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…

Let $R$ be a ring, let $G$ be an amenable group and let $R\ast G$ be a crossed product. The goal of this paper is to construct, starting with a suitable additive function $L$ on the category of left modules over $R$, an additive function on…

What are simplest ways to construct a finite group from its atomic constituents? To understand part-whole relations between finite simple groups and the global structure of finite groups, we axiomatize complexity measures on finite groups.…

We investigate existentially closed models (of a quite arbitrary theory) equipped which an action of a fixed group G. We embed these structures in a monster model D of some well-rounded theory and describe them as PAC substructures of D.…

Here we initiate a program to study relationships between finite groups and arithmetic-geometric invariants in a systematic way. To do this we first introduce a notion of optimal module for a finite group in the setting of holomorphic mock…

This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…

In this paper we present an alternative approach to formalize the theory of logic programming. In this formalization we allow existential quantified variables and equations in queries. In opposite to standard approaches the role of answer…

Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…

The paper considers computable Folner sequences in computably enumerable amenable groups. We extend some basic results of M. Cavaleri on existence of such sequences to the case of groups where finite generation is not assumed. We also…

For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…

We give a classification of all exact structures on a given idempotent complete additive category. Using this, we investigate the structure of an exact category with finitely many indecomposables. We show that the relation of the…

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…

Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…

This $2^{nd}$-edition article is intended to be an up-to-date archive of the current state of the questions: Which finitely generated groups $G$: have semistable fundamental group at infinity; are simply connected at infinity; are such that…