Projective well orders and coanalytic witnesses

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable P-points, definable tight MAD families and definable selective independent families. As a result, we obtain a model in which $\mathfrak{a}=\mathfrak{u}=\mathfrak{i}={\mathrm{?}}_1<2^{{\mathrm{?}}_0}={\mathrm{?}}_2$, each of $\mathfrak{a}$, $\mathfrak{u}$, $\mathfrak{i}$ has a ${\mathrm{\Pi }}_1^1$ witness and there is a ${\mathrm{\Delta }}_3^1$ well-order of the reals. Note that both the complexity of the witnesses of the above combinatorial cardinal characteristics, as well as the complexity of the well-order are optimal. In addition, we show that the existence of a ${\mathrm{\Delta }}_3^1$ well-order of the reals is consistent with $\mathfrak{c}={\mathrm{?}}_2$ and each of the following: $\mathfrak{a}=\mathfrak{u}<\mathfrak{i}$, $\mathfrak{a}=\mathfrak{i}<\mathfrak{u}$, $\mathfrak{a}<\mathfrak{u}=\mathfrak{i}$, where the smaller cardinal characteristics have co-analytic witnesses.Our methods allow the preservation of only sufficiently definable witnesses, which significantly differs from other preservation results of this type.     

Some new results on dimension and Bose distance for various classes of BCH codes

In this paper, we give the dimension and the minimum distance of two subclasses of narrow-sense primitive BCH codes over ${\mathbb{F}}_q$ with designed distance $\delta =a{q}^{m-1}-1(\text{resp. }\delta =a\frac{q^m-1}{q-1})$ for all $1\le a\le q-1$, where q is a prime power and $m>1$ is a positive integer. As a consequence, we obtain an affirmative answer to two conjectures proposed by C. Ding in 2015. Furthermore, using the previous part, we extend some results of Yue and Hu [16], and we give the dimension and, in some cases, the Bose distance for a large designed distance in the range $[a\frac{q^m-1}{q-1},a\frac{q^m-1}{q-1}+T]$ for $0\le a\le q-2$, where $T=q^{\frac{m+1}{2}}-1$ if m is odd, and $T=2q^{\frac{m}{2}}-1$ if m is even.     

Waring-Hilbert problem on Cantor sets

Analogs of Waring–Hilbert problem on Cantor sets are explored. The focus of this paper is on the Cantor ternary set $C$. It is shown that, for each $m\ge 3$, every real number in the unit interval $[0,1]$ is the sum $x_1^m+x_2^m+?+x_n^m$ with each $x_j$ in $C$ and some $n\le 6^m$. Furthermore, every real number $x$ in the interval $[0,8]$ can be written as $x=x_1^3+x_2^3+?+x_8^3$, the sum of eight cubic powers with each $x_j$ in $C$. Another Cantor set $C\times C$ is also considered. More specifically, when $C\times C$ is embedded into the complex plane $?$, the Waring–Hilbert problem on $C\times C$ has a positive answer for powers less than or equal to 4.     

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.     

A unified framework to prove multiplicative inequalities for the partition function

In this paper, we consider a certain class of inequalities for the partition function of the following form:$\prod _{i=1}^{T}p(n+s_i)\ge \prod _{i=1}^{T}p(n+r_i),$ which we call multiplicative inequalities. Given a multiplicative inequality with the condition that ${\sum }_{i=1}^T{s}_i^m\ne {\sum }_{i=1}^T{r}_i^m$ for at least one $m\ge 1$, we shall construct a unified framework so as to decide whether such a inequality holds or not. As a consequence, we will see that study of such inequalities has manifold applications. For example, one can retrieve log-concavity property, strong log-concavity, and the multiplicative inequality for $p(n)$ considered by Bessenrodt and Ono, to name a few. Furthermore, we obtain an asymptotic expansion for the finite difference of the logarithm of $p(n)$, denoted by ${(-1)}^{r-1}{\mathrm{\Delta }}^r\log p(n)$, which generalizes a result by Chen, Wang, and Xie.     

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.