Related papers: On the Pinned Distances Problem in Positive Charac…

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

A conjecture of Graham (repeated by Erd\H{o}s) asserts that for any set $A \subseteq \mathbb{F}_p \setminus \{0\}$, there is an ordering $a_1, \ldots, a_{|A|}$ of the elements of $A$ such that the partial sums $a_1, a_1+a_2, \ldots,…

Let $F$ be a Bedford-McMullen carpet defined by independent integer exponents. We prove that for every line $\ell \subseteq \mathbb{R}^2$ not parallel to the major axes, $$ \dim_H (\ell \cap F) \leq \max \left\lbrace 0,\, \frac{\dim_H…

We introduce a weak asymptotic version of nonlinear contraction, termed \emph{asymptotic pointwise contraction}. For a mapping on a metric space, this notion requires the existence of a sequence of functions that dominate the distances…

We generalize known results on transport equations associated to a Lipschitz field $\mathbf{F}$ on some subspace of $\mathbb{R}^N$ endowed with some general space measure $\mu$. We provide a new definition of both the transport operator and…

We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C is fixed-parameter…

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

We discuss asymptotics for large random planar maps under the assumption that the distribution of the degree of a typical face is in the domain of attraction of a stable distribution with index $\alpha\in(1,2)$. When the number $n$ of…

We determine the tree which maximizes the distance between characteristic set and subtree core over all trees on $n$ vertices. The asymptotic nature of this distance is also discussed. The problem of extremizing the distance between…

The distance on a set is a comparative function. The smaller the distance between two elements of that set, the closer, or more similar, those elements are. Fr\'echet axiomatized the distance into what is today known as a metric. In this…

We asymptotically determine the size of the largest family F of subsets of {1,...,n} not containing a given poset P if the Hasse diagram of P is a tree. This is a qualitative generalization of several known results including Sperner's…

Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. In a recent paper Rudnick established asymptotic upper bounds for the minimal gaps of $\{a_n \alpha \bmod 1, 1 \leq n \leq N\}$ as $N \to \infty$, valid for Lebesgue-almost…

Dvorak (2013) gave a bound on the minimum size of a distance r dominating set in the terms of the maximum size of a distance 2r independent set and generalized coloring numbers, thus obtaining a constant factor approximation algorithm for…

In this paper we prove the existence of at least one positive solution for the nonlocal semipositone problem \[ \displaystyle \left\{\begin{array}{rcll} (-\Delta)_p^s(u) &=& \lambda f(u) \qquad & \text{in} \ \ \Omega \\u &=& 0 & \text{in} \…

Let $p_{\min}$ denote the minimum of a polynomial $p$ over a (general) compact semialgebraic set $S \subseteq \mathbb{R}^n$. A standard way to approximate $p_{\min}$ is via hierarchies built from Positivstellens\"atze, which certify…

Let $P$ be a positive rational number. Call a function $f:\mathbb{R}\rightarrow\mathbb{R}$ to have $\textit{finite gaps property mod}$ $P$ if the following holds: for any positive irrational $\alpha$ and positive integer $M$, when the…

Given sets $\mathcal{P}, \mathcal{Q} \subseteq \mathbb{R}^2$ of sizes $m$ and $n$ respectively, we are interested in the number of distinct distances spanned by $\mathcal{P} \times \mathcal{Q}$. Let $D(m, n)$ denote the minimum number of…

For a compact set $E\subset\mathbb{R}^d$, $d\geq 2$, consider the pinned distance set $\Delta^{y}(E)=\lbrace |x-y| : x\in E\rbrace$. Peres and Schlag showed that if the Hausdorff dimension of $E$ is bigger than $\frac{d+2}{2}$ with $d\geq…

Let P_1 and P_2 be two sets of points in the plane, so that P_1 is contained in a line L_1, P_2 is contained in a line L_2, and L_1 and L_2 are neither parallel nor orthogonal. Then the number of distinct distances determined by the pairs…

This paper shows global uniqueness in two inverse problems for a fractional conductivity equation: an unknown conductivity in a bounded domain is uniquely determined by measurements of solutions taken in arbitrary open, possibly disjoint…