Related papers: Counting Finite Magmas

In this expository article, the real numbers are defined as infinite decimals. After defining an ordering relation and the arithmetic operations, it is shown that the set of real numbers is a complete ordered field. It is further shown that…

A generating function of the number of homomorphisms from the fundamental group of a compact oriented or non-orientable surface without boundary into a finite group is obtained in terms of an integral over a real group algebra. We calculate…

We develop methods for computing with matrix groups defined over a range of infinite domains, and apply those methods to the design of algorithms for nilpotent groups. In particular, we provide a practical algorithm to test nilpotency of…

We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…

We show that for a typical high rank arithmetic lattice $\Gamma$, there exist finite index subgroups $\Gamma_{1}$ and $\Gamma_{2}$ such that $\Gamma_{1} \not\simeq \Gamma_{2}$ while $\widehat{\Gamma_{1}} \simeq \widehat{\Gamma_{2}}$. But…

We perform the computations necessary to establish a multiplicity one statement for the irreducible representations of a finite spin group which in turn yields the classification of irreducible representations of finite spin groups. (The…

We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…

Finite hamiltonian groups are counted. The sequence of numbers of all groups of order $n$ all whose subgroups are normal and the sequence of numbers of all groups of order less or equal to $n$ all whose subgroups are normal are presented.

The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…

We consider the Yamabe invariant of a compact orbifold with finitely many singular points. We prove a fundamental inequality for the estimate of the invariant from above, which also includes a criterion for the non-positivity of it.…

In this paper, we provide new criteria for the solvability and supersolvability of a finite group based on its number of cyclic subgroups. A finite group G is called n-cyclic if it contains n cyclic subgroups. This paper also partially…

We describe an algorithm for obtaining generators of the unit group of the integral group ring ZG of a finite abelian group G. We used our implementation in Magma of this algorithm to compute the unit groups of ZG for G of order up to 110.…

We prove the finite generation of canonical rings of projective variety of general type defined over complex numbers.

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Let $\sigma$ denote an endomorphism of a smooth algebraic group $G$ over the algebraic closure of a finite field, and assume all iterates of $\sigma$ have finitely many fixed points. Steinberg gave a formula for the number of fixed points…

We consider a category of finite crystals of a quantum affine algebra whose objects are not necessarily perfect, and set of paths, semi-infinite tensor product of an object of this category with a certain boundary condition. It is shown…

We propose a novel method to compute multi-loop master integrals by constructing and numerically solving a system of ordinary differential equations, with almost trivial boundary conditions. Thus it can be systematically applied to problems…

We report on the computation of invariants, covariants, and contravariants of cubic surfaces. All algorithms are implemented in the computer algebra system magma.

We enumerate the 15768 perfect groups of order up to $2\cdot 10^6$, up to isomorphism, thus also completing the missing cases in the prior classification. The work supplements the by now well-understood computer classifications of solvable…

We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers,…