Related papers: On additive complement of a finite set
In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the…
We provide a simple proof for a complementary pair of group codes over a finite non-commutative Frobenius ring of the fact that one of them is equivalent to the other one. We also explore this fact for checkeable codes over the same type of…
When a proposition has no proof in an inference system, it is sometimes useful to build a counter-proof explaining, step by step, the reason of this non-provability. In general, this counter-proof is a (possibly) infinite co-inductive proof…
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…
Given two non-empty subsets $W,W'\subseteq G$ in an arbitrary abelian group $G$, $W'$ is said to be an additive complement to $W$ if $W + W'=G$ and it is minimal if no proper subset of $W'$ is a complement to $W$. The notion was introduced…
We let $\mathcal{F}$ be a finite family of sets closed under taking unions and $\emptyset \not \in \mathcal{F}$, and call an element abundant if it belongs to more than half of the sets of $\mathcal{F}$. In this notation, the classical…
Let $\mathbb{Q}$ denote the poset which adds a Cohen real then shoots a club through the complement of $\big( [\omega_2]^\omega \big)^V$ with countable conditions. We prove that the version of Strong Chang's Conjecture from \cite{MR2965421}…
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…
In what follows we generalize the notion of a complemented ring to rings that are not necessarily reduced. We then determine how our concepts fit in with other well-known classes of rings.
We show that any subset of the natural numbers with positive logarithmic Banach density contains a set that is within a factor of two of a geometric progression, improving the bound on a previous result of the authors. Density conditions on…
A set $\mathcal{A}$ is said to be an additive $h$-basis if each element in $\{0,1,\ldots,hn\}$ can be written as an $h$-sum of elements of $\mathcal{A}$ in {\it at least} one way. We seek multiple representations as $h$-sums, and, in this…
Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.
Many mathematical statements have the following form. If something is true for all finite subsets of an infinite set $I$, then it is true for all of $I$. This paper describes some old and new results on infinite sets of linear and…
The additivity with respect to exact sequences is notoriously a fundamental property of the algebraic entropy of group endomorphisms. It was proved for abelian groups by deeply exploiting their structure. On the other hand, a solvable…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…
Let $R$ be a commutative ring with identity. A unit $u$ of $R$ is called exceptional if $1-u$ is also a unit. When $R$ is a finite commutative ring, we determine the additive and multiplicative structures of its exceptional units; and then…
We consider questions related to the structure of infinite words (over an integer alphabet) with bounded additive complexity, i.e., words with the property that the number of distinct sums exhibited by factors of the same length is bounded…
Given $h,g \in \mathbb{N}$, we write a set $X \subset \mathbb{Z}$ to be a $B_{h}^{+}[g]$ set if for any $n \in \mathbb{Z}$, the number of solutions to the additive equation $n = x_1 + \dots + x_h$ with $x_1, \dots, x_h \in X$ is at most…
This paper is devoted to the structure of the complete asymptotic expansion of the probability that a large combinatorial object is irreducible or consists of a given number of irreducible parts, where irreducibility is understood in terms…