相关论文: On complexity of multiplication in finite soluble …

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Probabilistic justification logic is a modal logic with two kind of modalities: probability measures and explicit justification terms. We present a tableau procedure that can be used to decide the satisfiability problem for this logic in…

We construct a class of finitely presented groups where the isomorphism problem is solvable but the commensurability problem is unsolvable. Conversely, we construct a class of finitely presented groups within which the commensurability…

We determine for which known finite simple groups $G$ and which primes $p$ the $p$-fusion system of $G$ is simple. This means first collecting together the results that were already known (and correcting two errors made in an earlier study…

If the left multiplication group of a loop is simple, then the loop is simple. We use this observation to give examples of infinite simple Bol loops.

In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…

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 establish a lower bound for the complexity of multiplying two skew polynomials. The lower bound coincides with the upper bound conjectured by Caruso and Borgne in 2017, up to a log factor. We present algorithms for three special cases,…

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

Presenting a finite group by a free product of finite cyclic groups the Hopf formula for the Schur multiplier affords also a covering group, and this has minimal exponent provided that the order of the generators is preserved. This…

We provide new bounds for the divisibility function of the free group F_2 and construct short laws for the symmetric groups Sym(n). The construction is random and relies on the classification of the finite simple groups. We also give bounds…

A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…

Twenty years ago Gromov asked about how large is the set of isomorphism classes of groups whose systolic area is bounded from above. This article introduces a new combinatorial invariant for finitely presentable groups called {\it…

This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

In this article, I study some classes of finitely presented groups with the aim of finding out whether the maximal metabelian quotients of the members of these classes admit finite presentations. The considered classes include those of…

We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…

In this paper we consider symmetric powers representation and exterior powers representation of finite groups, which generated by the representation which has finite dimension over the complex field. We calculate the multiplicity of…