Published September 27, 2021
| Published
Journal Article
Open
Random Multilinear Maps and the Erdős Box Problem
Chicago
An error occurred while generating the citation.
Abstract
By using random multilinear maps, we provide new lower bounds for the Erdős box problem, the problem of estimating the extremal number of the complete d-partite duniform hypergraph with two vertices in each part, thereby improving on work of Gunderson, Rödl and Sidorenko.
Additional Information
© 2021 D. Conlon, C. Pohoata, and D. Zakharov. Licensed under a Creative Commons Attribution License (CC-BY). Research supported by NSF Award DMS-2054452. Research supported by a grant of the Russian Government N 075-15-2019-1926.Attached Files
Published - 2011.09024.pdf
Files
2011.09024.pdf
Files
(237.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:482bdb65e48c35ad7a1183cfcc84c7f7
|
237.1 kB | Preview Download |
Additional details
- Eprint ID
- 111772
- Resolver ID
- CaltechAUTHORS:20211105-180659290
- NSF
- DMS-2054452
- Russian Foundation for Basic Research
- 075-15-2019-1926
- Created
-
2021-11-05Created from EPrint's datestamp field
- Updated
-
2021-11-05Created from EPrint's last_modified field