Counting configuration-free sets in groups
| Autor: | Lluís Vena, Juanjo Rué, Oriol Serra |
|---|---|
| Přispěvatelé: | Universitat Politècnica de Catalunya. Departament de Matemàtiques, Universitat Politècnica de Catalunya. MD - Matemàtica Discreta, Universitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions |
| Rok vydání: | 2017 |
| Předmět: |
Finite element method
Hypergraph Group (mathematics) 010102 general mathematics Elements finits Mètode dels 0102 computer and information sciences Matemàtiques i estadística::Anàlisi numèrica::Mètodes en elements finits [Àrees temàtiques de la UPC] 01 natural sciences Combinatorics 010201 computation theory & mathematics FOS: Mathematics Mathematics - Combinatorics Discrete Mathematics and Combinatorics Homomorphism Combinatorics (math.CO) 0101 mathematics Abelian group Joint (geology) Mathematics |
| Zdroj: | UPCommons. Portal del coneixement obert de la UPC Universitat Politècnica de Catalunya (UPC) Recercat. Dipósit de la Recerca de Catalunya instname |
| ISSN: | 0195-6698 |
| Popis: | We provide new examples of the asymptotic counting for the number of subsets on groups of given size which are free of certain configurations. These examples 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. As a consequence, random counterparts are presented as well. 31 pages |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect