Related papers: Rich groups, weak second order logic, and applicat…

We develop several aspects of local and global stability in continuous first order logic. In particular, we study type-definable groups and genericity.

We give a combinatorial criterion that implies both the non-strong relative hyperbolicity and the one-endedness of a finitely generated group. We use this to show that many important classes of groups do not admit a strong relatively…

In this paper we consider two functions related to the arithmetic and geometric means of element orders of a finite group, showing that certain lower bounds on such functions strongly affect the group structure. In particular, for every…

We consider the group $\mathfrak{X}(G)$ obtained from $G\ast G$ by forcing each element $g$ in the first free factor to commute with the copy of $g$ in the second free factor. Deceptively complicated finitely presented groups arise from…

In this article we introduce and study a class of finite groups for which the orders of normal subgroups satisfy a certain inequality. It is closely connected to some well-known arithmetic classes of natural numbers.

We develop first-order logic and some extensions for incomplete information scenarios and consider related complexity issues.

We consider profinite groups as 2-sorted first order structures, with a group sort, and a second sort which acts as an index set for a uniformly definable basis of neighbourhoods of the identity. It is shown that if the basis consists of…

We study the finite solvable groups $G$ in which every real element has prime power order. We divide our examination into two parts: the case $\textbf{O}_2(G)>1$ and the case $\textbf{O}_2(G)=1$. Specifically we proved that if…

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…

We prove various properties on the structure of groups whose power graph is chordal. Nilpotent groups with this property have been classified by Manna, Cameron and Mehatari [The Electronic Journal of Combinatorics, 2021]. Here we classify…

We call a finite group irrational if none of its elements is conjugate to a distinct power of itself. We prove that those groups are solvable and describe certain classes of these groups, where the above property is only required for…

We consider largeness of groups given by a presentation of deficiency 1, where the group is respectively free-by-cyclic, LERF or 1-relator. We give the first examples of (finitely generated free)-by-(infinite cyclic) word hyperbolic groups…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

We construct finitely generated groups with strong fixed point properties. Let $\mathcal{X}_{ac}$ be the class of Hausdorff spaces of finite covering dimension which are mod-$p$ acyclic for at least one prime $p$. We produce the first…

In this note we introduce and characterize a class of finite groups for which the element orders satisfy a certain inequality. This is contained in some well-known classes of finite groups.

A logic family is a bunch of logics that belong together in some way. First-order logic is one of the examples. Logics organized into a structure occurs in abstract model theory, institution theory and in algebraic logic. Logic families…

We show that every finite group $G$ of size at least $3$ has a nilpotent subgroup of class at most $2$ and size at least $|G|^{1/32\log\log|G|}$. This answers a question of Pyber, and is essentially best possible.

We prove that thick groups (and more generally thick graphs) have trivial Floyd boundary. This shows a wide class of finitely generated groups that are non-relatively hyperbolic have trivial Floyd boundary. In addition to giving new…

Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-described structure. We prove this in an efficient fashion.…

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…