Page 1

Displaying 1 – 19 of 19

Showing per page

Parallelepipeds, nilpotent groups and Gowers norms

Bernard Host, Bryna Kra (2008)

Bulletin de la Société Mathématique de France

In his proof of Szemerédi’s Theorem, Gowers introduced certain norms that are defined on a parallelepiped structure. A natural question is on which sets a parallelepiped structure (and thus a Gowers norm) can be defined. We focus on dimensions 2 and 3 and show when this possible, and describe a correspondence between the parallelepiped structures and nilpotent groups.

Polynomial growth of sumsets in abelian semigroups

Melvyn B. Nathanson, Imre Z. Ruzsa (2002)

Journal de théorie des nombres de Bordeaux

Let S be an abelian semigroup, and A a finite subset of S . The sumset h A consists of all sums of h elements of A , with repetitions allowed. Let | h A | denote the cardinality of h A . Elementary lattice point arguments are used to prove that an arbitrary abelian semigroup has polynomial growth, that is, there exists a polynomial p ( t ) such that | h A | = p ( h ) for all sufficiently large h . Lattice point counting is also used to prove that sumsets of the form h 1 A 1 + + h r A r have multivariate polynomial growth.

Polynomial points.

Cornelius, E.F. jun., Schultz, Phill (2007)

Journal of Integer Sequences [electronic only]

Preservation of log-concavity on summation

Oliver Johnson, Christina Goldschmidt (2006)

ESAIM: Probability and Statistics

We extend Hoggar's theorem that the sum of two independent discrete-valued log-concave random variables is itself log-concave. We introduce conditions under which the result still holds for dependent variables. We argue that these conditions are natural by giving some applications. Firstly, we use our main theorem to give simple proofs of the log-concavity of the Stirling numbers of the second kind and of the Eulerian numbers. Secondly, we prove results concerning the log-concavity of the sum of...

Probabilistic construction of small strongly sum-free sets via large Sidon sets

Andreas Schoen, Tomasz Srivastav, Anand Baltz (2000)

Colloquium Mathematicae

We give simple randomized algorithms leading to new upper bounds for combinatorial problems of Choi and Erdős: For an arbitrary additive group G let P n ( G ) denote the set of all subsets S of G with n elements having the property that 0 is not in S+S. Call a subset A of G admissible with respect to a set S from P n ( G ) if the sum of each pair of distinct elements of A lies outside S. Suppose first that S is a subset of the positive integers in the interval [2n,4n). Denote by f(S) the number of elements in a...

Problems in additive number theory, II: Linear forms and complementing sets

Melvyn B. Nathanson (2009)

Journal de Théorie des Nombres de Bordeaux

Let ϕ ( x 1 , ... , x h , y ) = u 1 x 1 + + u h x h + v y be a linear form with nonzero integer coefficients u 1 , ... , u h , v . Let 𝒜 = ( A 1 , ... , A h ) be an h -tuple of finite sets of integers and let B be an infinite set of integers. Define the representation function associated to the form ϕ and the sets 𝒜 and B as follows : R 𝒜 , B ( ϕ ) ( n ) = card { ( a 1 , ... , a h , b ) A 1 × × A h × B : ϕ ( a 1 , ... , a h , b ) = n } . If this representation function is constant, then the set B is periodic and the period of B will be bounded in terms of the diameter of the finite set { ϕ ( a 1 , ... , a h , 0 ) : ( a 1 , ... , a h ) A 1 × × A h } . Other results for complementing sets with respect to linear forms are also proved.

Product decompositions of quasirandom groups and a Jordan type theorem

Nikolay Nikolov, László Pyber (2011)

Journal of the European Mathematical Society

We first note that a result of Gowers on product-free sets in groups has an unexpected consequence: If k is the minimal degree of a representation of the finite group G , then for every subset B of G with | B | > | G | / k 1 / 3 we have B 3 = G . We use this to obtain improved versions of recent deep theorems of Helfgott and of Shalev concerning product decompositions of finite simple groups, with much simpler proofs. On the other hand, we prove a version of Jordan’s theorem which implies that if k 2 , then G has a proper subgroup...

Currently displaying 1 – 19 of 19

Page 1