English
Related papers

Related papers: Zero-sum free sequences with small sum-set

200 papers

Let $G$ be a finite abeilian group. A sequence $S$ with terms from $G$ is zero-sum if the sum of terms in $S$ equals zero. It is a minimal zero-sum sequence if no proper, nontrivial subsequence is zero-sum. The maximal length of a minimal…

Number Theory · Mathematics 2008-01-25 Weidong Gao , Alfred Geroldinger , David J. Grynkiewicz

Let $\Bbbk$ be an arbitrary field and let $b > 1, n > 1$ and $a$ be three positive integers. In this paper we explicitly describe a minimal $S-$graded free resolution of the semigroup algebra $\Bbbk[S]$ when $S$ is a generalized repunit…

Commutative Algebra · Mathematics 2024-08-20 Isabel Colaço , Ignacio Ojeda

Let $G=(V(G),E(G))$ be a graph with set of vertices $V(G)$ and set of edges $E(G)$. A subset $S$ of $E(G)$ is called a $k$-nearly independent edge subsets if there are exactly $k$ pairs of elements of $S$ that share a common end. $Z_k(G)$…

Combinatorics · Mathematics 2024-05-28 Eric O. D. Andriantiana , Zekhaya B. Shozi

Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…

Optimization and Control · Mathematics 2015-05-13 Didier Henrion , Jean Bernard Lasserre , Carlo Savorgnan

Let $G$ be a finite abelian group. Let $g(G)$ be the smallest positive integer $t$ such that every subset of cardinality $t$ of the group $G$ contains a subset of cardinality $\mathrm{exp}(G)$ whose sum is zero. In this paper, we show that…

Number Theory · Mathematics 2020-05-26 Srilakshmi Krishnamoorthy , Karthikesh , Umesh Shankar

For $A\subseteq \mathbb Z_n$, the $A$-weighted Gao constant $E_A(n)$ is defined to be the smallest natural number $k$, such that any sequence of $k$ elements in $\mathbb Z_n$ has a subsequence of length $n$, whose $A$-weighted sum is zero.…

Number Theory · Mathematics 2022-04-18 Santanu Mondal , Krishnendu Paul , Shameek Paul

Let G=SL_n. Let K=Z/pZ, p a prime. Let A\subset G(K) generate G(K). Suppose that |A|<p^{n+1-\delta}, delta>0. Then |A A A|>>|A|^{1+\epsilon}, where epsilon>0 and the implied constant depend only on n and delta.

Group Theory · Mathematics 2010-09-13 Nick Gill , Harald Andres Helfgott

In this paper, we are interested in a generalization of the notion of sum-free sets. We address a conjecture first made in the 90s by Chung and Goldwasser. Recently, after some computer checks, this conjecture was formulated again by…

Combinatorics · Mathematics 2013-02-19 Alain Plagne , Anne de Roton

In this article, we study the zeros of the partial sums of the Dedekind zeta function of a cyclotomic field $K$ defined by the truncated Dirichlet series \[ \zeta_{K, X} (s) = \sum_{\|\mathfrak{a}\| \leq X} \frac{1}{\|\mathfrak{a}\|^{s}},…

Number Theory · Mathematics 2013-08-02 Andrew Ledoan , Arindam Roy , Alexandru Zaharescu

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

For a given number of $k$-sets, how should we choose them so as to minimize the union-closed family that they generate? Our main aim in this paper is to show that, if $\mathcal{A}$ is a family of $k$-sets of size $\binom{t}{k}$, and $t$ is…

Combinatorics · Mathematics 2023-09-06 Žarko Ranđelović

For every $\epsilon > 0$ and $k \in \mathbb{N}$, Haight constructed a set $A \subset \mathbb{Z}_N$ ($\mathbb{Z}_N$ stands for the integers modulo $N$) for a suitable $N$, such that $A-A = \mathbb{Z}_N$ and $|kA| < \epsilon N$. Recently,…

Combinatorics · Mathematics 2017-05-25 Luka Milicevic

Let $C_n$ be the cyclic group of order $n$ and set $s_{A}(C_n^r)$ as the smallest integer $\ell$ such that every sequence $\mathcal{S}$ in $C_n^r$ of length at least $\ell$ has an $A$-zero-sum subsequence of length equal to $\exp(C_n^r)$,…

Number Theory · Mathematics 2012-01-04 Hemar Godinho , Abílio Lemos , Diego Marques

This paper provides a complete solution to Skolem's problem for the $k$-generalized Lucas sequence $(L_n^{(k)})_{n \in \mathbb{Z}}$ with a primary focus on its behavior at negative indices. We characterize the zero-distribution of this…

Number Theory · Mathematics 2026-03-10 Monalisa Mohapatra , Pritam Kumar Bhoi , Gopal Krishna Panda

A sequence of points $z_k$ in the unit disk is said to be thin for a given decrease function $\rho$, if there is a nontrivial bounded holomorphic function such that the infinite series $\sum_k \rho(1-|z_k|)|f(z_k)|$ converges. All sequences…

Complex Variables · Mathematics 2007-05-23 Vladimir Ya. Eiderman , Pascal J. Thomas

A (d-parameter) basic nilsequence is a sequence of the form \psi(n)=f(a^{n}x), n \in Z^{d}, where x is a point of a compact nilmanifold X, a is a translation on X, and f is a continuous function on X; a nilsequence is a uniform limit of…

Dynamical Systems · Mathematics 2019-11-06 Alexander Leibman

The average properties of the well-known Subset Sum Problem can be studied by the means of its randomised version, where we are given a target value $z$, random variables $X_1, \ldots, X_n$, and an error parameter $\varepsilon > 0$, and we…

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…

Combinatorics · Mathematics 2026-05-27 Nathanaël Hassler , Andrew Treglown

In a pure C*-algebra (i.e., one having suitable regularity properties in its Cuntz semigroup), any element on which all bounded traces vanish is a sum of 7 commutators.

Operator Algebras · Mathematics 2015-04-02 Ping Wong Ng , Leonel Robert

The "Subset Sum problem" is a very well-known NP-complete problem. In this work, a top-k variation of the "Subset Sum problem" is considered. This problem has wide application in recommendation systems, where instead of k best objects the k…

Data Structures and Algorithms · Computer Science 2021-08-27 Biswajit Sanyal , Subhashis Majumder , Priya Ranjan Sinha Mahapatra