Related papers: A Package of Programs for Determination of Some Cl…
Machine learning algorithms have been used to determine probabilistic classifications of unassociated sources. Often classification into two large classes, such as Galactic and extra-galactic, is considered. However, there are many more…
We announce an atlas of subgroup lattices of almost simple groups and present two algorithms that were used to produce the atlas.
We give an explicit bound on orders of finite subgroups of Cremona group of rank three over $\mathbb{Q}$.
Recently, we have introduced and studied the topic of sub-indices and sub-factors of groups. During those studies, an algorithm for obtaining the sub-factors of a finite group was stated and proved, which has a particular case for…
Marius T\u{a}rn\u{a}uceanu described the finite groups $G$ having $|G|-1$ cyclic subgroups. We describe the finite groups $G$ having $|G|-\Delta$ cyclic subgroups for $\Delta=2, 3, 4$ and $5$.
We prove a division algorithm for group rings of high genus surface groups and use it to show that some $2$-complexes with surface fundamental groups are standard. We also give an application of division to cohomological dimension of…
We obtain a classification of the finite two-generated cyclic-by-abelian groups of prime-power order. For that we associate to each such group $G$ a list $\inv(G)$ of numerical group invariants which determines the isomorphism type of $G$.…
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…
Using previous results concerning the rank two and rank three cases, all connected simply connected Cartan schemes for which the real roots form a finite irreducible root system of arbitrary rank are determined. As a consequence one obtains…
The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…
In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.
Our main objective is to show that the computational methods that we previously developed to search for difference families in cyclic groups can be fully extended to the more general case of arbitrary finite abelian groups. In particular…
We classify all finite simple subgroups in the Cremona group of rank 3
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequalities are presented, including sparse PSD cuts, and…
For real application and theoretical investigation of ordinary hypergraphs and non-ordinary hypergraphs, researchers need to establish standard rules and feasible operating methods. We propose a visualization tool for investigating…
A program to calculate the three-particle hyperspherical brackets is presented. Test results are listed and it is seen that the program is well applicable up to very high values of the hypermomentum and orbital momenta. The listed runs show…
SOFTSUSY is a program which accurately calculates the spectrum of superparticles in the CP-conserving Minimal Supersymmetric Standard Model (MSSM), with a full flavour mixing structure. The program solves the renormalisation group equations…
Superquadrics provide a compact representation of common shapes and have been used both for object/surface modelling in computer graphics and as object-part representation in computer vision and robotics. Superquadrics refer to a family of…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
We define the thin fundamental Gray 3-groupoid $S_3(M)$ of a smooth manifold $M$ and define (by using differential geometric data) 3-dimensional holonomies, to be smooth strict Gray 3-groupoid maps $S_3(M) \to C(H)$, where $H$ is a…