English
Related papers

Related papers: Zero-sum-free sequences with few subsequence sums

200 papers

To define the notion of a generic property of finite dimensional 2-step nilpotent Lie algebras we use standard correspondence between such Lie algebras and points of an appropriate algebraic variety, where a negligible set is one contained…

Rings and Algebras · Mathematics 2014-08-06 Maria V. Milentyeva

We construct sequencings for many groups that are a semi-direct product of an odd-order abelian group and a cyclic group of odd prime order. It follows from these constructions that there is a group-based complete Latin square of order $n$…

Combinatorics · Mathematics 2018-12-14 M. A. Ollis , Christopher R. Tripp

Let $A$ be a finite rank torsion--free abelian group. Then there exist direct decompositions $A=B\oplus C$ where $B$ is completely decomposable and $C$ has no rank 1 direct summand. In such a decomposition $B$ is unique up to isomorphism…

Group Theory · Mathematics 2017-01-11 Adolf Mader , Phill Schultz

Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…

History and Overview · Mathematics 2013-07-09 Zbigniew Nitecki

Continuing on from recent results of Brumer-Kramer and of Schoof, we show that there exist non-zero semistable Abelian varieties over Z[1/N], with N squarefree, if and only if N is not in the set {1,2,3,5,6,7,10,13}. Our results are…

Number Theory · Mathematics 2007-05-23 Frank Calegari

Cameron and Erd\H{o}s raised the question of how many maximal sum-free sets there are in $\{1, \dots , n\}$, giving a lower bound of $2^{\lfloor n/4 \rfloor }$. In this paper we prove that there are in fact at most $2^{(1/4+o(1))n}$ maximal…

Combinatorics · Mathematics 2014-09-22 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

Dynamical Systems · Mathematics 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

Negative avoiding sequences of span $n$ are periodic sequences of elements from $\mathbb{Z}_k$ for some $k$ with the property that no $n$-tuple occurs more than once in a period and if an $n$-tuple does occur then its negative does not.…

Combinatorics · Mathematics 2026-04-24 Chris J Mitchell , Peter R Wild

In this article we construct for each integer $n\ge 2$ an abelian variety $A$ of dimension $n$ defined over a number field for which there exists a symmetric slope sequence of length $2n$ that does not appear as the slope sequence of…

Number Theory · Mathematics 2014-02-26 Jiangwei Xue , Chia-Fu Yu

We consider a variant on the Tetranacci sequence, where one adds the previous four terms, then divides the sum by two until the result is odd. We give an algorithm for constructing "initially division-poor" sequences, where over an initial…

Number Theory · Mathematics 2017-10-04 Jeremy F. Alm , Taylor Herald , Ellen Rammelkamp Miller , Dave Sexton

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

Combinatorics · Mathematics 2014-07-01 Eric Balandraud , Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan.…

Combinatorics · Mathematics 2015-09-08 Michiel Kosters

Zero-sum problems for abelian groups and covers of the integers by residue classes, are two different active topics initiated by P. Erdos more than 40 years ago and investigated by many researchers separately since then. In an earlier…

Number Theory · Mathematics 2009-05-13 Zhi-Wei Sun

Generalising the Cameron--Erd\H{o}s conjecture to two dimensions, Elsholtz and Rackham conjectured that the number of sum-free subsets of $[n]^2$ is $2^{0.6n^2+O(n)}$. We prove their conjecture.

Combinatorics · Mathematics 2025-10-20 Anubhab Ghosal

In this short note we give a formula for the number of chains of subgroups of a finite elementary abelian $p$-group. This completes our previous work [5].

Group Theory · Mathematics 2016-04-19 Marius Tărnăuceanu

It is shown that if $\{H_n\}_{n \in \omega}$ is a sequence of groups without involutions, with $1 < |H_n| \leq 2^{\aleph_0}$, then the topologist's product modulo the finite words is (up to isomorphism) independent of the choice of…

Group Theory · Mathematics 2025-10-22 Samuel M. Corson

We determine the average number of distinct subsequences in a random binary string, and derive an estimate for the average number of distinct subsequences of a particular length.

Combinatorics · Mathematics 2013-10-29 Michael J. Collins

A tri-colored sum-free set in an abelian group $H$ is a collection of ordered triples in $H^3$, $\{(a_i,b_i,c_i)\}_{i=1}^m$, such that the equation $a_i+b_j+c_k=0$ holds if and only if $i=j=k$. Using a variant of the lemma introduced by…

Combinatorics · Mathematics 2016-05-27 Robert Kleinberg

The Davenport constant for a finite abelian group $G$ is the minimal length $\ell$ such that any sequence of $\ell$ terms from $G$ must contain a nontrivial zero-sum sequence. For the group $G=(\mathbb Z/n\mathbb Z)^2$, its value is $2n-1$,…

Number Theory · Mathematics 2021-07-23 David J. Grynkiewicz

The distribution of cardinalities of zero-sum sets in abelian groups is completely determined. A complex summation involving the M\"obius function is given for the general abelian group, while in many special cases, including the case of…

Combinatorics · Mathematics 2021-02-09 Minjia Shi , Denis S. Krotov , Xiaoxiao Li , Patrick Solé