Related papers: An Upper Bound of Composition Series

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…

In this note some properties of the sum of element orders of a finite abelian group are studied.

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.

We construct a family of finite special 2-groups which have commuting graph of increasing diameter

Let $k$ be an even positive integer, $p$ be a prime and $m$ be a nonnegative integer. We find an upper bound for orders of zeros (at cusps) of a linear combination of classical Eisenstein series of weight $k$ and level $p^m$. As an…

We find an upper bound for the number of groups of order $n$ up to isomorphism in the variety $G = A_pA_qA_r$, where $p$, $q$ and $r$ are distinct primes. We also find a bound on the orders and on the number of conjugacy classes of…

We establish an upper bound on the cardinality of a minimal generating set for the fundamental group of a large family of connected, balanced simplicial complexes and, more generally, simplicial posets.

A general achievable upper bound of extractable work under feedback control is given, where nonequilibrium equalities are generalized so as to be applicable to error-free measurements. The upper bound involves a term which arises from the…

We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…

We prove new upper bounds for the length of laws that hold for all groups of size at most $n$ -- improving on previous results of Bou-Rabee and Kassabov-Matucci. The methods make use of the classification of finite simple groups. Stronger…

The characterizations when two natural upper bounds of the set of copulas with a given diagonal section are copulas have been well studied in the literature. Given a curvilinear section, however, there is only a partial result concerning…

Let $G$ be a finite group. A sequence over $G$ means a finite sequence of terms from $G$, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can be ordered such that their product…

This is the first paper in a sequence on Krull dimension for limit groups, answering a question of Z. Sela. In this paper we show that strict resolutions of a fixed limit group have uniformly bounded length. The upper bound plays two roles…

We investigate the occurrence of elements of order $p$ in the upper central series of a finite $p$-group.

The main aim of the note is to provide an upper-bound for the characteristic number of conic-line arrangements with ordinary singularities in the complex projective plane.

We show that an infinite residually finite boundedly generated group has an infinite chain of finite index subgroups with ranks uniformly bounded, and give (sublinear) upper bounds on the ranks of arbitrary finite index subgroups of…

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

The paper is concerned with the character theory of finite groups of Lie type. The irreducible characters of a group $G$ of Lie type are partitioned in Lusztig series. We provide a simple formula for an upper bound of the maximal size of a…