On the dimension of exceptional parameters for nonlinear projections, and the discretized Elekes-Rónyai theorem

OE Raz, J Zahl - Geometric and Functional Analysis, 2024 - Springer
We consider four related problems.(1) Obtaining dimension estimates for the set of
exceptional vantage points for the pinned Falconer distance problem.(2) Nonlinear …

An Elekes–Rónyai Theorem for Sets With Few Products

A Mudgal - International Mathematics Research Notices, 2024 - academic.oup.com
Given, we call a polynomial degenerate if there exist and monomials with fractional
exponents, such that. Our main result shows that whenever a polynomial, with degree, is …

Color isomorphic even cycles and a related Ramsey problem

G Ge, Y Jing, Z Xu, T Zhang - SIAM Journal on Discrete Mathematics, 2020 - SIAM
In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn
Repeated Patterns in Proper Colourings, preprint, https://arxiv. org/abs/2002.00921 (2020) …

Model-theoretic Elekes–Szabó for stable and o-minimal hypergraphs

A Chernikov, Y Peterzil… - Duke Mathematical Journal, 2024 - projecteuclid.org
A theorem of Elekes and Szabó recognizes algebraic groups among certain complex
algebraic varieties with maximal size intersections with finite grids. We establish a …

Two topics in arithmetic combinatorics

S Roy - 2023 - ideals.illinois.edu
This thesis-naturally delineated into two parts-attempts to address two flavors of problems in
arithmetic combinatorics. These two parts are based on the papers\cite {JRT} and\cite {BFR} …

Some arithmetic Ramsey problems and inverse theorems

Y Jing - 2021 - ideals.illinois.edu
In this dissertation we study arithmetic Ramsey type problems and inverse problems, in
various settings. This work consists of two parts. In Part I, we study arithmetic Ramsey type …

[PDF][PDF] Color isomorphic even cycles and a related Ramsey problem

Z Xua, T Zhangb, Y Jingc, G Gea - arXiv preprint arXiv …, 2020 - researchgate.net
In this paper, we first study a new extremal problem recently posed by Conlon and Tyomkyn
(arXiv: 2002.00921). Given a graph H and an integer k⩾ 2, let fk (n, H) be the smallest …