Related papers: Definable groups for dependent and 2-dependent the…

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…

We consider a certain class of infinitary rules of inference, called here restriction rules, using of which allows us to deduce complete theories of given models. The first instance of such rules was the $\omega$-rule introduced by Hilbert,…

A conjecture in algorithmic model theory predicts that the model-checking problem for first-order logic is fixed-parameter tractable on a hereditary graph class if and only if the class is monadically dependent. Originating in model theory,…

In this paper, we study arbitrary models of the first-order theory of a ring $A$ where the additive group $A$ is a finitely generated abelian group. Following an earlier paper by this author, Alexei G. Myasnikov and Francis Oger, we call…

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

A new proof of the classification for tensor ideal thick subcategories of the bounded derived category, and the stable category, of modular representations of a finite group is obtained. The arguments apply more generally to yield a…

This is the second installment of an exposition of an ACL2 formalization of finite group theory. The first, which was presented at the 2022 ACL2 workshop, covered groups and subgroups, cosets, normal subgroups, and quotient groups,…

We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…

We examine second bounded cohomology and mod p homology in finite index subgroups of 1-relator groups and groups with a presentation of deficiency at least one. We use this to determine exactly which 1-relator groups are boundedly…

Let $\mathcal{S}$ be a family of sets with VC-codensity less than $2$. We prove that, if $\mathcal{S}$ has the $(\omega, 2)$-property (for any infinitely many sets in $\mathcal{S}$, at least $2$ among them intersect), then $\mathcal{S}$ can…

Possibility theory offers a framework where both Lehmann's "preferential inference" and the more productive (but less cautious) "rational closure inference" can be represented. However, there are situations where the second inference does…

Given a definably amenable approximate subgroup $A$ of a (local) group in some first-order structure, there is a type-definable subgroup $H$ normalised by $A$ and contained in $A^4$ such that every definable superset of $H$ has positive…

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.

Let $FG$ be the group algebra of a finite $p$-group $G$ over a finite field $F$ of positive characteristic $p$. Let $\cd$ be an involution of the algebra $FG$ which is a linear extension of an anti-automorphism of the group $G$ to $FG$. If…

In this article, we introduce an interesting topology-like concept concerning groups (and with almost the same method it can be defined for other algebraic systems). Given an arbitrary group $G$, we define a {\em topo-system} on $G$ as a…

A recurring theme in finite group theory is understanding how the structure of a finite group is determined by the arithmetic properties of group invariants. There are results in the literature determining the structure of finite groups…

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

For a finite group $G$, let $\sigma(G)$ be the number of subgroups of $G$ and $\sigma_\iota(G)$ the number of isomorphism types of subgroups of $G$. Let $L=L_r(p^e)$ denote a simple group of Lie type, rank $r$, over a field of order $p^e$…

Every infinite group $G$ of regular cardinality can be partitioned $G=A_1\cup A_2$ so that $G\neq FA_1$, $G\neq FA_2$ for every subset $F\subset G$ of cardinality $|F|<|G|$. The first author asked whether the same is true for each group $G$…

A maximal abelian normal subgroup A in a nilpotent group N is self-centralizing. This makes their role an important one in determining the structure of the nilpotent group. For example if A is finite then N is also finite. In the free…