Semiclassical resolvent bounds for compactly supported radial potentials

We employ separation of variables to prove weighted resolvent estimates for the semiclassical Schrödinger operator $?h^2\mathrm{\Delta }+V(|x|)?E$ in dimension $n\ge 2$, where $h,E>0$, and $V:[0,\infty )\to \mathbb{R}$ is $L^{\infty }$ and compactly supported. The weighted resolvent norm grows no faster than $\exp ?(C{h}^{?1})$, while an exterior weighted norm grows $～h^{?1}$. We introduce a new method based on the Mellin transform to handle the two-dimensional case.     

A note on the distribution of weights of fixed-rank matrices over the binary field

Let M be a random $m\times n$ rank-r matrix over the binary field ${\mathbb{F}}_2$, and let $\mathrm{wt}(\mathbf{M})$ be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as $m,n\to +\infty$ with r fixed and $m/n$ tending to a constant, we have that$\frac{\mathrm{wt}(\mathbf{M})-\frac{1-2^{-r}}{2}mn}{\sqrt{\frac{2^{-r}(1-2^{-r})}{4}(m+n)mn}}$ converges in distribution to a standard normal random variable.     

On discrete Brunn-Minkowski and isoperimetric type inequalities

We show that the lattice point enumerator ${\mathrm{G}}_n(?)$ satisfies${\mathrm{G}}_n{(tK+sL+{(?1,?t+s?)}^n)}^{1/n}\ge t{\mathrm{G}}_n{(K)}^{1/n}+s{\mathrm{G}}_n{(L)}^{1/n}$ for any $K,L?{\mathbb{R}}^n$ bounded sets with integer points and all $t,s\ge 0$.We also prove that a certain family of compact sets, extending that of cubes ${[?m,m]}^n$, with $m\in \mathbb{N}$, minimizes the functional ${\mathrm{G}}_n(K+t{[?1,1]}^n)$, for any $t\ge 0$, among those bounded sets $K?{\mathbb{R}}^n$ with given positive lattice point enumerator.Finally, we show that these new discrete inequalities imply the corresponding classical Brunn-Minkowski and isoperimetric inequalities for non-empty compact sets.     

An improvement to the Hilton-Zhao vertex-splitting conjecture

For a simple graph G, denote by n, $\mathrm{\Delta }(G)$, and ${\chi }^{\prime }(G)$ its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if ${\chi }^{\prime }(G)=\mathrm{\Delta }(G)+1$ and ${\chi }^{\prime }(H)<{\chi }^{\prime }(G)$ for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let $G^{?}$ be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that $G^{?}$ must be edge-chromatic critical if $\mathrm{\Delta }(G)>n/3$, and they verified this when $\mathrm{\Delta }(G)\ge \frac{n}{2}(\sqrt{7}?1)\approx 0.82n$. In this paper, we prove it for $\mathrm{\Delta }(G)\ge 0.75n$.