Related papers: Spread Furstenberg Sets
We show that there exists $k \in \bbn$ and $0 < \e \in\bbr$ such that for every field $F$ of characteristic zero and for every $n \in \bbn$, there exists explicitly given linear transformations $T_1,..., T_k: F^n \to F^n$ satisfying the…
Given positive integers $k\leq d$ and a finite field $\mathbb{F}$, a set $S\subset\mathbb{F}^{d}$ is $(k,c)$-subspace evasive if every $k$-dimensional affine subspace contains at most $c$ elements of $S$. By a simple averaging argument, the…
Let $G$ be a finite group and $K$ a number field. We construct a $G$-extension $E/F$, with $F$ of transcendence degree $2$ over $K$, that specializes to all $G$-extensions of $K_\mathfrak{p}$, where $\mathfrak{p}$ runs over all but finitely…
The paper deals with the Feedback Vertex Set problem parameterized by the solution size. Given a graph $G$ and a parameter $k$, one has to decide if there is a set $S$ of at most $k$ vertices such that $G-S$ is acyclic. Assuming the…
Given a $k$-CNF formula and an integer $s$, we study algorithms that obtain $s$ solutions to the formula that are maximally dispersed. For $s=2$, the problem of computing the diameter of a $k$-CNF formula was initiated by Creszenzi and…
Grassmannian $\mathcal{G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $\mathbb{F}_q^n.$ Recently, Etzion and Zhang introduced a new notion called covering Grassmannian code which can be used in network coding…
We study multiplier theorems on a vector-valued function space, which is a generalization of the results of Calder\'on-Torchinsky and Grafakos-He-Honz\'ik-Nguyen, and an improvement of the result of Triebel. For $0<p<\infty$ and $0<q\leq…
A family of sets is said to be \emph{intersecting} if any two sets in the family have nonempty intersection. In 1973, Erd\H{o}s raised the problem of determining the maximum possible size of a union of $r$ different intersecting families of…
The Reifenberg theorem \cite{reif_orig} tells us that if a set $S\subseteq B_2\subseteq \mathbb R^n$ is uniformly close on all points and scales to a $k$-dimensional subspace, then $S$ is H\"older homeomorphic to a $k$-dimensional Euclidean…
We show any subset $A\subset\mathbb{N}$ with positive upper Banach density contains the pattern $\{m,m+[n\alpha],\dots,m+k[n\alpha]\}$, for some $m\in\mathbb{N}$ and $n=p-1$ for some prime $p$, where…
In this paper, we show that circular $(s,t)$-Furstenberg sets in $\mathbb R^2$ have Hausdorff dimension at least $$\max\{\frac{t}3+s,(2t+1)s-t\} \text{ for all $0<s,t\le 1$}.$$ This result extends the previous dimension estimates on…
Let $\mathcal{G}(d,n)$ be the Grassmannian manifold of $n$-dimensional subspaces of $\mathbb{R}^{d}$, and let $\pi_{V} \colon \mathbb{R}^{d} \to V$ be the orthogonal projection. We prove that if $\mu$ is a compactly supported Radon measure…
Furstenberg has associated to every topological group $G$ a universal boundary $\partial(G)$. If we consider in addition a subgroup $H<G$, the relative notion of $(G,H)$-boundaries admits again a maximal object $\partial(G,H)$. In the case…
For positive integers $n>k>t$ let $\binom{[n]}{k}$ denote the collection of all $k$-subsets of the standard $n$-element set $[n]=\{1,\ldots,n\}$. Subsets of $\binom{[n]}{k}$ are called $k$-graphs. A $k$-graph $\mathcal{F}$ is called…
For a permutation f of an n-dimensional vector space V over a finite field of order q we let k-affinity(f) denote the number of k-flats X of V such that f(X) is also a k-flat. By k-spectrum(n,q) we mean the set of integers k-affinity(f)…
We make quantitative improvements to recently obtained results on the structure of the image of a large difference set under certain quadratic forms and other homogeneous polynomials. Previous proofs used deep results of Benoist-Quint on…
Let $K \subset \mathbb{R}^{2}$ be a rotation and reflection free self-similar set satisfying the strong separation condition, with dimension $\dim K = s > 1$. Intersecting $K$ with translates of a fixed line, one can study the $(s -…
Let $K$ be an imaginary quadratic field and let $\mathcal{O}_K$ be the ring of algebraic integers of $K$. For $\alpha \in \mathcal{O}_K$ with $|\alpha| > 1$, define \[ \mathcal{D}_\alpha = \bigcup_{n=0}^\infty…
For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…
We study $t$-intersecting and $t$-cross-intersecting families of $k$-dimensional subspaces in finite vector spaces of dimension $n$. We show that all large $t$-intersecting families admit a governing low-dimensional structure for $n \ge…