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

This is a survey on propositional proof complexity aimed at introducing the basics of the field with a particular focus on a method known as feasible interpolation. This method is used to construct "hard theorems" for several proof systems…

Finite groups with given systems of permuteral and strongly permuteral subgroups are studied. New characterizations of w-supersoluble and supersoluble groups are received.

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…

We propose an algorithm to find a lower bound for the number of cyclic codes over any finite field with any given exponent. Besides, we give a formula to find the exponent of BCH codes.

We consider closed orientable 3-dimensional hyperbolic manifolds which are cyclic branched coverings of the 3-sphere, with branching set being a two-bridge knot (or link). We establish two-sided linear bounds depending on the order of the…

In recent years some near-optimal estimates have been established for certain sum-product type estimates. This paper gives some first extremal results which provide information about when these bounds may or may not be tight. The main tool…

We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…

This paper classifies the factorizations of almost simple groups with a factor having at least two nonsolvable composition factors. This together with a previous classification result of the authors reduces the factorization problem of…

The object of this paper is to examine finite solvable groups whose integral group rings have only trivial central units.

Computations in the cohomology of finite groups.

Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…

A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…

We discuss the Euclidean limit of hyperbolic SU(2)-monopoles, framed at infinity, from the point of view of pluricomplex geometry. More generally, we discuss the geometry of hypercomplex manifolds arising as limits of pluricomplex…

We classify the irreducible representations of smooth, connected affine algebraic groups over a field, by tackling the case of pseudo-reductive groups. We reduce the problem of calculating the dimension for pseudo-split pseudo-reductive…

We give several necessary and sufficient conditions for the existence of {\it the presentation by conjugation} for a non-simply laced extended affine Weyl group. We invent a computational tool by which one can determine simply the existence…

We define vertex cover algebras for weighted simplicial multicomplexes and prove basics properties of them. Also, we describe these algebras for multicomplexes which have only one maximal facet and we prove that they are finitely generated.

Let $\lambda(G)$ be the maximum number of subgroups in an irredundant covering of a finite group $G$. We prove that the finite groups with $\lambda(G)=|G|-t$, where $t\leq 5$, are solvable, and classify such groups.

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of…