Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Counting configuration-free sets in groups

Autor
Rue, J.; Serra, O.; Vena , L.
Tipus d'activitat
Article en revista
Revista
European journal of combinatorics
Data de publicació
2017-01-01
Volum
66
Pàgina inicial
281
Pàgina final
307
DOI
https://doi.org/10.1016/j.ejc.2017.06.027 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/111650 Obrir en finestra nova
https://arxiv.org/abs/1602.01992 Obrir en finestra nova
URL
http://www.sciencedirect.com/science/article/pii/S0195669817301026?via%3Dihub Obrir en finestra nova
Resum
© 2017 Elsevier Ltd. We provide asymptotic counting for the number of subsets of given size which are free of certain configurations in finite groups. Applications include sets without solutions to equations in non-abelian groups, and linear configurations in abelian groups defined from group homomorphisms. The results are obtained by combining the methodology of hypergraph containers joint with arithmetic removal lemmas. Random sparse versions and threshold probabilities for existence of confi...
Citació
Rue, J., Serra, O., Vena , L. Counting configuration-free sets in groups. "European journal of combinatorics", 1 Gener 2017, vol. 66, p. 281-307.
Grup de recerca
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants