Related papers: On the number of tuples of group elements satisfyi…
Our result contains as special cases the Frobenius theorem (1895) on the number of solutions to the equation $x^n=1$ in a group, the Solomon theorem (1969) on the number of solutions in a group to a system of equations having fewer…
Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…
It is shown that, for any pair of cardinals with infinite sum, there exist a group and an equation over this group such that the first cardinal is the number of solutions to this equation and the second cardinal is the number of…
We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…
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…
We study a conjecture by Deaconescu on the solubility of finite groups with claims that if more than half of the elements in a finite group has the same order $k$, then the group is soluble. We show that the original conjecture fails by…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…
The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an…
In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^{r}$ divides the order of a finite group, then the number of subgroups of order $p^{r}$ is $\equiv$ 1(mod $p$).…
In his $1994$ survey, Kleinert defined formally and formulated the problem to obtain unit theorems for unit groups of orders in a semisimple algebra $A$. If $A$ is a group algebra $FG$, it boils down to classifying all finite groups $G$…
We classify the stable formulas in the theory of Dense Linear Orders without endpoints, the stable formulas in the theory of Divisible Abelian Groups, and the stable formulas without parameters in the theory of Real Closed Fields. The third…
Properties of higher characters are developed and applied to symmetric products and Frobenius algebras. A `constructive' proof of the Gel'fand-Kolmogorov theorem is given. Generalisations of that theorem and the Nullstellensatz to symmetric…
Given a number field $K$ that is a subfield of the real numbers, we generalize the notion of the classical Frobenius problem to the ring of integers $\mathfrak{O}_K$ of $K$ by describing certain Frobenius semigroups,…
An old problem in group theory is that of describing how the order of an element behaves under multiplication. To generalize some classical bounds concerning the order $\mathrm o(ab)$ of two elements $a, b$ in a finite abelian group to the…
We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is…
Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…
The theory of Frobenius groups with Frobenius complements of even order largely reduces to tractable algebraic number theory. If we consider only Frobenius complements with an upper bound $s$ on the number of distinct primes dividing the…
We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…
Let F be the (Thompson's) group < x_0, x_1 | [x_0x_1^-1, x_0^-ix_1 x_0^i], i=1,2 >. We study the structure of F-limit groups. Let G_n= < y_1,..., y_m, x_0,x_1 | [x_0x_1^-1,x_0^-1x_1x_0],[x_0x_1^-1,x_0^-2x_1x_0^2], y_j^-1g_j,n(x_0,x_1),…