Page 1 Next

Displaying 1 – 20 of 22

Showing per page

Factoring an odd abelian group by lacunary cyclic subsets

Sándor Szabó (2010)

Discussiones Mathematicae - General Algebra and Applications

It is a known result that if a finite abelian group of odd order is a direct product of lacunary cyclic subsets, then at least one of the factors must be a subgroup. The paper gives an elementary proof that does not rely on characters.

Fourier analysis, linear programming, and densities of distance avoiding sets in n

Fernando Mário de Oliveira Filho, Frank Vallentin (2010)

Journal of the European Mathematical Society

We derive new upper bounds for the densities of measurable sets in n which avoid a finite set of prescribed distances. The new bounds come from the solution of a linear programming problem. We apply this method to obtain new upper bounds for measurable sets which avoid the unit distance in dimensions 2 , , 24 . This gives new lower bounds for the measurable chromatic number in dimensions 3 , , 24 . We apply it to get a short proof of a variant of a recent result of Bukh which in turn generalizes theorems of Furstenberg,...

Currently displaying 1 – 20 of 22

Page 1 Next