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

We summarize several results about non-simplicity, solvability and normal structure of finite groups related to the number of conjugacy classes appearing in the product or the power of conjugacy classes. We also collect some problems that…

Let $G$ be a finite soluble group and $h(G)$ its Fitting length. The aim of this paper is to give certain upper bounds for $h(G)$ as functions of the Fitting length of at least three Hall subgroups of $G$ which factorize $G$ in a particular…

A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

For each strongly connected finite-dimensional (pure) simplicial complex we construct a finite group, the group of projectivities of the complex, which is a combinatorial but not a topological invariant. This group is studied for…

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…

This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…

We obtain upper bounds on the number of finite sets $\mathcal S$ of primes below a given bound for which various $2$ variable $\mathcal S$-unit equations have a solution.

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…

We study the probability that the product of two randomly chosen elements in a finite ring $R$ is equal to some fixed element $x \in R$. We calculate this probability for semisimple rings and some special classes of local rings, and find…

We consider factorizations of a finite group $G$ into conjugate subgroups, $G=A^{x_{1}}\cdots A^{x_{k}}$ for $A\leq G$ and $x_{1},\ldots ,x_{k}\in G$, where $A$ is nilpotent or solvable. First we exploit the split $BN$-pair structure of…

Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two polynomials in F_p[X] of degree less than n. For n large compared to p, we establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the iterated…

We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field…

Let $G$ be a finite group. A proper subgroup $H$ of $G$ is said to be large if the order of $H$ satisfies the bound $|H|^3 \ge |G|$. In this note we determine all the large maximal subgroups of finite simple groups, and we establish an…

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…

In studying the complexity of iterative processes it is usually assumed that the arithmetic operations of addition, multiplication, and division can be performed in certain constant times. This assumption is invalid if the precision…

We prove by using simple number-theoretic arguments formulae concerning the number of elements of a fixed order and the number of cyclic subgroups of a direct product of several finite cyclic groups. We point out that certain multiplicative…