EuDML | Browse

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Subjects
11-XX Number theory
11Bxx Sequences and sets
11B13 Additive bases, including sumsets

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 9

Displaying 161 – 179 of 179

The class of Erdős-Turán sets

G. Grekos, L. Haddad, C. Helou, J. Pihko (2005)

Acta Arithmetica

The Erdős-Heilbronn problem for finite groups

Paul Balister, Jeffrey Paul Wheeler (2009)

Acta Arithmetica

The Erdős-Turán property for a class of bases

Jaroslav Nešetřil, Oriol Serra (2004)

Acta Arithmetica

The inverse problem for representation functions for general linear forms.

Hegarty, Peter (2008)

Integers

The minimal range of additive h-bases.

Torleiv Klove (1983)

Mathematica Scandinavica

The postage stamp problem and arithmetic in base $r$

Amitabha Tripathi (2008)

Czechoslovak Mathematical Journal

Let $h, k$ be fixed positive integers, and let $A$ be any set of positive integers. Let $h A : = {a_{1} + a_{2} + \dots + a_{r} : a_{i} \in A, r \leq h}$ denote the set of all integers representable as a sum of no more than $h$ elements of $A$ , and let $n (h, A)$ denote the largest integer $n$ such that ${1, 2, ..., n} \subseteq h A$ . Let $n (h, k) : = {max}_{A} : n (h, A)$ , where the maximum is taken over all sets $A$ with $k$ elements. We determine $n (h, A)$ when the elements of $A$ are in geometric progression. In particular, this results in the evaluation of $n (h, 2)$ and yields surprisingly sharp lower bounds for $n (h, k)$ , particularly for $k = 3$ .

The prime power conjecture is true for $n < 2, 000, 000$ .

Gordon, Daniel M. (1994)

The Electronic Journal of Combinatorics [electronic only]

The structure of maximal zero-sum free sequences

Gautami Bhowmik, Immanuel Halupczok, Jan-Christoph Schlage-Puchta (2010)

Acta Arithmetica

Théorie additive des nombres. Densité de Schnirelman

François Dress (1967/1968)

Séminaire Delange-Pisot-Poitou. Théorie des nombres

Two remarks on linear forms in non-negative integers.

Öystein J. Rödseth (1982)

Mathematica Scandinavica

Über eine Vermutung von Choi, Erdös und Nathanson

Joachim Zöllner (1985)

Acta Arithmetica

Une propriété arithmétique des bases additives. Un critère de non-base

François Hennecart (2003)

Acta Arithmetica

Uniformly thin bases of order two

Christoph Schmitt (2006)

Acta Arithmetica

Unique difference bases of $ℤ$ .

Tang, Chi-Wu, Tang, Min, Wu, Lei (2011)

Journal of Integer Sequences [electronic only]

Unique representation bases for the integers

Melvyn B. Nathanson (2003)

Acta Arithmetica

Verzichtbare und unverzichtbare Elemente bei der Darstellung als Summe und als Differenz von Quadraten

Erhard Deinert, Erich Härtter, Joachim Zöllner (1985)

Acta Arithmetica

Zu einer Vermutung von Rohrbach.

Gerd Hofmeister, Norbert Hämmerer (1976)

Journal für die reine und angewandte Mathematik

О представлении чисел $1, 2, \dots, N$ посредством разностей

Л. Редеи, А. Реньи (1949)

Matematiceskij sbornik

Правильные множества по заданному модулю

Anatoliĭ Alekseevich Karatsuba (1998)

Acta Mathematica et Informatica Universitatis Ostraviensis

Currently displaying 161 – 179 of 179

Previous Page 9