Related papers: The Dimension Spectrum Conjecture for Planar Lines
It is well-known that entire functions whose spectrum belongs to a fixed bounded set $S$ admit real uniformly discrete uniqueness sets $\Lambda$. We show that the same is true for much wider spaces of continuous functions. In particular,…
We prove the lossless unit interval Strichartz theorem on asymptotically conic surfaces, assuming that a large enough neighborhood of its trapped set has negative curvature. We also prove the spectral projection theorem on surfaces with…
Let $Q$ be a fundamental domain of some full-rank lattice in ${\Bbb R}^d$ and let $\mu$ and $\nu$ be two positive Borel measures on ${\Bbb R}^d$ such that the convolution $\mu\ast\nu$ is a multiple of $\chi_Q$. We consider the problem as to…
The local dimension spectrum provides a framework for quantifying the fractal properties of a measure, and it is well understood for non-overlapping self-similar measures. In this article, we study the local dimension spectrum for dominated…
One of the earliest results in enumerative combinatorial geometry is the following theorem of de Bruijn and Erd\H{o}s: Every set of points $E$ in a projective plane determines at least $|E|$ lines, unless all the points are contained in a…
We prove new bounds on the dimensions of distance sets and pinned distance sets of planar sets. Among other results, we show that if $A\subset\mathbb{R}^2$ is a Borel set of Hausdorff dimension $s>1$, then its distance set has Hausdorff…
In this paper, we determine the spectrum, the point spectrum, the continuous spectrum and the residual spectrum of the generalized difference operator $\Delta_{a,b}$ on the sequence space $\ell_p \ (1< p < \infty)$ where the real sequences…
The Erd\"os-S\'os conjecture states that if $G$ is a graph with average degree more than $k-1$, then G contains every tree of $k$ edges. A spider is a tree with at most one vertex of degree more than 2. In this paper, we prove that…
The Spectral Edges Conjecture is a well-known and widely believed conjecture in the theory of discrete periodic operators. It states that the extrema of the dispersion relation are isolated, non-degenerate, and occur in a single band. We…
We show that there exists an absolute positive constant $b (\geq \frac{1}{48})$ so that any set of $n$ points in $\mathbb{R}^d$ that is $d$-dimensional determines at least $bdn$ lines with pairwise distinct directions. As a consequence we…
In this paper, we examine an analogue of the recently solved spectrum conjecture by Fujita in the setting of Fine polyhedral adjunction theory. We present computational results for lower-dimensional polytopes, which lead to a complete…
Seymour conjectured that every oriented simple graph contains a vertex whose second neighborhood is at least as large as its first. In this note, we put forward a conjecture that we prove is actually equivalent: every oriented simple graph…
The Matrix Spencer Conjecture asks whether given $n$ symmetric matrices in $\mathbb{R}^{n \times n}$ with eigenvalues in $[-1,1]$ one can always find signs so that their signed sum has singular values bounded by $O(\sqrt{n})$. The standard…
In \cite{BCKM} it was shown that "Tiling implies Spectral" holds for a union of three intervals and the reverse implication was studied under certain restrictive hypotheses on the associated spectrum. In this paper, we reinvestigate the…
We consider chordal SLE(kappa) curves for kappa > 4, where the intersection of the curve with the boundary is a random fractal of almost sure Hausdorff dimension min {2-8/kappa,1}. We study the random sets of points at which the curve…
After a Hessian computation, we quickly prove the 3D simplex mean width conjecture using classical methods. Then, we generalize some components to $d$ dimensions.
A well-known theorem of de Bruijn and Erd\H{o}s states that any set of $n$ non-collinear points in the plane determines at least $n$ lines. Chen and Chv\'{a}tal asked whether an analogous statement holds within the framework of finite…
We consider a class of random graphs, called random brushes, which are constructed by adding linear graphs of random lengths to the vertices of Z^d viewed as a graph. We prove that for d=2 all random brushes have spectral dimension d_s=2.…
We show that every set $\mathcal{P}$ of $n$ non-collinear points in the plane contains a point incident to at least $\lceil\frac{n}{3}\rceil+1$ of the lines determined by $\mathcal{P}$.
We prove Conjecture 4.16 of the paper [EL21] of Elagin and Lunts; namely, that a smooth projective curve of genus at least 1 over a field has diagonal dimension 2.