Related papers: A problem on partial sums in abelian groups

In this paper, we introduce the concept of a relative Heffter space which simultaneously generalizes those of relative Heffter arrays and Heffter spaces. Given a subgroup $J$ of an abelian group $G$, a relative Heffter space is a resolvable…

The target of this article is to discuss the concept of \textit{commuting probability} of finite groups which, in short, is a probabilistic measure of how abelian our group is. We shall compute the value of commuting probability for many…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…

We show that the semi-simplicity conjecture for finitely generated fields follows from the conjunction of the semi-simplicity conjecture for finite fields and for the maximal abelian extension of the field of rational numbers.

In this paper we highlight a few open problems concerning maximal sum-free sets in abelian groups. In addition, for most even order abelian groups $G$ we asymptotically determine the number of maximal distinct sum-free subsets in $G$. Our…

In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…

Some class of sums which naturally include the sums of powers of integers is considered. A number of conjectures concerning a representation of these sums is made.

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

Recently, R\'emond stated a very general conjecture on lower bounds of a normalized height on either an abelian variety or a power of the multiplicative group. In this note, we extend a particular case of this conjecture to split…

A conjecture is given that, if true, could lead to an algorithm for computing definite sums of rational functions.

The main purpose of present paper is to determine some lower bounds for the quotient of the normalized hyper-Bessel function and its partial sum, as well as for the quotient of the derivative of normalized hyper-Bessel function and its…

Let $G$ be a nonabelian group. We say that $G$ has an abelian partition, if there exists a partition of $G$ into commuting subsets $A_1, A_2, \ldots, A_n$ of $G$, such that $|A_i|\geqslant 2$ for each $i=1, 2, \ldots, n$. This paper…

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

In this paper we study categorical properties of the category of abelian hypergroups that leads to the notion of hyper (almost) preadditive and hyper (almost) abelian categories. Our goal is to create a path towards a general theory of…

The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P \subset (0,1] be the set of commuting probabilities of all finite groups. We prove that every point of P is…

We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.

Let $H$ be a nonabelian finite simple group. Huppert's conjecture asserts that if $G$ is a finite group with the same set of complex character degrees as $H$, then $G\cong H\times A$ for some abelian group $A$. Over the past two decades,…

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

We give a new characterization of partial groups as a subcategory of symmetric (simplicial) sets. This subcategory has an explicit reflection, which permits one to compute colimits in the category of partial groups. We also introduce the…