New discretised polynomial expander and incidence estimates

Abstract We present two applications of recent developments in incidence geometry. One is a ‐discretised version of a particular ‘Elekes–Rónyai’ expander problem. The second is an incidence estimate addressing the scenario in which both tubes, squares and their shadings satisfy non‐concentration assumptions.

Authors

Institutions

Publication Details

Journal
Bulletin of the London Mathematical Society
Published
2026-09-21
DOI
https://doi.org/10.1112/blms.70504
Primary Topic
Point processes and geometric inequalities
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

New discretised polynomial expander and incidence estimates

Ciprian Demeter, William O'Regan
Bulletin of the London Mathematical Society
Point processes and geometric inequalities
article

New discretised polynomial expander and incidence estimates

Ciprian Demeter, William O'Regan
article en

Abstract

Abstract We present two applications of recent developments in incidence geometry. One is a ‐discretised version of a particular ‘Elekes–Rónyai’ expander problem. The second is an incidence estimate addressing the scenario in which both tubes, squares and their shadings satisfy non‐concentration assumptions.

Bulletin of the London Mathematical SocietyVol. 58(10)
University of British Columbia (CA), Indiana University Bloomington (US)
National Science Foundation, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 93%
Point processes and geometric inequalities
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.