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

Metacirculants are a rich resource of many families of interesting graphs, and weak metacirculants are generalizations of them. A graph is called a {\em split weak metacirculant} if it has a vertex-transitive split metacyclic automorphism…

First-order logic is known to have limited expressive power over finite structures. It enjoys in particular the locality property, which states that first-order formulae cannot have a global view of a structure. This limitation ensures on…

S. Bera (Line graph characterization of power graphs of finite nilpotent groups, \textit{Communication in Algebra}, 50(11), 4652-4668, 2022) characterized finite nilpotent groups whose power graphs and proper power graphs are line graphs.…

We study groups, exponential groups and ordered groups equipped with valuations. We investigate algebraic and topological features of such valued structures, and apply our findings in order to solve regular equations over groups using…

In this note we study a class of finite groups for which the orders of subgroups satisfy a certain inequality. In particular, characterizations of the well-known groups $\mathbb{Z}_2\times\mathbb{Z}_2$ and $S_3$ are obtained.

Right feeble groups are defined as groupoids $(X,*)$ such that (i) $x, y\in X$ implies the existence of $a, b \in X$ such that $a*x = y$ and $b*y = x$. Furthermore, (ii) if $x, y, z \in X$ then there is an element $w\in X$ such that…

Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of…

We study groups having the property that every non-cyclic subgroup contains its centralizer. The structure of nilpotent and supersolvable groups in this class is described. We also classify finite $p$-groups and finite simple groups with…

In this paper, we investigate the edge-coloring number of the power graph of a finite group. We characterize which finite groups have overfull power graphs, showing that this occurs if and only if the group is cyclic of odd prime power…

We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…

Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…

We examine the relationship between finitely and infinitely generated relatively hyperbolic groups, in two different contexts. First, we elaborate on a remark from math.GR/0601311, which states that the version of Dehn filling in relatively…

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

In the first part, we prove that the dominion (in the sense of Isbell) of a subgroup of a finitely generated nilpotent group is trivial in the category of all nilpotent groups. In the second part, we show that the dominion of a subgroup of…

Herbert Simon's classic rich-get-richer model is one of the simplest empirically supported mechanisms capable of generating heavy-tail size distributions for complex systems. Simon argued analytically that a population of flavored elements…

Rich-club ordering and the dyadic effect are two phenomena observed in complex networks that are based on the presence of certain substructures composed of specific nodes. Rich-club ordering represents the tendency of highly connected and…

We investigate finite groups with the Magnus Property, where a group is said to have the Magnus Property (MP) if whenever two elements have the same normal closure then they are conjugate or inverse conjugate. In particular we observe that…

Interpretation of a structure $\mathbb A$ in $\mathbb B$ allows to produce structures elementarily equivalent to $\mathbb A$ given those elementarily equivalent to $\mathbb B$. In particular, interpretation of the free group in $\mathbb N$…

We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…