中文
相关论文

相关论文: Problems in additive number theory, VI: Sizes of s…

200 篇论文

We study extremal problems about sets of integers that do not contain sumsets with summands of prescribed size. We analyse both finite sets and infinite sequences. We also study the connections of these problems with extremal problems of…

数论 · 数学 2015-04-02 Javier Cilleruelo , Rafael Tesoro

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

组合数学 · 数学 2016-11-08 David Cushing , G. W. Stagg

In this paper we discuss large cardinals and compactness theorems in abelian group theory. More specifically, we generalize two classical compactness results for free abelian groups to the broader context of direct sums of cyclic groups.

逻辑 · 数学 2025-08-26 Filippo Calderoni , Ava Ostrem

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

组合数学 · 数学 2008-12-04 Zhi-Wei Sun

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

表示论 · 数学 2026-02-02 Henning Krause , Balduin Stoye

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

组合数学 · 数学 2013-05-15 Amela Muratovic-Ribic , Qiang Wang

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

环与代数 · 数学 2026-02-24 Vesselin Drensky

We extend Freiman's inequality on the cardinality of the sumset of a $d$ dimensional set. We consider different sets related by an inclusion of their convex hull, and one of them added possibly several times.

组合数学 · 数学 2008-10-09 Mate Matolcsi , Imre Z. Ruzsa

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.

数论 · 数学 2016-12-15 Eknath Ghate , T. N. Venkataramana

Let $h$ be a positive integer and $A, B_1, B_2,\dots, B_h$ be finite sets in a commutative group. We bound $|A+B_1+...+B_h|$ from above in terms of $|A|, |A+B_1|,\dots,|A+B_h|$ and $h$. Extremal examples, which demonstrate that the bound is…

组合数学 · 数学 2017-02-20 Brendan Murphy , Eyvindur Ari Palsson , Giorgis Petridis

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…

组合数学 · 数学 2026-05-27 Nathanaël Hassler , Andrew Treglown

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

数论 · 数学 2015-06-16 Kevin O'Bryant

An MSTD set is a finite set of integers with more sums than differences. It is proved that, for infinitely many positive integers $k$, there are infinitely many affinely inequivalent MSTD sets of cardinality $k$. There are several related…

数论 · 数学 2021-01-06 Melvyn B. Nathanson

The study of sums of finite sets of integers has mostly concentrated on sets with small sumsets (Freiman's theorem and related work) and on sets with large sumsets (Sidon sets and $B_h$-sets). This paper considers the sets ${\mathcal…

数论 · 数学 2026-04-07 Melvyn B. Nathanson

We consider two problems regarding some divisibility properties of the subset sums of a set $A\subseteq \{1, 2, \ldots ,n\}$. At the beginning, we study the cardinality of $A$ which has the following property: For every $d\le n$ there is a…

综合数学 · 数学 2019-11-26 Konstantinos Gaitanas

Let $A$ be a nonempty finite subset of an additive abelian group $G$. Define $A + A := \{a + b : a, b \in A\}$ and $A \dotplus A := \{a + b : a, b \in A~\text{and}~ a \neq b\}$. The set $A$ is called a {\em sum-dominant (SD) set} if $|A +…

数论 · 数学 2017-12-27 Raj Kumar Mistri , R. Thangadurai

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…

组合数学 · 数学 2021-02-09 Minjia Shi , Denis S. Krotov , Xiaoxiao Li , Patrick Solé

The sumset is one of the most basic and central objects in additive number theory. Many of the most important problems (such as Goldbach's conjecture and Fermat's Last theorem) can be formulated in terms of the sumset $S + S = \{x+y :…

数论 · 数学 2014-01-21 Steven J. Miller , Kevin Vissuet

Motivated by the minimal tower problem, an earlier work studied diagonalizations of covers where the covers are related to linear quasiorders (tau-covers). We deal with two types of combinatorial questions which arise from this study. 1.…

逻辑 · 数学 2010-11-02 Saharon Shelah , Boaz Tsaban

Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

组合数学 · 数学 2016-09-07 Zhi-Wei Sun