Freiman homomorphisms on sparse random sets
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)
Abstract: A result of Fiz Pontiveros shows that if is a random subset of where each element is chosen independently with probability , then with high probability every Freiman homomorphism defined on can be extended to a Freiman homomorphism on the whole of . In this paper we improve the bound to , which is best possible up to the constant factor.
Recommendations
- Freiman homomorphisms of random subsets of Z_N
- Freiman's theorem in finite fields via extremal set theory
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- On the Freiman theorem in finite fields
- Polynomial configurations in subsets of random and pseudo-random sets
This page was built for publication: Freiman homomorphisms on sparse random sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2987024)