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

Relation-induced connectedness in the digital plane

We introduce and discuss a connectedness induced by n-ary relations (\(n>1\) an integer) on their underlying sets. In particular, we focus on certain n-ary relations with the induced connectedness allowing for a definition of digital Jordan curves. For every integer \(n>1\), we introduce one such n-ary relation on the digital plane \({\mathbb {Z}}^2\) and prove a digital analogue of the Jordan curve theorem for the induced connectedness. It follows that these n-ary relations may be used as convenient structures on the digital plane for the study of geometric properties of digital images. For \(n=2\), such a structure coincides with the (specialization order of the) Khalimsky topology and, for \(n>2\), it allows for a variety of Jordan curves richer than that provided by the Khalimsky topology.     

Packing chromatic number versus chromatic and clique number

The packing chromatic number \(\chi _{\rho }(G)\) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into sets \(V_i\), \(i\in [k]\), where each \(V_i\) is an i-packing. In this paper, we investigate for a given triple (a, b, c) of positive integers whether there exists a graph G such that \(\omega (G) = a\), \(\chi (G) = b\), and \(\chi _{\rho }(G) = c\). If so, we say that (a, b, c) is realizable. It is proved that \(b=c\ge 3\) implies \(a=b\), and that triples \((2,k,k+1)\) and \((2,k,k+2)\) are not realizable as soon as \(k\ge 4\). Some of the obtained results are deduced from the bounds proved on the packing chromatic number of the Mycielskian. Moreover, a formula for the independence number of the Mycielskian is given. A lower bound on \(\chi _{\rho }(G)\) in terms of \(\Delta (G)\) and \(\alpha (G)\) is also proved.     

Continued fractions and irrational rotations

Let \(\alpha \in (0, 1)\) be an irrational number with continued fraction expansion \(\alpha =[0; a_1, a_2, \ldots ]\) and let \(p_n/q_n= [0; a_1, \ldots , a_n]\) be the nth convergent to \(\alpha \). We prove a formula for \(p_nq_k-q_np_k\) \((k<n)\) in terms of a Fibonacci type sequence \(Q_n\) defined in terms of the \(a_n\) and use it to provide an exact formula for \(\{n\alpha \}\) for all n.     

Generalized Bernstein Operators on the Classical Polynomial Spaces

We study generalizations of the classical Bernstein operators on the polynomial spaces \(\mathbb {P}_{n}[a,b]\), where instead of fixing \(\mathbf {1}\) and x, we reproduce exactly \(\mathbf {1}\) and a polynomial \(f_1\), strictly increasing on [a, b]. We prove that for sufficiently large n, there always exist generalized Bernstein operators fixing \(\mathbf {1}\) and \(f_1\). These operators are defined by non-decreasing sequences of nodes precisely when \(f_1^\prime > 0\) on (a, b), but even if \(f_1^\prime \) vanishes somewhere inside (a, b), they converge to the identity.     

Counterexamples to the B-spline Conjecture for Gabor Frames

The frame set conjecture for B-splines \(B_n\), \(n \ge 2\), states that the frame set is the maximal set that avoids the known obstructions. We show that any hyperbola of the form \(ab=r\), where r is a rational number smaller than one and a and b denote the sampling and modulation rates, respectively, has infinitely many pieces, located around \(b=2,3,\dots \), not belonging to the frame set of the nth order B-spline. This, in turn, disproves the frame set conjecture for B-splines. On the other hand, we uncover a new region belonging to the frame set for B-splines \(B_n\), \(n \ge 2\).     

A note on amicable numbers and their variations

For any positive integer n, let \(\sigma (\mathrm{n})\) and p(n) denote the sum of divisors and the least prime divisor of n respectively. Let a, b be positive integers. In this paper we prove the following two results: (i) If 4 | a and \(\gcd (a, b)=1\), then a and b do not satisfy \(\sigma (a)= \sigma (b)=a+b\). (ii) If \(a>10^{8}\) and \(p(a)>2\log _{2}a+1\), where \(\log _{2}{a}\) is the logarithm of a with base 2, then a and b do not satisfy \(\sigma (a)=\sigma (b)=a+b+\lambda \), where \(\lambda \in \{0,\pm 1\}\).     

On the relational complexity of a finite permutation group

The relational complexity \(\rho (X,G)\) of a finite permutation group is the least k for which the group can be viewed as an automorphism group acting naturally on a homogeneous relational system whose relations are k-ary (an explicit permutation group theoretic version of this definition is also given). In the context of primitive permutation groups, the natural questions are (a) rough estimates, or (preferably) precise values for \(\rho \) in natural cases; and (b) a rough determination of the primitive permutation groups with \(\rho \) either very small (bounded) or very large (much larger than the logarithm of the degree). The rough version of (a) is relevant to (b). Our main result is an explicit characterization of the binary (\(\rho =2\)) primitive affine permutation groups. We also compute the precise relational complexity of \({{\mathrm{Alt}}}_n\) acting on k-sets, correcting (Cherlin in Sporadic homogeneous structures. In: The Gelfand Mathematical Seminars, 1996–1999, pp. 15–48, Birkhäuser 2000, Example 5).     

Triviality of Iwasawa module associated to some abelian fields of prime conductors

Let p be an odd prime number and \(\ell \) an odd prime number dividing \(p-1\). We denote by \(F=F_{p,\ell }\) the real abelian field of conductor p and degree \(\ell \), and by \(h_F\) the class number of F. For a prime number \(r \ne p,\,\ell \), let \(F_{\infty }\) be the cyclotomic \(\mathbb {Z}_r\)-extension over F, and \(M_{\infty }/F_{\infty }\) the maximal pro-r abelian extension unramified outside r. We prove that \(M_{\infty }\) coincides with \(F_{\infty }\) and consequently \(h_F\) is not divisible by r when r is a primitive root modulo \(\ell \) and r is smaller than an explicit constant depending on p.     

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

Ill-Posedness for the <Emphasis Type="Italic">b</Emphasis>-Family of Equations

For \(s<3/2\), it is shown that the Cauchy problem for the b-family of equations is ill-posed in Sobolev spaces \(H^s\) on both the torus and the line when \(b>1\). The proof of ill-posedness depends on the value of b, where the most interesting case arises for \(b=3\), the Degasperis–Procesi equation. Considering that the b-family of equations is locally well-posed in \(H^s\) for \(s>3/2\), this work establishes 3 / 2 as the critical index of well-posedness in Sobolev spaces for \(b>1\).     

Euclidean and Hermitian LCD MDS codes

Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual is trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault injection attacks. Non-binary LCD codes in characteristic 2 can be transformed into binary LCD codes by expansion. On the other hand, being optimal codes, maximum distance separable codes (abbreviated MDS) are of much interest from many viewpoints due to their theoretical and practical properties. However, little work has been done on LCD MDS codes. In particular, determining the existence of q-ary [n, k] LCD MDS codes for various lengths n and dimensions k is a basic and interesting problem. In this paper, we firstly study the problem of the existence of q-ary [n, k] LCD MDS codes and solve it for the Euclidean case. More specifically, we show that for \(q>3\) there exists a q-ary [n, k] Euclidean LCD MDS code, where \(0\le k \le n\le q+1\), or, \(q=2^{m}\), \(n=q+2\) and \(k= 3 \text { or } q-1\). Secondly, we investigate several constructions of new Euclidean and Hermitian LCD MDS codes. Our main techniques in constructing Euclidean and Hermitian LCD MDS codes use some linear codes with small dimension or codimension, self-orthogonal codes and generalized Reed-Solomon codes.     

2-Domination number of generalized Petersen graphs

Let \(G=(V,E)\) be a graph. A subset \(S\subseteq V\) is a k-dominating set of G if each vertex in \(V-S\) is adjacent to at least k vertices in S. The k-domination number of G is the cardinality of the smallest k-dominating set of G. In this paper, we shall prove that the 2-domination number of generalized Petersen graphs \(P(5k+1, 2)\) and \(P(5k+2, 2)\), for \(k>0\), is \(4k+2\) and \(4k+3\), respectively. This proves two conjectures due to Cheng (Ph.D. thesis, National Chiao Tung University, 2013). Moreover, we determine the exact 2-domination number of generalized Petersen graphs P(2k, k) and \(P(5k+4,3)\). Furthermore, we give a good lower and upper bounds on the 2-domination number of generalized Petersen graphs \(P(5k+1, 3), P(5k+2,3)\) and \(P(5k+3, 3).\)     

Lengths of words in transformation semigroups generated by digraphs

Given a simple digraph D on n vertices (with \(n\ge 2\)), there is a natural construction of a semigroup of transformations \(\langle D\rangle \). For any edge (a, b) of D, let \(a\rightarrow b\) be the idempotent of rank \(n-1\) mapping a to b and fixing all vertices other than a; then, define \(\langle D\rangle \) to be the semigroup generated by \(a \rightarrow b\) for all \((a,b) \in E(D)\). For \(\alpha \in \langle D\rangle \), let \(\ell (D,\alpha )\) be the minimal length of a word in E(D) expressing \(\alpha \). It is well known that the semigroup \(\mathrm {Sing}_n\) of all transformations of rank at most \(n-1\) is generated by its idempotents of rank \(n-1\). When \(D=K_n\) is the complete undirected graph, Howie and Iwahori, independently, obtained a formula to calculate \(\ell (K_n,\alpha )\), for any \(\alpha \in \langle K_n\rangle = \mathrm {Sing}_n\); however, no analogous non-trivial results are known when \(D \ne K_n\). In this paper, we characterise all simple digraphs D such that either \(\ell (D,\alpha )\) is equal to Howie–Iwahori’s formula for all \(\alpha \in \langle D\rangle \), or \(\ell (D,\alpha ) = n - \mathrm {fix}(\alpha )\) for all \(\alpha \in \langle D\rangle \), or \(\ell (D,\alpha ) = n - \mathrm {rk}(\alpha )\) for all \(\alpha \in \langle D\rangle \). We also obtain bounds for \(\ell (D,\alpha )\) when D is an acyclic digraph or a strong tournament (the latter case corresponds to a smallest generating set of idempotents of rank \(n-1\) of \(\mathrm {Sing}_n\)). We finish the paper with a list of conjectures and open problems.     

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.     

The Terwilliger algebra of the incidence graph of the Hamming graph

Let \(\varGamma \) be a distance-semiregular graph on Y, and let \(D^Y\) be the diameter of \(\varGamma \) on Y. Let \(\varDelta \) be the halved graph of \(\varGamma \) on Y. Fix \(x \in Y\). Let T and \(T'\) be the Terwilliger algebras of \(\varGamma \) and \(\varDelta \) with respect to x, respectively. Assume, for an integer i with \(1 \le 2i \le D^Y\) and for \(y,z \in \varGamma _{2i}(x)\) with \(\partial _{\varGamma }(y,z)=2\), the numbers \(|\varGamma _{2i-1}(x) \cap \varGamma (y) \cap \varGamma (z)|\) and \(|\varGamma _{2i+1}(x) \cap \varGamma (y) \cap \varGamma (z)|\) depend only on i and do not depend on the choice of y, z. The first goal in this paper is to show the relations between T-modules of \(\varGamma \) and \(T'\)-modules of \(\varDelta \). Assume \(\varGamma \) is the incidence graph of the Hamming graph H(D, n) on the vertex set Y and the set \({\mathcal {C}}\) of all maximal cliques. Then, \(\varGamma \) satisfies above assumption and \(\varDelta \) is isomorphic to H(D, n). The second goal is to determine the irreducible T-modules of \(\varGamma \). For each irreducible T-module W, we give a basis for W the action of the adjacency matrix on this basis and we calculate the multiplicity of W.     

The distortion dimension of $$\mathbb $$-rank 1 lattices

Let \(X=G/K\) be a symmetric space of noncompact type and rank \(k\ge 2\). We prove that horospheres in X are Lipschitz \((k-2)\)-connected if their centers are not contained in a proper join factor of the spherical building of X at infinity. As a consequence, the distortion dimension of an irreducible \(\mathbb {Q}\)-rank-1 lattice \(\Gamma \) in a linear, semisimple Lie group G of \(\mathbb R\)-rank k is \(k-1\). That is, given \(m< k-1\), a Lipschitz m-sphere S in (a polyhedral complex quasi-isometric to) \(\Gamma \), and a \((m+1)\)-ball B in X (or G) filling S, there is a \((m+1)\)-ball \(B'\) in \(\Gamma \) filling S such that \({{\mathrm{vol}}}B'\sim {{\mathrm{vol}}}B\). In particular, such arithmetic lattices satisfy Euclidean isoperimetric inequalities up to dimension \(k-1\).     

Anti-Ramsey Numbers of Graphs with Small Connected Components

The anti-Ramsey number, AR(n, G), for a graph G and an integer \(n\ge |V(G)|\), is defined to be the minimal integer r such that in any edge-colouring of \(K_n\) by at least r colours there is a multicoloured copy of G, namely, a copy of G that each of its edges has a distinct colour. In this paper we determine, for large enough \(n,\, AR(n,L\cup tP_2)\) and \(AR(n,L\cup kP_3)\) for any large enough t and k, and a graph L satisfying some conditions. Consequently, we determine AR(n, G), for large enough n, where G is \(P_3\cup tP_2\) for any \(t\ge 3,\, P_4\cup tP_2\) and \(C_3\cup tP_2\) for any \(t\ge 2,\, kP_3\) for any \(k\ge 3,\, tP_2\cup kP_3\) for any \(t\ge 1,\, k\ge 2\), and \(P_{t+1}\cup kP_3\) for any \(t\ge 3,\, k\ge 1\). Furthermore, we obtain upper and lower bounds for AR(n, G), for large enough n, where G is \(P_{k+1}\cup tP_2\) and \(C_k\cup tP_2\) for any \(k\ge 4,\, t\ge 1\).     

Minimal number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds

Let M be a smooth compact and simply-connected manifold with simply-connected boundary \(\partial M\), r be a fixed odd natural number. We consider f, a \(C^1\) self-map of M, preserving \(\partial M\). Under the assumption that the dimension of M is at least 4, we define an invariant \(D_r(f;M,\partial M)\) that is equal to the minimal number of r-periodic points for all maps preserving \(\partial M\) and \(C^1\)-homotopic to f. As an application, we give necessary and sufficient conditions for a reduction of a set of r-periodic points to one point in the \(C^1\)-homotopy class.     

Asymptotic diophantine approximation: the multiplicative case

Let \(\alpha \) and \(\beta \) be irrational real numbers and \(0<\varepsilon <1/30\). We prove a precise estimate for the number of positive integers \(q\le Q\) that satisfy \(\Vert q\alpha \Vert \cdot \Vert q\beta \Vert <\varepsilon \). If we choose \(\varepsilon \) as a function of Q, we get asymptotics as Q gets large, provided \(\varepsilon Q\) grows quickly enough in terms of the (multiplicative) Diophantine type of \((\alpha ,\beta )\), e.g., if \((\alpha ,\beta )\) is a counterexample to Littlewood’s conjecture, then we only need that \(\varepsilon Q\) tends to infinity. Our result yields a new upper bound on sums of reciprocals of products of fractional parts and sheds some light on a recent question of Lê and Vaaler.