English
Related papers

Related papers: On Partial Sums in Cyclic Groups

200 papers

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

Combinatorics · Mathematics 2020-04-24 Simone Costa , Marco Antonio Pellegrini

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

A subset of an abelian group is {\em sequenceable} if there is an ordering $(x_1, \ldots, x_k)$ of its elements such that the partial sums $(y_0, y_1, \ldots, y_k)$, given by $y_0 = 0$ and $y_i = \sum_{j=1}^i x_i$ for $1 \leq i \leq k$, are…

Combinatorics · Mathematics 2022-04-04 Simone Costa , Stefano Della Fiore , M. A. Ollis , Sarah Z. Rovner-Frydman

To partition a sequence of n integers into subsets with prescribed sums is an NP-hard problem in general. In this paper we present an efficient solution for the homogeneous version of this problem; i.e. where the elements in each subset add…

Combinatorics · Mathematics 2018-07-17 Alexander Büchel , Ulrich Gilleßen , Kurt-Ulrich Witt

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Combinatorics · Mathematics 2024-08-20 Noah Kravitz

In this note, we provide some results concerning the structure of a set $A\subseteq \mathbb{Z}_n^{\times}$, which has non-empty subset sums equally distributed modulo $n$. Here, $\mathbb{Z}_n^{\times}$ denotes the set which contains all the…

General Mathematics · Mathematics 2025-12-02 Konstantinos Gaitanas

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.

Group Theory · Mathematics 2019-04-09 Marius Tărnăuceanu

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…

Group Theory · Mathematics 2025-03-10 Philip Hackney , Justin Lynd

For a nonempty finite set $A$ of positive integers, let $\gcd\left(A\right)$ denote the greatest common divisor of the elements of $A$. Let $f\left(n\right)$ and $\Phi\left(n\right)$ denote, respectively, the number of subsets $A$ of…

Number Theory · Mathematics 2013-06-21 Prapanpong Pongsriiam

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

Combinatorics · Mathematics 2012-06-26 Robert S. Coulter , Todd Gutekunst

Generalising Solomon's theorem, C. Gordon and F. Rodriguez-Villegas have proven recently that, in any group, the number of solutions to a system of coefficient-free equations is divisible by the order of this group whenever the rank of the…

Group Theory · Mathematics 2017-05-02 Anton A. Klyachko , Anna A. Mkrtchyan

In this paper, we provide formulas for partial sums of weighted averages over regular integers modulo $n$ of the $\gcd$-sum function with any arithmetic function. Many interesting applications of the results are also given.

Number Theory · Mathematics 2021-05-26 Waseem Alass

We investigate the set of partial partitions of a finite set, ordered by inclusion. With this ordering the set of partial partitions can be studied as an abstract simplicial complex. We use the theory of shellable nonpure complexes to find…

Combinatorics · Mathematics 2023-11-21 Michael J. Gottstein

We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm partitions the…

Combinatorics · Mathematics 2023-06-22 Alexander Büchel , Ulrich Gilleßen , Kurt-Ulrich Witt

Let $\Z/pZ$ be the finite field of prime order $p$ and $A$ be a subsequence of $\Z/pZ$. We prove several classification results about the following questions: (1) When can one represent zero as a sum of some elements of $A$ ? (2) When can…

Combinatorics · Mathematics 2009-01-27 Hoi Nguyen , Van Vu

We identify a class of "semi-modular" forms invariant on special subgroups of $GL_2(\mathbb Z)$, which includes classical modular forms together with complementary classes of functions that are also nice in a specific sense. We define an…

Number Theory · Mathematics 2021-12-02 Matthew Just , Robert Schneider

Denote by $G$ a finite group and by $\psi(G)$ the sum of element orders in $G$. If $t$ is a positive integer, denote by $C_t$ the cyclic group of order $t$ and write $\psi(t)=\psi(C_t)$. In this paper we proved the following Theorem A: Let…

Group Theory · Mathematics 2019-05-30 Marcel Herzog , Patrizia Longobardi , Mercede Maj

We prove a conjecture of Dukes and Herke concerning the possible orders of a basis for the cyclic group Z_n, namely : For each k \in N there exists a constant c_k > 0 such that, for all n \in N, if A \subseteq Z_n is a basis of order…

Number Theory · Mathematics 2009-07-04 Peter Hegarty

This paper aims to address the relation between a magic square of odd order $n$ and a group, and their properties. By the modulo number $n$, we construct entries for each table from initial table of magic square with large number $n^2$.…

Discrete Mathematics · Computer Science 2012-07-24 Mahyuddin K. M. Nasution

Let $n$ be a large number. A subset $A$ of $Z_n$ is complete if $S_A = Z_n$, where $S_A$ is the collection of the subset sums of $A$. Olson proved that if $n$ is a prime and $|A|> 2n^{1/2} $, then $S_A$ is complete. We show that a similar…

Number Theory · Mathematics 2007-05-23 V. Vu
‹ Prev 1 2 3 10 Next ›