Abstract: We show that subsets of of large enough Hausdorff and Fourier dimension contain polynomial patterns of the form �egin{align*} ( x ,, x + A_1 y ,, dots,, x + A_{k-1} y ,, x + A_k y + Q(y) e_n ), quad x in mathbb{R}^n, y in mathbb{R}^m, end{align*} where are real matrices, is a real polynomial in variables and .
Recommendations
Cited in
(18)- Large sets avoiding patterns
- Two bipolynomial Roth theorems in \(\mathbb{R}\)
- Configuration sets with nonempty interior
- Patterns in thick compact sets
- A nonlinear version of Roth's theorem on sets of fractional dimensions
- Fourier dimension and avoidance of linear patterns
- Intersections of thick compact sets in \(\mathbb{R}^d\)
- The density of sets containing large similar copies of finite sets
- A class of random Cantor measures, with applications
- A polynomial Roth theorem on the real line
- Density theorems for anisotropic point configurations
- Rigidity, Graphs and Hausdorff Dimension
- Polynomial Roth Theorems on Sets of Fractional Dimensions
- Small sets containing any pattern
- A strong-type Furstenberg-Sárközy theorem for sets of positive measure
- On some properties of sparse sets: a survey
- Two-point polynomial patterns in subsets of positive density in \(\mathbb{R}^n\)
- Two-point patterns determined by curves
This page was built for publication: On polynomial configurations in fractal sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q530993)
