On the size of dissociated bases

MaRDI QIDQ540128zbMATH OpenFDO

Authors Vsevolod F. Lev, Raphael Yuster

Publication date 1 June 2011

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1005.0155, https://eudml.org/doc/223691, http://www.emis.de/journals/EJC/Volume_18/Abstracts/v18i1p117.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Additive bases, including sumsets (11B13)

Abstract: We prove that the sizes of the maximal dissociated subsets of a given finite subset of an abelian group differ by a logarithmic factor at most. On the other hand, we show that the set $$ possesses a dissociated subset of size $Ome(nlogn)$; since the standard basis of $$ is a maximal dissociated subset of ${0,1}^n$ of size $n$, the result just mentioned is essentially sharp.

Recommendations

• On the dimension of additive sets
• Additive dimension and a theorem of Sanders
• On sumsets of dissociated sets
• Bases in dihedral and Boolean groups
• Bounds on the number of maximal sum-free sets

Cited in

(1)

• On the dimension of additive sets

This page was built for publication: On the size of dissociated bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540128)