Related papers: Integer group determinants for small groups

A complete list of one dimensional groups definable in the p-adic numbers is given, up to a finite index subroup and a quotient by a finite subgroup.

A positive integer $n$ is called practical if all integers between $1$ and $n$ can be written as a sum of distinct divisors of $n$. We give an asymptotic estimate for the number of integers $\le x$ which have a practical divisor $\ge y$.

In this paper, we consider the existence of group divisible designs (GDDs) with block size $4$ and group sizes $4$ and $7$. We show that there exists a 4-GDD of type $4^t 7^s$ for all but a finite specified set of feasible values for $(t,…

We determine the finite groups $G$ in which every subset $A \subseteq G$ of cardinality dividing the order of $G$ is a \emph{factor}, i.e. has a complement $B \subseteq G$ of cardinality $|G|/|A|$ such that $G = A \cdot B$ or $G = B \cdot…

Let $o(G)$ be the average order of a finite group $G$. In this paper, we prove that if $o(G)<\frac{31}{12}$\,, then $G$ is supersolvable. Moreover, we have $o(G)=\frac{31}{12}$ if and only if $G\cong A_4$. We also classify finite groups $G$…

Generalising a previous result, we determine all non-abelian finite simple groups whose order has largest prime divisor not exceeding $10^4$. The computer code for this and similar calculations is made available.

Olga Taussky-Todd suggested the problem of determining the possible values of integer circulant determinants. To solve a special case of the problem, Laquer gave a factorization of circulant determinants. In this paper, we give a modest…

We show that the integer group determinants for the general affine group of degree one, $GA(1,q)$ with $q=p^k$ a prime power, take the form $D=AB^{q-1},$ where $A$ is a $\mathbb Z_{q-1}$ integer group determinant and $B\equiv A \bmod q$.…

A description of the endomorphisms of semidirect products of two groups as a group of $2\times 2$ matrices of maps is already known. Using this description, we have studied the concept of determinant for the endomorphisms of semidirect…

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…

The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…

Recently, group recommendations have attracted considerable attention. Rather than recommending items to individual users, group recommenders recommend items to groups of users. In this position paper, we introduce the problem of forming an…

We consider group orders and right-orders which are discrete, meaning there is a least element which is greater than the identity. We note that free groups cannot be given discrete orders, although they do have right-orders which are…

Every finite local principal ideal ring is the homomorphic image of a discrete valuation ring of a number field, and is determined by five invariants. We present an action of a group, non-commutative in general, on the set of Eisenstein…

The spectrum of a group is the set of its element orders. A finite group $G$ is said to be recognizable by spectrum if every finite group that has the same spectrum as $G$ is isomorphic to $G$. We prove that the simple alternating groups…

In this note we provide some counterexamples for the conjecture of Moret\'{o} on finite simple groups, which says that any finite simple group $G$ can determined in terms of its order $|G|$ and the number of elements of order $p$, where $p$…

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…

A binary operation on any set induces a binary operation on its subsets. We explore families of subsets of a group that become a group under the induced operation and refer to such families as power groups of the given group. Our results…

Let $G$ be a permutation group of degree $n$ and let $s(G)$ denote the number of set-orbits of $G$. We determine $\inf(\frac {\log_2 s(G)} n)$ over all groups $G$ that satisfy certain restrictions on composition factors (i.e. $Alt(k), k >…

Let $A$ be a set of $n$ positive integers. We say that a subset $B$ of $A$ is a divisor of $A$, if the sum of the elements in $B$ divides the sum of the elements in $A$. We are interested in the following extremal problem. For each $n$,…