Related papers: Bounds for the local properties problem for differ…

A vertex set $S$ is a generalized $k$-independent set if the induced subgraph $G[S]$ contains no tree on $k$ vertices. The generalized $k$-independence number $\alpha_k(G)$ is the maximum size of such a set. For a tree $T$ with $n$…

We prove a local limit theorem the number of $r$-cliques in $G(n,p)$ for $p\in(0,1)$ and $r\ge 3$ fixed constants. Our bounds hold in both the $\ell^\infty$ and $\ell^1$ metric. The main work of the paper is an estimate for the…

In this paper, we study local regularity properties of minimizers of nonlocal variational functionals with variable exponents and weak solutions to the corresponding Euler--Lagrange equations. We show that weak solutions are locally bounded…

Let $\Omega\subset\BBR^N$ be a bounded $C^2$ domain and $\CL_\gk=-\Gd-\frac{\gk}{d^2}$ the Hardy operator where $d=\dist (.,\prt\Gw)$ and $0<\gk\leq\frac{1}{4}$. Let $\ga_{\pm}=1\pm\sqrt{1-4\gk}$ be the two Hardy exponents, $\gl_\gk$ the…

The main interest of this article is the one-sided boundedness of the local discrepancy of $\alpha\in\mathbb{R}\setminus\mathbb{Q}$ on the interval $(0,c)\subset(0,1)$ defined by \[D_n(\alpha,c)=\sum_{j=1}^n 1_{\{\{j\alpha\}<c\}}-cn.\] We…

We prove a tight and close-to-optimal lower bound on the effectiveness of local quantum measurements (without classical communication) at discriminating any two bipartite quantum states. Our result implies, for example, that any two…

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…

To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let $\mathcal{G}(g,c,n)$ be the set of graphs $G$ with girth $g(G)=g$, circumference…

We study testing of local properties in one-dimensional and multi-dimensional arrays. A property of $d$-dimensional arrays $f:[n]^d \to \Sigma$ is $k$-local if it can be defined by a family of $k \times \ldots \times k$ forbidden…

Given positive integers $k$ and $\ell$ we write $G \rightarrow (K_k,K_\ell)$ if every 2-colouring of the edges of $G$ yields a red copy of $K_k$ or a blue copy of $K_\ell$ and we denote by $R(k)$ the minimum $n$ such that $K_n\rightarrow…

Let $K$ be a number field. In the terminology of Nagell a unit $\varepsilon$ of $K$ is called {\it exceptional} if $1-\varepsilon$ is also a unit. The existence of such a unit is equivalent to the fact that the unit equation…

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\epsilon}$ in the case when the power law exponent satisfies $\beta <1$. In the case…

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers $m$ and $n$, the minimum size $g_n(m)$ of the edge boundary of an $m$-element subset of $\{0,1\}^{n}$; the extremal families (up to automorphisms of…

The isolation number of a graph $G$ (also called the vertex-edge domination number of $G$), denoted by $\iota(G)$, is the size of a smallest subset $D$ of the vertex set $V(G)$ of $G$ such that $G-N[D]$ (the graph obtained by deleting the…

We establish a general principle that any lower bound on the non-vanishing of central $L$-values obtained through studying the one-level density of low-lying zeros can be refined to show that most such $L$-values have the typical size…

Bounds on the smallest eigenvalue of the neural tangent kernel (NTK) are a key ingredient in the analysis of neural network optimization and memorization. However, existing results require distributional assumptions on the data and are…

We solve a class of isoperimetric problems on $\mathbb{R}^N $ with respect to weights that are powers of the distance to the origin. For instance we show that if $k\in [0,1]$, then among all smooth sets $\Omega$ in $\mathbb{R} ^N$ with…