Counting configuration-free sets in groups
© 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 homomo...
| Autores: | , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2017 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/111650 |
| Acesso em linha: | https://hdl.handle.net/2117/111650 https://dx.doi.org/10.1016/j.ejc.2017.06.027 |
| Access Level: | acceso abierto |
| Palavra-chave: | Finite element method Elements finits, Mètode dels Àrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Mètodes en elements finits |
| Resumo: | © 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 configurations in sets of given density are presented as well. |
|---|