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\).     

Group divisible designs with large block sizes

For positive integers n, k with \(3\le k\le n\), let \(X=\mathbb {F}_{2^n}\setminus \{0,1\}\), \({\mathcal {G}}=\{\{x,x+1\}:x\in X\}\), and \({\mathcal {B}}_k=\left\{ \{x_1,x_2,\ldots ,x_k\}\!\subset \!X:\sum \limits _{i=1}^kx_i=1,\ \sum \limits _{i\in I}x_i\!\ne \!1\ \mathrm{for\ any}\ \emptyset \!\ne \!I\!\subsetneqq \!\{1,2,\ldots ,k\}\right\} \). Lee et al. used the inclusion–exclusion principle to show that the triple \((X,{\mathcal {G}},{\mathcal {B}}_k)\) is a \((k,\lambda _k)\)-GDD of type \(2^{2^{n-1}-1}\) for \(k\in \{3,4,5,6,7\}\) where \(\lambda _k=\frac{\prod _{i=3}^{k-1}(2^n-2^i)}{(k-2)!}\) (Lee et al. in Des Codes Cryptogr,  https://doi.org/10.1007/s10623-017-0395-8, 2017). They conjectured that \((X,{\mathcal {G}},{\mathcal {B}}_k)\) is also a \((k,\lambda _k)\)-GDD of type \(2^{2^{n-1}-1}\) for any integer \(k\ge 8\). In this paper, we use a similar construction and counting principles to show that there is a \((k,\lambda _k)\)-GDD of type \((q^2-q)^{(q^{n-1}-1)/(q-1)}\) for any prime power q and any integers k, n with \(3\le k\le n\) where \(\lambda _k=\frac{\prod _{i=3}^{k-1}(q^n-q^i)}{(k-2)!}\). Consequently, their conjecture holds. Such a method is also generalized to yield a \((k,\lambda _k)\)-GDD of type \((q^{\ell +1}-q^{\ell })^{(q^{n-\ell }-1)/(q-1)}\) where \(\lambda _k=\frac{\prod _{i=3}^{k-1}(q^n-q^{\ell +i-1})}{(k-2)!}\) and \(k+\ell \le n+1\).     

Some results on a special case of a general continued fraction of Ramanujan

We derive a new special case C(q) of a general continued fraction recorded by Ramanujan in his Lost Notebook. We give a representation of the continued fraction C(q) as a quotient of Dedekind eta-function and then use it to prove modular identities connecting C(q) with each of the continued fractions \(C(-q)\), \(C(q^{2})\), \(C(q^{3})\), \(C(q^{5})\), \(C(q^{7})\), \(C(q^{11})\), \(C(q^{13})\) and \(C(q^{17})\). We also prove general theorems for the explicit evaluation of the continued fraction C(q) by using Ramanujan’s class invariants.     

Critical Sets of Full <Emphasis Type="Italic">n</Emphasis>-Latin Squares

The full n-Latin square is the \(n\times n\) array with symbols \(1,2,\dots ,n\) in each cell. In a way that is analogous to critical sets of full designs, a critical set of the full n-Latin square can be used to find a defining set for any Latin square of order n. In this paper we study the size of the smallest critical set for a full n-Latin square, showing this to be somewhere between \((n^3-2n^2+2n)/2\) and \((n-1)^3+1\). In the case that each cell is either full or empty, we show the size of a critical set in the full n-Latin square is always equal to \(n^3-2n^2-n\).     

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\).     

On symplectic semifield spreads of $$\hbox {PG}(5, q^2)$$PG(5, q2), q even

We prove that the only symplectic semifield spreads of \(\hbox {PG}(5,q^2)\), \(q\ge 2^{14}\) even, whose associated semifield has center containing \({\mathbb F}_q\), is the Desarguesian spread, by proving that the only \({\mathbb F}_q\)-linear set of rank 6 disjoint from the secant variety of the Veronese surface of \(\hbox {PG}(5,q^2)\) is a plane with three points of the Veronese surface of \(\hbox {PG}(5,q^6){\setminus } \hbox {PG}(5,q^2)\).     

Resistance distances in the linear polyomino chain

The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a unit resistor. Let \(B_n\) denote the linear polyomino chain with \(n-1\) squares. In this paper, first by using resistance sum rules along with series and parallel principles, explicit formulae for the resistance distances between any two vertices of \(B_n\) are given. Then based on these formulae, the largest and the smallest resistance distances in \(B_n\) are determined. Finally, the monotonicity and some asymptotic properties of resistance distances in \(B_n\) are given.     

Construction of sign-changing solutions for a harmonic equation with subcritical exponent

In this paper, we study the harmonic equation involving subcritical exponent \((P_{\varepsilon })\): \( \Delta u = 0 \), in \(\mathbb {B}^n\) and \(\displaystyle \frac{\partial u}{\partial \nu } + \displaystyle \frac{n-2}{2}u = \displaystyle \frac{n-2}{2} K u^{\frac{n}{n-2}-\varepsilon }\) on \( \mathbb {S}^{n-1}\) where \(\mathbb {B}^n \) is the unit ball in \(\mathbb {R}^n\), \(n\ge 5\) with Euclidean metric \(g_0\), \(\partial \mathbb {B}^n = \mathbb {S}^{n-1}\) is its boundary, K is a function on \(\mathbb {S}^{n-1}\) and \(\varepsilon \) is a small positive parameter. We construct solutions of the subcritical equation \((P_{\varepsilon })\) which blow up at two different critical points of K. Furthermore, we construct solutions of \((P_{\varepsilon })\) which have two bubbles and blow up at the same critical point of K.     

New nonbinary code bounds based on divisibility arguments

For \(q,n,d \in \mathbb {N}\), let \(A_q(n,d)\) be the maximum size of a code \(C \subseteq [q]^n\) with minimum distance at least d. We give a divisibility argument resulting in the new upper bounds \(A_5(8,6) \le 65\), \(A_4(11,8)\le 60\) and \(A_3(16,11) \le 29\). These in turn imply the new upper bounds \(A_5(9,6) \le 325\), \(A_5(10,6) \le 1625\), \(A_5(11,6) \le 8125\) and \(A_4(12,8) \le 240\). Furthermore, we prove that for \(\mu ,q \in \mathbb {N}\), there is a 1–1-correspondence between symmetric \((\mu ,q)\)-nets (which are certain designs) and codes \(C \subseteq [q]^{\mu q}\) of size \(\mu q^2\) with minimum distance at least \(\mu q - \mu \). We derive the new upper bounds \(A_4(9,6) \le 120\) and \(A_4(10,6) \le 480\) from these ‘symmetric net’ codes.     

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.     

Some results on generalized strong external difference families

A generalized strong external difference family (briefly \((v, m; k_1,\dots ,k_m; \lambda _1,\dots ,\lambda _m)\)-GSEDF) was introduced by Paterson and Stinson in 2016. In this paper, we give some nonexistence results for GSEDFs. In particular, we prove that a \((v, 3;k_1,k_2,k_3; \lambda _1,\lambda _2,\lambda _3)\)-GSEDF does not exist when \(k_1+k_2+k_3< v\). We also give a first recursive construction for GSEDFs and prove that if there is a \((v,2;2\lambda ,\frac{v-1}{2};\lambda ,\lambda )\)-GSEDF, then there is a \((vt,2;4\lambda ,\frac{vt-1}{2};2\lambda ,2\lambda )\)-GSEDF with \(v>1\), \(t>1\) and \(v\equiv t\equiv 1\pmod 2\). Then we use it to obtain some new GSEDFs for \(m=2\). In particular, for any prime power q with \(q\equiv 1\pmod 4\), we show that there exists a \((qt, 2;(q-1)2^{n-1},\frac{qt-1}{2};(q-1)2^{n-2},(q-1)2^{n-2})\)-GSEDF, where \(t=p_1p_2\dots p_n\), \(p_i>1\), \(1\le i\le n\), \(p_1, p_2,\dots ,p_n\) are odd integers.     

Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs

Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph \(K_n\) that has no rainbow spanning subgraph with diameter at most t. We prove \(s(n,t)={\left( {\begin{array}{c}n-2\\ 2\end{array}}\right) }+1\) for \(n,t\ge 3\), while \(s(n,2)={\left( {\begin{array}{c}n-2\\ 2\end{array}}\right) }+\left\lfloor {\frac{n-1}{2}}\right\rfloor \) for \(n\ne 4\) (and \(s(4,2)=2\)).     

Classifying First Extremal Points for a Fractional Boundary Value Problem with a Fractional Boundary Condition

Let \(n\in \mathbb {N}\), \(n\ge 2\), \(\beta >0\) fixed, and \(0<b\le \beta \). For \(n-1<\alpha \le n\), we look to classify extremal points for the fractional differential equation \(D_{0^+}^{\alpha }u+p(t) u=0\), satisfying the boundary conditions \(u^{(i)}(0)=0\), \(i=0,\ldots ,n-2\), \(D_{0^+}^\gamma u(b)=0\), where p(t) is a continuous nonnegative function on \([0,\beta ]\) which does not vanish identically on any nondegenerate compact subinterval of \([0,\beta ]\). Using the theory of Krein and Rutman, first extremal points of this boundary value problem are classified. As an application, the results are applied, along with a fixed-point theorem, to show the existence of a solution of a nonlinear fractional boundary value problem.     

On Star–Wheel Ramsey Numbers

For two given graphs \(G_1\) and \(G_2\), the Ramsey number \(R(G_1,G_2)\) is the least integer r such that for every graph G on r vertices, either G contains a \(G_1\) or \(\overline{G}\) contains a \(G_2\). In this note, we determined the Ramsey number \(R(K_{1,n},W_m)\) for even m with \(n+2\le m\le 2n-2\), where \(W_m\) is the wheel on \(m+1\) vertices, i.e., the graph obtained from a cycle \(C_m\) by adding a vertex v adjacent to all vertices of the \(C_m\).     

Generalized Fibonacci numbers of the form $$wx^{2}+1$$

Let \(P\ge 3\) be an integer and let \((U_{n})\) and \((V_{n})\) denote generalized Fibonacci and Lucas sequences defined by \(U_{0}=0,U_{1}=1\); \( V_{0}=2,V_{1}=P,\) and \(U_{n+1}=PU_{n}-U_{n-1}\), \(V_{n+1}=PV_{n}-V_{n-1}\) for \(n\ge 1.\) In this study, when P is odd, we solve the equation \( U_{n}=wx^{2}+1\) for \(w=1,2,3,5,6,7,10.\) After then, we solve some Diophantine equations utilizing solutions of these equations.     

A characterization of the desarguesian and the Figueroa planes of order $$q^{3}$$

Let \(\Pi \) be a plane of order \(q^{3}\), \(q>2\), admitting \(G\cong PGL(3,q)\) as a collineation group. By Dempwolff (Geometriae Dedicata 18:101–112, 1985) the plane \(\Pi \) contains a G-invariant subplane \(\pi _{0}\) isomorphic to PG(2, q) on which G acts 2-transitively. In this paper it is shown that, if the homologies of \(\pi _{0}\) contained in G extend to \(\Pi \) then \(\Pi \) is either the desarguesian or the Figueroa plane.     

Semilinear elliptic equations with Hardy potential and subcritical source term

Let \(\Omega \) be a smooth bounded domain in \({\mathbb {R}}^N\) (\(N>2\)) and \(\delta (x):=\text {dist}\,(x,\partial \Omega )\). Assume \(\mu \in {\mathbb {R}}_+, \nu \) is a nonnegative finite measure on \(\partial \Omega \) and \(g \in C(\Omega \times {\mathbb {R}}_+)\). We study positive solutions of

$$\begin{aligned} -\Delta u - \frac{\mu }{\delta ^2} u = g(x,u) \text { in } \Omega , \qquad \text {tr}^*(u)=\nu . \end{aligned}$$

(P)

Here \(\text {tr}^*(u)\) denotes the normalized boundary trace of u which was recently introduced by Marcus and Nguyen (Ann Inst H Poincaré Anal Non Linéaire, 34, 69–88, 2017). We focus on the case \(0<\mu < C_H(\Omega )\) (the Hardy constant for \(\Omega \)) and provide qualitative properties of positive solutions of (P). When \(g(x,u)=u^q\) with \(q>0\), we prove that there is a critical value \(q^*\) (depending only on \(N, \mu \)) for (P) in the sense that if \(q<q^*\) then (P) possesses a solution under a smallness assumption on \(\nu \), but if \(q \ge q^*\) this problem admits no solution with isolated boundary singularity. Existence result is then extended to a more general setting where g is subcritical [see (1.28)]. We also investigate the case where g is linear or sublinear and give an existence result for (P).

     

The Hardy–Schrödinger operator with interior singularity: the remaining cases

We consider the remaining unsettled cases in the problem of existence of energy minimizing solutions for the Dirichlet value problem \(L_\gamma u-\lambda u=\frac{u^{2^*(s)-1}}{|x|^s}\) on a smooth bounded domain \(\Omega \) in \({\mathbb {R}}^n\) (\(n\ge 3\)) having the singularity 0 in its interior. Here \(\gamma <\frac{(n-2)^2}{4}\), \(0\le s <2\), \(2^*(s):=\frac{2(n-s)}{n-2}\) and \(0\le \lambda <\lambda _1(L_\gamma )\), the latter being the first eigenvalue of the Hardy–Schrödinger operator \(L_\gamma :=-\Delta -\frac{\gamma }{|x|^2}\). There is a threshold \(\lambda ^*(\gamma , \Omega ) \ge 0\) beyond which the minimal energy is achieved, but below which, it is not. It is well known that \(\lambda ^*(\Omega )=0\) in higher dimensions, for example if \(0\le \gamma \le \frac{(n-2)^2}{4}-1\). Our main objective in this paper is to show that this threshold is strictly positive in “lower dimensions” such as when \( \frac{(n-2)^2}{4}-1<\gamma <\frac{(n-2)^2}{4}\), to identify the critical dimensions (i.e., when the situation changes), and to characterize it in terms of \(\Omega \) and \(\gamma \). If either \(s>0\) or if \(\gamma > 0\), i.e., in the truly singular case, we show that in low dimensions, a solution is guaranteed by the positivity of the “Hardy-singular internal mass” of \(\Omega \), a notion that we introduce herein. On the other hand, and just like the case when \(\gamma =s=0\) studied by Brezis and Nirenberg (Commun Pure Appl Math 36:437–477, 1983) and completed by Druet (Ann Inst H Poincaré Anal Non Linéaire 19(2):125–142, 2002), \(n=3\) is the critical dimension, and the classical positive mass theorem is sufficient for the merely singular case, that is when \(s=0\), \(\gamma \le 0\).     

On Locally Gabriel Geometric Graphs

Let \(P\) be a set of \(n\) points in the plane. A geometric graph \(G\) on \(P\) is said to be locally Gabriel if for every edge \((u,v)\) in \(G\), the Euclidean disk with the segment joining \(u\) and \(v\) as diameter does not contain any points of \(P\) that are neighbors of \(u\) or \(v\) in \(G\). A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any \(n\), there exists LGG with \(\Omega (n^{5/4})\) edges. This improves upon the previous best bound of \(\Omega (n^{1+\frac{1}{\log \log n}})\). (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any \(n\) point set, there exists an independent set of size \(\Omega (\sqrt{n}\log n)\).     

On a Generalization for Tribonacci Quaternions

Let \(V_{n}\) denote the third order linear recursive sequence defined by the initial values \(V_{0}\), \(V_{1}\) and \(V_{2}\) and the recursion \(V_{n}=rV_{n-1}+sV_{n-2}+tV_{n-3}\) if \(n\ge 3\), where r, s, and t are real constants. The \(\{V_{n}\}_{n\ge 0}\) are generalized Tribonacci numbers and reduce to the usual Tribonacci numbers when \(r=s=t=1\) and to the 3-bonacci numbers when \(r=s=1\) and \(t=0\). In this study, we introduced a quaternion sequence which has not been introduced before. We show that the new quaternion sequence that we introduced includes the previously introduced Tribonacci, Padovan, Narayana and third order Jacobsthal quaternion sequences. We obtained the Binet formula, summation formula and the norm value for this new quaternion sequence.