English
Related papers

Related papers: Classifications of $\ell$-Zero-Sumfree Sets

200 papers

In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…

Symbolic Computation · Computer Science 2021-03-08 Xiaoliang Li , Wei Niu

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

Let $A$ be a finite, nonempty subset of an abelian group. We show that if every element of $A$ is a sum of two other elements, then $A$ has a nonempty zero-sum subset. That is, a (finite, nonempty) sum-full subset of an abelian group is not…

Number Theory · Mathematics 2021-05-20 Vsevolod F. Lev , Janos Nagy , Peter Pal Pach

Let $\mathscr{M}_{(2,1)}(N)$ be the infimum of the largest sum-free subset of any set of $N$ positive integers. An old conjecture in additive combinatorics asserts that there is a constant $c=c(2,1)$ and a function $\omega(N)\to\infty$ as…

Combinatorics · Mathematics 2021-01-12 Yifan Jing , Shukun Wu

For any $\ell > 0$, we present an algorithm which takes as input a semi-algebraic set, $S$, defined by $P_1 \leq 0,...,P_s \leq 0$, where each $P_i \in \R[X_1,...,X_k]$ has degree $\leq 2,$ and computes the top $\ell$ Betti numbers of $S$,…

Algebraic Geometry · Mathematics 2007-05-23 Saugata Basu

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

Combinatorics · Mathematics 2007-11-12 Robert P. Boyer , William M. Y. Goh

A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).

Number Theory · Mathematics 2007-05-23 Ben Green

A vector $(v_{1}, v_{2}, \cdots, v_{d})$ in $\mathbb{Z}_n^{d}$ is said to be a zero-sum-free $d$-tuple if there is no non-empty subset of its components whose sum is zero in $\mathbb{Z}_n$. We denote the cardinality of this collection by…

Number Theory · Mathematics 2022-01-06 Sunil K. Chebolu , Papa A. Sissokho

Let $\Delta$ be a simplicial complex on $[n]$. The $\mathcal{N}\mathcal{F}$-complex of $\Delta$ is the simplicial complex $\delta_{\mathcal{N}\mathcal{F}}(\Delta)$ on $[n]$ for which the facet ideal of $\Delta$ is equal to the…

Commutative Algebra · Mathematics 2020-05-05 Takayuki Hibi , Hasan Mahmood

We are interested in ordering the elements of a subset A of the non-zero integers modulo n in such a way that all the partial sums are distinct. We conjecture that this can always be done and we prove various partial results about this…

Combinatorics · Mathematics 2015-01-28 D. S. Archdeacon , J. H. Dinitz , A. Mattern , D. R. Stinson

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

General Mathematics · Mathematics 2007-07-10 Leopoldo Garavaglia , Mario Garavaglia

Let $M$ be a commutative cancellative monoid. The set $\Delta(M)$, which consists of all positive integers which are distances between consecutive factorization lengths of elements in $M$, is a widely studied object in the theory of…

Commutative Algebra · Mathematics 2016-09-12 Scott T. Chapman , Felix Gotti , Roberto Pelayo

This paper is a contribution to the study of the geometry of algebras related the Weyl groupoid initiated in \cite{M22}. The Nullstellensatz gives a bijection between radical ideals of such an algebra and their zero loci, the superalgebraic…

Representation Theory · Mathematics 2022-11-21 Ian M. Musson

Classification, up to isomorphism, of algebras from a non-empty subset of the variety of $n$- dimensional algebras is presented. It is shown that these algebras have only trivial automorphism and if the basic field is algebraically closed…

Rings and Algebras · Mathematics 2024-09-11 Ural Bekbaev

We introduce multi-colour partition algebras $P_{n,m}(\delta_0, ..., \delta_{m-1})$, which are generalization of both bubble algebras and partition algebras, then define the bubble algebra $T_{n,m}(\delta_0, ..., \delta_{m-1})$ as a…

Representation Theory · Mathematics 2017-01-26 Mufida Hmaida

A numerical semigroup $S$ is a cofinite, additively-closed subset of $\mathbb Z_{\ge 0}$ that contains 0, and a factorization of $x \in S$ is a $k$-tuple $z = (z_1, \ldots, z_k)$ where $x = z_1a_1 + \cdots + z_ka_k$ expresses $x$ as a sum…

Commutative Algebra · Mathematics 2025-03-18 Sogol Cyrusian , Alex Domat , Christopher O'Neill , Vadim Ponomarenko , Eric Ren , Mayla Ward

A finite subset $A$ of an abelian group $G$ is said to be zero-free if the identity element of $G$ cannot be written as a sum of distinct elements from $A$. In this article we study the structure of zero-free subsets of $Z/pZ$ the…

Number Theory · Mathematics 2009-01-26 Jean-Marc Deshouillers , Gyan Prakash

Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…

Logic · Mathematics 2015-10-06 Robert Lubarsky , Fred Richman

A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…

Combinatorics · Mathematics 2025-04-29 Chenying Lin , Gilles Zémor

An $s$-subset of codewords of a binary code $X$ is said to be an {\em $(s,\ell)$-bad} in $X$ if the code $X$ contains a subset of other $\ell$ codewords such that the conjunction of the $\ell$ codewords is covered by the disjunctive sum of…

Information Theory · Computer Science 2015-03-26 Arkadii D'yachkov , Ilya Vorobyev , Nikita Polyanskii , Vladislav Shchukin