Combinatorial problems in finite fields and Sidon sets

From MaRDI portal
Publication:2250821

DOI10.1007/s00493-012-2819-4zbMath1291.11025arXiv1003.3576OpenAlexW2139243377MaRDI QIDQ2250821

Javier Cilleruelo

Publication date: 21 July 2014

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.3576




Related Items

Conditional expanding bounds for two-variable functions over finite valuation ringsSaving the logarithmic factor in the error term estimates of some congruence problemsOn the congruence \(x_1 x_2 \equiv x_3 x_4 \mod q\)Finding solutions with distinct variables to systems of linear equations over \(\mathbb{F}_p\)An Upper Bound on the Size of Sidon SetsElementary methods for incidence problems in finite fieldsMulti-orbit cyclic subspace codes and linear setsImproved incidence bounds over arbitrary finite fields via the VC-dimension theoryThe apparent structure of dense Sidon setsOn two-variable expanders over finite ringsSome remarks on multilinear exponential sums with an applicationErgodic theorem involving additive and multiplicative groups of a field and patternsIncidences between planes over finite fieldsUpper bounds and constructions of complete asynchronous channel hopping systemsSolving linear equations in a vector space over a finite fieldA Szemerédi-Trotter type theorem, sum-product estimates in finite quasifields, and related resultsSome combinatorial number theory problems over finite valuation ringsFourier analysis and expanding phenomena in finite fieldsIncidences between points and generalized spheres over finite fields and related problemsThe coset and stability ringsPolytopes of large rank for \(\mathrm{PSL}(4,\mathbb{F}_q)\)Monochromatic sum and product in \(\mathbb{Z} / m \mathbb{Z}\)Orthogonal Polarity Graphs and Sidon SetsAn additive problem in finite fields with powers of elements of large multiplicative orderMonochromatic sums and productsIncidence Bounds for Block DesignsSidon basis in polynomial rings over finite fieldsSidon sets and 2-caps in \(\mathbb{F}_3^n\)On the chromatic number of the Erdős-Rényi orthogonal polarity graphA study of the separating property in Reed-Solomon codes by bounding the minimum distance



Cites Work


This page was built for publication: Combinatorial problems in finite fields and Sidon sets