English
Related papers

Related papers: A note on a sumset in $\mathbb{Z}_{2k}$

200 papers

We show that if $A=\{a_1,a_2,..., a_k\}$ is a monotone increasing set of numbers, and the differences of the consecutive elements are all distinct, then $|A+B|\geq c|A|^{1/2}|B|$ for any finite set of numbers $B$. The bound is tight up to…

Combinatorics · Mathematics 2007-05-23 J. Solymosi

In this note we answer a question concerning lineability of the set of non-absolutely summing operators.

Functional Analysis · Mathematics 2009-05-19 G. Botelho , D. Diniz , D. Pellegrino , E. Teixeira

Motivated by questions asked by Erdos, we prove that any set $A\subset{\mathbb N}$ with positive upper density contains, for any $k\in{\mathbb N}$, a sumset $B_1+\cdots+B_k$, where $B_1,\dots,B_k\subset{\mathbb N}$ are infinite. Our proof…

Dynamical Systems · Mathematics 2024-02-23 Bryna Kra , Joel Moreira , Florian K. Richter , Donald Robertson

For infinitely many primes $p=4k+1$ we give a slightly improved upper bound for the maximal cardinality of a set $B\subset \ZZ_p$ such that the difference set $B-B$ contains only quadratic residues. Namely, instead of the "trivial" bound…

Combinatorics · Mathematics 2013-05-06 Christine Bachoc , Imre Z. Ruzsa , Mate Matolcsi

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

Data Structures and Algorithms · Computer Science 2024-02-06 Xi Chen , Shivam Nadimpalli , Tim Randolph , Rocco A. Servedio , Or Zamir

A partition is finitary if all its blocks are finite. For a cardinal $\mathfrak{a}$ and a natural number $n$, let $\mathrm{fin}(\mathfrak{a})$ and $\mathscr{B}_{n}(\mathfrak{a})$ be the cardinalities of the set of finite subsets and the set…

Logic · Mathematics 2024-11-12 Yifan Hu , Guozhen Shen

We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…

Combinatorics · Mathematics 2018-05-15 Alain Plagne , Salvatore Tringali

For a pair of positive integers $n,k$ with $n\geq 2$, in this paper we prove that $$ \sum_{r=1}^k\sum_{|\bf\alpha|=k}{k\choose\bf\alpha} \zeta(n\bf\alpha)=\zeta(n)^k =\sum^k_{r=1}\sum_{|\bf\alpha|=k}…

Number Theory · Mathematics 2017-06-15 Kwang-Wu Chen

This note gives two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular, while the second is a negative consistency result which applies to the situation of lambda…

Logic · Mathematics 2009-09-25 Mirna Džamonja , Saharon Shelah

We generalize the notion of Davenport constants to a `higher degree' and obtain various lower and upper bounds, which are sometimes exact as is the case for certain finite commutative rings of prime power cardinality. Two simple examples…

Combinatorics · Mathematics 2022-02-15 Yair Caro , Benjamin Girard , John R. Schmitt

We establish a connection between a function and a series representation using a similar technique with that that Euler used to solve the Basel problem. Our result concerns a more general series from which one can obtain $\zeta(2k)$ as a…

Number Theory · Mathematics 2017-12-07 Marius Costandin

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

Logic · Mathematics 2026-04-09 Hrafn Valtýr Oddsson

Let A be a finite subset of a commutative additive group Z. The sumset and difference set of A are defined as the sets of pairwise sums and differences of elements of A, respectively. The well-known inequality $\sigma(A)^{1/2} \leq…

Combinatorics · Mathematics 2015-10-20 Merlijn Staps

The summation formula $$ \sum^{n-1}_{i=0}\epsilon^i i! (i^k+u_k) = v_k+\epsilon^{n-1} n! A_{k-1}(n) $$ $(\epsilon=\pm 1; k=1,2,...; u_k, v_k\in \msbm\hbox{Z}; A_{k-1}$ is a polynomial) is derived and its various aspects are considered. In…

Number Theory · Mathematics 2007-05-23 Branko Dragovich

Let $G$ be a finite, non-trivial abelian group of exponent $m$, and suppose that $B_1, ..., B_k$ are generating subsets of $G$. We prove that if $k>2m \ln \log_2 |G|$, then the multiset union $B_1\cup...\cup B_k$ forms an additive basis of…

Number Theory · Mathematics 2008-12-16 Vsevolod F. Lev , Mikhail E. Muzychuk , Rom Pinchasi

We prove congruences, modulo a power of a prime p, for certain finite sums involving central binomial coefficients $\binom{2k}{k}$.

Number Theory · Mathematics 2013-10-09 Sandro Mattarei , Roberto Tauraso

Given $A$ a set of $N$ positive integers, an old question in additive combinatorics asks that whether $A$ contains a sum-free subset of size at least $N/3+\omega(N)$ for some increasing unbounded function $\omega$. The question is generally…

Combinatorics · Mathematics 2024-02-21 Yifan Jing , Shukun Wu

For a cardinal $\mathfrak{a}$, let $\mathrm{fin}(\mathfrak{a})$ be the cardinality of the set of all finite subsets of a set which is of cardinality $\mathfrak{a}$. It is proved without the aid of the axiom of choice that for all infinite…

Logic · Mathematics 2021-11-02 Guozhen Shen

Let $A\subset [1, 2]$ be a $(\delta, \sigma)$-set with measure $|A|=\delta^{1-\sigma}$ in the sense of Katz and Tao. For $\sigma\in (1/2, 1)$ we show that $$ |A+A|+|AA|\gtrapprox \delta^{-c}|A|, $$ for…

Combinatorics · Mathematics 2020-02-26 Changhao Chen

For integer $k \geq 1$, let $S_k(n)$ denote the sum of the $k$th powers of the first $n$ positive integers. In this paper, we derive a new formula expressing $2^{2k}$ times $S_{2k}(n)$ as a sum of $k$ terms involving the numbers in the…

General Mathematics · Mathematics 2025-01-27 José L. Cereceda
‹ Prev 1 3 4 5 6 7 10 Next ›