相关论文: On the Structure of Sets with Few Three-Term Arith…

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

We say that a finite set S of points in R^d is in "strong general position" if for any collection {F_1,..., F_r} of r pairwise disjoint subsets of S (1 <= r <= |S|) we have: d-dim (the intersection of aff F_1,aff F_2,...,aff F_r) = min{d+1,…

In the present paper we prove a certain lemma about the structure of "lower level-sets of convolutions", which are sets of the form $\{x \in \Z_N : 1_A*1_A(x) \leq \gamma N\}$ or of the form $\{x \in \Z_N : 1_A*1_A(x) < \gamma N\}$, where…

We show that any subset of $\mathbb{Z}_p^n$ ($p$ an odd prime) without $3$-term arithmetic progression has size $O(p^{cn})$, where $c:=1-\frac{1}{18\log p}<1$. In particular, we find an upper bound of $O(2.84^n)$ on the maximum size of an…

Let $P$ be a set of $n$ points in the plane, and let $\mathcal C$ be a collection of $n$ simple $k$-intersecting curves, meaning that every two distinct curves of $\mathcal C$ meet in at most $k$ points. A classical theorem of Pach and…

We investigate how the behavior of the function d_A(n) that gives the size of a least size generating set for A^n, influences the structure of a finite solvable algebra A.

We estimate the frequency of polynomial iterations which falls in a given multiplicative subgroup of a finite field of $p$ elements. We also give a lower bound on the size of the subgroup which is multiplicatively generated by the first $N$…

We use techniques from the study of the Falconer distance conjecture to explore conditions which guarantee largeness (in terms of bounded $L^2$ density/Lebesgue measure and Hausdorff measure) of the set of lengths of step-sizes of…

Let $D$ be the ring of $S$-integers in a global field and $\hat{D}$ its profinite completion. We discuss the relation between density in $D$ and the Haar measure of $\hat{D}$: in particular, we ask when the density of a subset $X$ of $D$ is…

A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…

In this paper, we analyze the existence of algebraic and topological structures in the set of sequences that contain only a finite number of zero coordinates. Inspired by the work of Daniel Cariello and Juan B. Seoane-Sep\'ulveda, our…

In this paper we give a close-to-sharp answer to the basic questions: When is there a continuous way to add a point to a configuration of $n$ ordered points on a surface $S$ of finite type so that all the points are still distinct? When…

We explore how the asymptotic structure of a random $n$-term weak integer composition of $m$ evolves, as $m$ increases from zero. The primary focus is on establishing thresholds for the appearance and disappearance of substructures. These…

Let $N$ be a finite set, let $p \in (0,1)$, and let $N_p$ denote a random binomial subset of $N$ where every element of $N$ is taken to belong to the subset independently with probability $p$ . This defines a product measure $\mu_p$ on the…

A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}_q^n$ with the property that each $k$-dimensional subspace of $\mathbb{F}_q^n$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that…

We show that if A is a subset of {1,...,N} containing no non-trivial three-term arithmetic progressions then |A|=O(N/ log^{3/4-o(1)} N).

Suppose that $d \geq 2$, and that $A \subset [0,1]$ has sufficiently large dimension, $1 - \epsilon_d < \dim_H(A) < 1$. Then for any polynomial $P$ of degree $d$ with no constant term, there exists a point configuration $\{ x, x-t,x-P(t) \}…

We study density thresholds that force a measurable set $E\subseteq\mathbb{R}^d$ to contain all sufficiently large similar copies of every $n$-point configuration. We prove a lower bound of the form $1-O((\log n)/n)$, which matches the…

Given a family of $3$-graphs $\mathcal{F}$, the uniform Tur\'{a}n density $\pi_{\therefore}(\mathcal{F})$ is defined as the infimum $d\in[0,1]$ for which any sufficiently large uniformly $d$-dense $3$-graph - that is, a $3$-graph which has…

A convergence structure generalizing the order convergence structure on the set of Hausdorff continuous interval functions is defined on the set of minimal usco maps. The properties of the obtained convergence space are investigated and…