Inverse expander mixing for hypergraphs (Q281623): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: We formulate and prove inverse mixing lemmas in the settings of simplicial complexes and \(k\)-uniform hypergraphs. In the hypergraph setting, we extend results of \textit{Y. Bilu} and \textit{N. Linial} [Combinatorica 26, No. 5, 495--519 (2006; Zbl 1121.05054)] for graphs. In the simplicial complex setting, our results answer a question of \textit{O. Parzanchevski} et al. [``Isoperimetric inequalities in simplicial complexes'', Preprint, \url{arXiv:1207.0638}]. | |||
| Property / review text: Summary: We formulate and prove inverse mixing lemmas in the settings of simplicial complexes and \(k\)-uniform hypergraphs. In the hypergraph setting, we extend results of \textit{Y. Bilu} and \textit{N. Linial} [Combinatorica 26, No. 5, 495--519 (2006; Zbl 1121.05054)] for graphs. In the simplicial complex setting, our results answer a question of \textit{O. Parzanchevski} et al. [``Isoperimetric inequalities in simplicial complexes'', Preprint, \url{arXiv:1207.0638}]. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C65 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C50 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05E45 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6579095 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
quasirandom hypergraphs | |||
| Property / zbMATH Keywords: quasirandom hypergraphs / rank | |||
Normal rank | |||
Revision as of 18:41, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverse expander mixing for hypergraphs |
scientific article |
Statements
Inverse expander mixing for hypergraphs (English)
0 references
11 May 2016
0 references
Summary: We formulate and prove inverse mixing lemmas in the settings of simplicial complexes and \(k\)-uniform hypergraphs. In the hypergraph setting, we extend results of \textit{Y. Bilu} and \textit{N. Linial} [Combinatorica 26, No. 5, 495--519 (2006; Zbl 1121.05054)] for graphs. In the simplicial complex setting, our results answer a question of \textit{O. Parzanchevski} et al. [``Isoperimetric inequalities in simplicial complexes'', Preprint, \url{arXiv:1207.0638}].
0 references
quasirandom hypergraphs
0 references
