Related papers: A Group with Exactly One Noncommutator

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Let $G$ be a finite non-abelian group and $\kappa_1(G)$ the number of conjugate classes of minimal non-abelian subgroups of $G$. The structure of $G$ with $\kappa_1(G)=1$ is determined. In the case of $G$ being the $p$-groups, the structure…

Let $G$ be a finite group and $\psi(G)=\sum_{g\in{G}}{o(g)}$. There are some results about the relation between $\psi(G)$ and the structure of $G$. For instance, it is proved that if $G$ is a group of order $n$ and…

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

We enumerate three classes of non-medial quasigroups of order $243=3^5$ up to isomorphism. There are $17004$ non-medial trimedial quasigroups of order $243$ (extending the work of Kepka, B\'en\'eteau and Lacaze), $92$ non-medial…

In this paper we prove that any finite group of order $n$ can be viewed as the group of the solutions of a certain matrix equation $XB=BY$, where the unknowns $X,Y$ are two permutation matrices of order $n$ and $(1+k)n+2 $ respectively and…

A longstanding conjecture asserts that every non-abelian finite $p$-group $G$ admits a non-inner automorphism of order $p$. The conjecture is valid for finite $p$-groups of class 2. Here, we prove every finite non-abelian $p$-group $G$ of…

In this paper we define and investigate a class of groups characterized by a representation-theoretic property we call purely noncommuting or PNC. This property guarantees that the group has an action on a smooth projective variety with…

We present a theoretical algorithm which, given any finite presentation of a group as input, will terminate with answer yes if and only if the group is large. We then implement a practical version of this algorithm using Magma and apply it…

This paper deals with the number of subgroups of a given exponent in a finite abelian group. Explicit formulas are obtained in the case of rank two and rank three abelian groups. An asymptotic formula is also presented.

We prove that all hypergroups of order four are commutative and that there exists a non-comutative hypergroup of order five. These facts imply that the minimum order of non-commutative hypergroups is five even though the minimum order of…

Groups of unknown order are of major interest due to their applications including time-lock puzzles, verifiable delay functions, and accumulators. In this paper we focus on trustless setup: in this setting, the most popular unknown-order…

Let $k(G)$ be the number of conjugacy classes of finite groups $G$ and $\pi_e(G)$ be the set of the orders of elements in $G$. Then there exists a non-negative integer $k$ such that $k(G)=|\pi_e(G)|+k$. We call such groups to be $co(k)$…

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

We consider elements of finite order in the Riordan group $\cal R$ over a field of characteristic $0$. Viewing $\cal R$ as a semi-direct product of groups of formal power series, we solve, for all $n \geq 2$, two foundational questions…

We apply Voronoi's algorithm to compute representatives of the conjugacy classes of maximal finite subgroups of the unit group of a maximal order in some simple $\QQ $-algebra. This may be used to show in small cases that non-conjugate…

This paper initiates a systematic development of a theory of non-commutative optimization. It aims to unify and generalize a growing body of work from the past few years which developed and analyzed algorithms for natural geodesically…

The degree pattern of a finite group is the degree sequence of its prime graph in ascending order of vertices. We say that the problem of OD-characterization is solved for a finite group if we determine the number of pairwise nonisomorphic…

We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…