Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes

It has become common knowledge that constructing q-ary quantum MDS codes with minimum distance bigger than \(q/2+1\) is significantly more difficult than constructing those with minimum distance less than or equal to \(q/2+1\). Despite of various constructions of q-ary quantum MDS codes, all known q-ary quantum MDS codes have minimum distance bounded by \(q/2+1\) except for some lengths. The purpose of the current paper is to provide some new q-ary quantum MDS codes with minimum distance bigger than \(q/2+1\). In this paper, we provide several classes of quantum MDS codes with minimum distance bigger than \(q/2+1\). For instance, some examples in these classes include q-ary \([n,n-2k, k+1]\)-quantum MDS codes for cases: (i) \(q\equiv -1\bmod {5}, n=(q^2+4)/5\) and \(1\le k\le (3q-2)/5\); (ii) \(q\equiv -1\bmod {7}, n=(q^2+6)/7\) and \(1\le k\le (4q-3)/7\); (iii) \(2|q, q\equiv -1\bmod {3}, n=2(q^2-1)/3\) and \(1\le k\le (2q-1)/3\); and (iv) \(2|q, q\equiv -1\bmod {5}, n=2(q^2-1)/5\) and \(1\le k\le (3q-2)/5\).     

On complementary dual quasi-twisted codes

A linear complementary-dual (LCD) code C is a linear code whose dual code \(C^{\perp }\) satisfies \(C \cap C^{\perp }=\{0\}\). In this work we characterize some classes of LCD q-ary \((\lambda , l)\)-quasi-twisted (QT) codes of length \(n=ml\) with \((m,q)=1\), \(\lambda \in F_{q} \setminus \{0\}\) and \(\lambda \ne \lambda ^{-1}\). We show that every \((\lambda ,l)\)-QT code C of length \(n=ml\) with \(dim(C)<m\) or \(dim(C^{\perp })<m\) is an LCD code. A sufficient condition for r-generator QT codes is provided under which they are LCD. We show that every maximal 1-generator \((\lambda ,l)\)-QT code of length \(n=ml\) with \(l>2\) is either an LCD code or a self-orthogonal code and a sufficient condition for this family of codes is given under which such a code C is LCD. Also it is shown that every maximal 1-generator \((\lambda ,2)\)-QT code is LCD. Several good and optimal LCD QT codes are presented.     

Global $$C^{1,\al pha }$$ regularity and e xistence of multi ple solutions for singular p( x)-La placian equations

In this paper we study the following singular p(x)-Laplacian problem

$$\begin{aligned} \left\{ \begin{array}{l@{\quad }l} - \text{ div } \left( |\nabla u|^{p(x)-2} \nabla u\right) =\frac{ \lambda }{u^{\beta (x)}}+u^{q(x)}, &{} \text{ in }\quad \Omega , \\ u>0, &{} \text{ in }\quad \Omega , \\ u=0, &{} \text{ on }\quad \partial \Omega , \end{array}\right. \end{aligned}$$

where \(\Omega \) is a bounded domain in \(\mathbb {R}^N\), \(N\ge 2\), with smooth boundary \(\partial \Omega \), \(\beta \in C^1(\bar{\Omega })\) with \( 0< \beta (x) <1\), \(p\in C^1(\bar{\Omega })\), \(q \in C(\bar{\Omega })\) with \(p(x)>1\), \(p(x)< q(x) +1 <p^*(x)\) for \(x \in \bar{\Omega }\), where \( p^*(x)= \frac{Np(x)}{N-p(x)} \) for \(p(x) <N\) and \( p^*(x)= \infty \) for \( p(x) \ge N\). We establish \(C^{1,\alpha }\) regularity of weak solutions of the problem and strong comparison principle. Based on these two results, we prove the existence of multiple (at least two) positive solutions for a certain range of \(\lambda \).

     

Partial permutation decoding for binary linear and $$Z_4$$-linear Hadamard codes

In this paper, s-\({\text {PD}}\)-sets of minimum size \(s+1\) for partial permutation decoding for the binary linear Hadamard code \(H_m\) of length \(2^m\), for all \(m\ge 4\) and \(2 \le s \le \lfloor {\frac{2^m}{1+m}}\rfloor -1\), are constructed. Moreover, recursive constructions to obtain s-\({\text {PD}}\)-sets of size \(l\ge s+1\) for \(H_{m+1}\) of length \(2^{m+1}\), from an s-\({\text {PD}}\)-set of the same size for \(H_m\), are also described. These results are generalized to find s-\({\text {PD}}\)-sets for the \({\mathbb {Z}}_4\)-linear Hadamard codes \(H_{\gamma , \delta }\) of length \(2^m\), \(m=\gamma +2\delta -1\), which are binary Hadamard codes (not necessarily linear) obtained as the Gray map image of quaternary linear codes of type \(2^\gamma 4^\delta \). Specifically, s-PD-sets of minimum size \(s+1\) for \(H_{\gamma , \delta }\), for all \(\delta \ge 3\) and \(2\le s \le \lfloor {\frac{2^{2\delta -2}}{\delta }}\rfloor -1\), are constructed and recursive constructions are described.     

On a Fractional $$ p \& q$$ Laplacian Problem with Critical Sobolev–Hardy Exponents

We consider the following fractional \( p \& q\) Laplacian problem with critical Sobolev–Hardy exponents

$$\begin{aligned} \left\{ \begin{array}{ll} (-\Delta )^{s}_{p} u + (-\Delta )^{s}_{q} u = \frac{|u|^{p^{*}_{s}(\alpha )-2}u}{|x|^{\alpha }}+ \lambda f(x, u) &{} \text{ in } \Omega \\ u=0 &{} \text{ in } \mathbb {R}^{N}{\setminus } \Omega , \end{array} \right. \end{aligned}$$

where \(0<s<1\), \(1\le q<p<\frac{N}{s}\), \((-\Delta )^{s}_{r}\), with \(r\in \{p,q\}\), is the fractional r-Laplacian operator, \(\lambda \) is a positive parameter, \(\Omega \subset \mathbb {R}^{N}\) is an open bounded domain with smooth boundary, \(0\le \alpha <sp\), and \(p^{*}_{s}(\alpha )=\frac{p(N-\alpha )}{N-sp}\) is the so-called Hardy–Sobolev critical exponent. Using concentration-compactness principle and the mountain pass lemma due to Kajikiya [23], we show the existence of infinitely many solutions which tend to be zero provided that \(\lambda \) belongs to a suitable range.

     

Improved upper bounds for partial spreads

A partial \((k-1)\)-spread in \({\text {PG}}(n-1,q)\) is a collection of \((k-1)\)-dimensional subspaces with trivial intersection. So far, the maximum size of a partial \((k-1)\)-spread in \({\text {PG}}(n-1,q)\) was known for the cases \(n\equiv 0\pmod k\), \(n\equiv 1\pmod k\), and \(n\equiv 2\pmod k\) with the additional requirements \(q=2\) and \(k=3\). We completely resolve the case \(n\equiv 2\pmod k\) for the binary case \(q=2\).     

New upper bounds for parent-identifying codes and traceability codes

In the last two decades, parent-identifying codes and traceability codes are introduced to prevent copyrighted digital data from unauthorized use. They have important applications in the scenarios like digital fingerprinting and broadcast encryption schemes. A major open problem in this research area is to determine the upper bounds for the cardinalities of these codes. In this paper we will focus on this theme. Consider a code of length N which is defined over an alphabet of size q. Let \(M_{IPPC}(N,q,t)\) and \(M_{TA}(N,q,t)\) denote the maximal cardinalities of t-parent-identifying codes and t-traceability codes, respectively, where t is known as the strength of the codes. We show \(M_{IPPC}(N,q,t)\le rq^{\lceil N/(v-1)\rceil }+(v-1-r)q^{\lfloor N/(v-1)\rfloor }\), where \(v=\lfloor (t/2+1)^2\rfloor \), \(0\le r\le v-2\) and \(N\equiv r \mod (v-1)\). This new bound improves two previously known bounds of Blackburn, and Alon and Stav. On the other hand, \(M_{TA}(N,q,t)\) is still not known for almost all t. In 2010, Blackburn, Etzion and Ng asked whether \(M_{TA}(N,q,t)\le cq^{\lceil N/t^2\rceil }\) or not, where c is a constant depending only on N, and they have shown the only known validity of this bound for \(t=2\). By using some complicated combinatorial counting arguments, we prove this bound for \(t=3\). This is the first non-trivial upper bound in the literature for traceability codes with strength three.     

Rational Approximation of Functions in Hardy Spaces

Subsequent to our recent work on Fourier spectrum characterization of Hardy spaces \(H^p({\mathbb {R}})\) for the index range \(1\le p\le \infty ,\) in this paper we prove further results on rational Approximation, integral representation and Fourier spectrum characterization of functions for the Hardy spaces \(H^p({\mathbb {R}}), 0 < p\le \infty ,\) with particular interest in the index range \( 0< p \le 1.\) We show that the set of rational functions in \( H^p({\mathbb {C}}_{+1}) \) with the single pole \(-i\) is dense in \( H^p({\mathbb {C}}_{+1}) \) for \(0<p<\infty .\) Secondly, for \(0<p<1\), through rational function approximation we show that any function f in \(L^p({\mathbb {R}})\) can be decomposed into a sum \(g+h\), where g and h are, in the \(L^p({\mathbb {R}})\) convergence sense, the non-tangential boundary limits of functions in, respectively, \( H^p({\mathbb {C}}_{+1})\) and \(H^{p}({\mathbb {C}}_{-1}),\) where \(H^p({\mathbb {C}}_k)\ (k=\pm 1) \) are the Hardy spaces in the half plane \( {\mathbb {C}}_k=\{z=x+iy: ky>0\}\). We give Laplace integral representation formulas for functions in the Hardy spaces \(H^p,\) \(0<p\le 2.\) Besides one in the integral representation formula we give an alternative version of Fourier spectrum characterization for functions in the boundary Hardy spaces \(H^p\) for \(0<p\le 1\).     

An Erdös–Révész Type Law of the Iterated Logarithm for Order Statistics of a Stationary Gaussian Process

Let \(\{X(t):t\in \mathbb R_+\}\) be a stationary Gaussian process with almost surely (a.s.) continuous sample paths, \(\mathbb E X(t) = 0, \mathbb E X^2(t) = 1\) and correlation function satisfying (i) \(r(t) = 1 - C|t|^{\alpha } + o(|t|^{\alpha })\) as \(t\rightarrow 0\) for some \(0\le \alpha \le 2\) and \(C>0\); (ii) \(\sup _{t\ge s}|r(t)|<1\) for each \(s>0\) and (iii) \(r(t) = O(t^{-\lambda })\) as \(t\rightarrow \infty \) for some \(\lambda >0\). For any \(n\ge 1\), consider n mutually independent copies of X and denote by \(\{X_{r:n}(t):t\ge 0\}\) the rth smallest order statistics process, \(1\le r\le n\). We provide a tractable criterion for assessing whether, for any positive, non-decreasing function \(f, \mathbb P(\mathscr {E}_f)=\mathbb P(X_{r:n}(t) > f(t)\, \text { i.o.})\) equals 0 or 1. Using this criterion we find, for a family of functions \(f_p(t)\) such that \(z_p(t)=\mathbb P(\sup _{s\in [0,1]}X_{r:n}(s)>f_p(t))=O((t\log ^{1-p} t)^{-1})\), that \(\mathbb P(\mathscr {E}_{f_p})= 1_{\{p\ge 0\}}\). Consequently, with \(\xi _p (t) = \sup \{s:0\le s\le t, X_{r:n}(s)\ge f_p(s)\}\), for \(p\ge 0\) we have \(\lim _{t\rightarrow \infty }\xi _p(t)=\infty \) and \(\limsup _{t\rightarrow \infty }(\xi _p(t)-t)=0\) a.s. Complementarily, we prove an Erdös–Révész type law of the iterated logarithm lower bound on \(\xi _p(t)\), namely, that \(\liminf _{t\rightarrow \infty }(\xi _p(t)-t)/h_p(t) = -1\) a.s. for \(p>1\) and \(\liminf _{t\rightarrow \infty }\log (\xi _p(t)/t)/(h_p(t)/t) = -1\) a.s. for \(p\in (0,1]\), where \(h_p(t)=(1/z_p(t))p\log \log t\).     

The Gray image of constacyclic codes over the finite chain ring $$F_{p^m}[u]/\langle u^k\rangle $$

Let \(\mathbb {F}_{p^m}\) be a finite field of cardinality \(p^m\), where p is a prime, and k, N be any positive integers. We denote \(R_k=F_{p^m}[u]/\langle u^k\rangle =F_{p^m}+uF_{p^m}+\cdots +u^{k-1}F_{p^m}\) (\(u^k=0\)) and \(\lambda =a_0+a_1u+\cdots +a_{k-1}u^{k-1}\) where \(a_0, a_1,\ldots , a_{k-1}\in F_{p^m}\) satisfying \(a_0\ne 0\) and \(a_1=1\). Let r be a positive integer satisfying \(p^{r-1}+1\le k\le p^r\). First we define a Gray map from \(R_k\) to \(F_{p^m}^{p^r}\), then prove that the Gray image of any linear \(\lambda \)-constacyclic code over \(R_k\) of length N is a distance preserving linear \(a_0^{p^r}\)-constacyclic code over \(F_{p^m}\) of length \(p^rN\). Furthermore, the generator polynomials for each linear \(\lambda \)-constacyclic code over \(R_k\) of length N and its Gray image are given respectively. Finally, some optimal constacyclic codes over \(F_{3}\) and \(F_{5}\) are constructed.     

A concave–convex problem with a variable operator

We study the following elliptic problem \(-A(u) = \lambda u^q\) with Dirichlet boundary conditions, where \(A(u) (x) = \Delta u (x) \chi _{D_1} (x)+ \Delta _p u(x) \chi _{D_2}(x)\) is the Laplacian in one part of the domain, \(D_1\), and the p-Laplacian (with \(p>2\)) in the rest of the domain, \(D_2 \). We show that this problem exhibits a concave–convex nature for \(1<q<p-1\). In fact, we prove that there exists a positive value \(\lambda ^*\) such that the problem has no positive solution for \(\lambda > \lambda ^*\) and a minimal positive solution for \(0<\lambda < \lambda ^*\). If in addition we assume that p is subcritical, that is, \(p<2N/(N-2)\) then there are at least two positive solutions for almost every \(0<\lambda < \lambda ^*\), the first one (that exists for all \(0<\lambda < \lambda ^*\)) is obtained minimizing a suitable functional and the second one (that is proven to exist for almost every \(0<\lambda < \lambda ^*\)) comes from an appropriate (and delicate) mountain pass argument.     

The solution gap of the Brezis–Nirenberg problem on the hyperbolic space

We consider the positive solutions of the nonlinear eigenvalue problem \(-\Delta _{\mathbb {H}^n} u = \lambda u + u^p, \) with \(p=\frac{n+2}{n-2}\) and \(u \in H_0^1(\Omega ),\) where \(\Omega \) is a geodesic ball of radius \(\theta _1\) on \(\mathbb {H}^n.\) For radial solutions, this equation can be written as an ordinary differential equation having n as a parameter. In this setting, the problem can be extended to consider real values of n. We show that if \(2<n<4\) this problem has a unique positive solution if and only if \(\lambda \in \left( n(n-2)/4 +L^*\,,\, \lambda _1\right) .\) Here \(L^*\) is the first positive value of \(L = -\ell (\ell +1)\) for which a suitably defined associated Legendre function \(P_{\ell }^{-\alpha }(\cosh \theta ) >0\) if \(0 < \theta <\theta _1\) and \(P_{\ell }^{-\alpha }(\cosh \theta _1)=0,\) with \(\alpha = (2-n)/2\).     

On the Almost Sure Location of the Singular Values of Certain Gaussian Block-Hankel Large Random Matrices

This paper studies the almost sure location of the eigenvalues of matrices \({\mathbf{W}}_N {\mathbf{W}}_N^{*}\), where \({\mathbf{W}}_N = ({\mathbf{W}}_N^{(1)T}, \ldots , {\mathbf{W}}_N^{(M)T})^{T}\) is a \({\textit{ML}} \times N\) block-line matrix whose block-lines \(({\mathbf{W}}_N^{(m)})_{m=1, \ldots , M}\) are independent identically distributed \(L \times N\) Hankel matrices built from i.i.d. standard complex Gaussian sequences. It is shown that if \(M \rightarrow +\infty \) and \(\frac{{\textit{ML}}}{N} \rightarrow c_* (c_* \in (0, \infty ))\), then the empirical eigenvalue distribution of \({\mathbf{W}}_N {\mathbf{W}}_N^{*}\) converges almost surely towards the Marcenko–Pastur distribution. More importantly, it is established using the Haagerup–Schultz–Thorbjornsen ideas that if \(L = O(N^{\alpha })\) with \(\alpha < 2/3\), then, almost surely, for \(N\) large enough, the eigenvalues of \({\mathbf{W}}_N {\mathbf{W}}_N^{*}\) are located in the neighbourhood of the Marcenko–Pastur distribution. It is conjectured that the condition \(\alpha < 2/3\) is optimal.     

Diophantine approximation with four squares and one <Emphasis Type="Italic">k</Emphasis>th power of primes

Let k be an integer with \(k\ge 3\) and \(\eta \) be any real number. Suppose that \(\lambda _1, \lambda _2, \lambda _3, \lambda _4, \mu \) are non-zero real numbers, not all of the same sign and \(\lambda _1/\lambda _2\) is irrational. It is proved that the inequality \(|\lambda _1p_1^2+\lambda _2p_2^2+\lambda _3p_3^2+\lambda _4p_4^2+\mu p_5^k+\eta |<(\max \ p_j)^{-\sigma }\) has infinitely many solutions in prime variables \(p_1, p_2, \ldots , p_5\), where \(0<\sigma <\frac{1}{16}\) for \(k=3,\ 0<\sigma <\frac{5}{3k2^k}\) for \(4\le k\le 5\) and \(0<\sigma <\frac{40}{21k2^k}\) for \(k\ge 6\). This gives an improvement of an earlier result.     

Computing the Permanent of (Some) Complex Matrices

We present a deterministic algorithm, which, for any given \(0< \epsilon < 1\) and an \(n \times n\) real or complex matrix \(A=\left( a_{ij}\right) \) such that \(\left| a_{ij}-1 \right| \le 0.19\) for all \(i, j\) computes the permanent of \(A\) within relative error \(\epsilon \) in \(n^{O\left( \ln n -\ln \epsilon \right) }\) time. The method can be extended to computing hafnians and multidimensional permanents.     

On Weighted Average Interpolation with Cardinal Splines

Given a sequence of data \(\{ y_{n} \} _{n \in \mathbb{Z}}\) with polynomial growth and an odd number \(d\), Schoenberg proved that there exists a unique cardinal spline \(f\) of degree \(d\) with polynomial growth such that \(f ( n ) =y_{n}\) for all \(n\in \mathbb{Z}\). In this work, we show that this result also holds if we consider weighted average data \(f\ast h ( n ) =y_{n}\), whenever the average function \(h\) satisfies some light conditions. In particular, the interpolation result is valid if we consider cell-average data \(\int_{n-a}^{n+a}f ( x ) dx=y_{n}\) with \(0< a\leq 1/2\). The case of even degree \(d\) is also studied.     

The primitive idempotents and weight distributions of irreducible constacyclic codes

Let \({\mathbb {F}}_q\) be a finite field with q elements such that \(l^v||(q^t-1)\) and \(\gcd (l,q(q-1))=1\), where l, t are primes and v is a positive integer. In this paper, we give all primitive idempotents in a ring \(\mathbb F_q[x]/\langle x^{l^m}-a\rangle \) for \(a\in {\mathbb {F}}_q^*\). Specially for \(t=2\), we give the weight distributions of all irreducible constacyclic codes and their dual codes of length \(l^m\) over \({\mathbb {F}}_q\).     

On generalized Ramanujan primes

Let \(\Delta = \sum _{m=0}^\infty q^{(2m+1)^2} \in \mathbf {F}_2[[q]]\) be the reduction mod 2 of the \(\Delta \) series. A modular form of level 1, \(f=\sum _{n\geqslant 0} c(n) \,q^n\), with integer coefficients, is congruent modulo \(2\) to a polynomial in \(\Delta \). Let us set \(W_f(x)=\sum _{n\leqslant x,\ c(n)\text { odd }} 1\), the number of odd Fourier coefficients of \(f\) of index \(\leqslant x\). The order of magnitude of \(W_f(x)\) (for \(x\rightarrow \infty \)) has been determined by Serre in the seventies. Here, we give an asymptotic equivalent for \(W_f(x)\). Let \(p(n)\) be the partition function and \(A_0(x)\) (resp. \(A_1(x)\)) be the number of \(n\leqslant x\) such that \(p(n)\) is even (resp. odd). In the preceding papers, the second-named author has shown that \(A_0(x)\geqslant 0.28 \sqrt{x\;\log \log x}\) for \(x\geqslant 3\) and \(A_1(x)>\frac{4.57 \sqrt{x}}{\log x}\) for \(x\geqslant 7\). Here, it is proved that \(A_0(x)\geqslant 0.069 \sqrt{x}\;\log \log x\) holds for \(x>1\) and that \(A_1(x) \geqslant \frac{0.037 \sqrt{x}}{(\log x)^{7/8}}\) holds for \(x\geqslant 2\). The main tools used to prove these results are the determination of the order of nilpotence of a modular form of level-\(1\) modulo \(2\), and of the structure of the space of those modular forms as a module over the Hecke algebra, which have been given in a recent work of Serre and the second-named author.     

Heat Content for Stable Processes in Domains of $$\mathbb {R}^d$$

This paper studies the small time behavior of the heat content for rotationally invariant \(\alpha \)-stable processes, \(0<\alpha \le 2\), in domains of \(\mathbb {R}^d\). Unlike the asymptotics for the heat trace, the behavior of the heat content differs depending on the range of \(\alpha \) according to \(0<\alpha <1\), \(\alpha =1\) and \(1<\alpha \le 2\).     

$$L^{p}$$-Norms a nd Mahler’s Measure of Poly nomials o n the n-Dime nsio nal Torus

We prove Nikol’skii type inequalities that, for polynomials on the n-dimensional torus \(\mathbb {T}^n\), relate the \(L^p\)-norm with the \(L^q\)-norm (with respect to the normalized Lebesgue measure and \(0 <p <q < \infty \)). Among other things, we show that \(C=\sqrt{q/p}\) is the best constant such that \(\Vert P\Vert _{L^q}\le C^{\text {deg}(P)} \Vert P\Vert _{L^p}\) for all homogeneous polynomials P on \(\mathbb {T}^n\). We also prove an exact inequality between the \(L^p\)-norm of a polynomial P on \(\mathbb {T}^n\) and its Mahler measure M(P), which is the geometric mean of |P| with respect to the normalized Lebesgue measure on \(\mathbb {T}^n\). Using extrapolation, we transfer this estimate into a Khintchine–Kahane type inequality, which, for polynomials on \(\mathbb {T}^n\), relates a certain exponential Orlicz norm and Mahler’s measure. Applications are given, including some interpolation estimates.