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$.     

Classification of some quadrinomials over finite fields of odd characteristic

In this paper, we completely determine all necessary and sufficient conditions such that the polynomial $f(x)=x^3+a{x}^{q+2}+b{x}^{2q+1}+c{x}^{3q}$, where $a,b,c\in {\mathbb{F}}_q^{⁎}$, is a permutation quadrinomial of ${\mathbb{F}}_{q^2}$ over any finite field of odd characteristic. This quadrinomial has been studied first in [25] by Tu, Zeng and Helleseth, later in [24] Tu, Liu and Zeng revisited these quadrinomials and they proposed a more comprehensive characterization of the coefficients that results with new permutation quadrinomials, where $char({\mathbb{F}}_q)=2$ and finally, in [16], Li, Qu, Li and Chen proved that the sufficient condition given in [24] is also necessary and thus completed the solution in even characteristic case. In [6] Gupta studied the permutation properties of the polynomial $x^3+a{x}^{q+2}+b{x}^{2q+1}+c{x}^{3q}$, where $char({\mathbb{F}}_q)=3,5$ and $a,b,c\in {\mathbb{F}}_q^{⁎}$ and proposed some new classes of permutation quadrinomials of ${\mathbb{F}}_{q^2}$.In particular, in this paper we classify all permutation polynomials of ${\mathbb{F}}_{q^2}$ of the form $f(x)=x^3+a{x}^{q+2}+b{x}^{2q+1}+c{x}^{3q}$, where $a,b,c\in {\mathbb{F}}_q^{⁎}$, over all finite fields of odd characteristic and obtain several new classes of such permutation quadrinomials.     

A note on complex conference matrices

Let ${\mathbb{F}}_q$ be the Galois field of order $q=p^m$, p a prime number and m a positive integer. We prove in this article that for any nontrivial multiplicative character ϰ of ${\mathbb{F}}_q^{⁎}$ and for any $b\in {\mathbb{F}}_q^{⁎}$ we have$\sum _{a\in {\mathbb{F}}_q^{⁎}}\varkappa (a)\overline{\varkappa (a+b)}=-1$. Whenever q is odd and ϰ is the Legendre symbol this formula reduces to the well-known Jacobsthal's formula. A complex conference matrix is a square matrix of order n with zero diagonal and unimodular complex numbers elsewhere such that $C^{⁎}C=(n-1)I$. Paley used finite fields with odd orders $q=p^m$, p prime and the real Legendre symbol to construct real symmetric conference matrices of orders $q+1$ whenever $q\equiv 1(\mathrm{mod}4)$ and real skew-symmetric conference matrices of orders $q+1$ whenever $q\equiv -1(\mathrm{mod}4)$. In this article we extend Paley construction to the complex setting. We extend Jacobsthal's formula to all other nontrivial characters to produce a complex symmetric conference matrix of order $q+1$ whenever $q\ge 4$ is any prime power as well as a complex skew-symmetric conference matrix of order $q+1$ whenever q is any odd prime power. These matrices were constructed very recently in connection with harmonic Grassmannian codes, by use of finite fields and the character table of their additive characters. We propose here a new proof of their construction by use of the above generalized formula similarly as was done by Paley in the real case. We also classify, up to equivalence, the complex conference matrices constructed with some nontrivial characters. In particular, we prove that the complex conference matrix constructed with any nontrivial multiplicative character ϰ and that one constructed with ${\varkappa }^{p^k}$ for any integer $k=1,...m-1$ are permutation equivalent. Moreover, we determine the spectrum of any complex conference matrix obtained from this construction.