Quantum MDS codes with new length and large minimum distance

According to the well-known CSS construction, constructing quantum MDS codes are extensively investigated via Hermitian self-orthogonal generalized Reed-Solomon (GRS) codes. In this paper, given two Hermitian self-orthogonal GRS codes $GR{S}_{k_1}(A,{\mathit{v}}_A)$ and $GR{S}_{k_2}(B,{\mathit{v}}_B)$, we propose a sufficient condition to ensure that $GR{S}_k(A\cup B,{\mathit{v}}_{A\cup B})$ is still a Hermitian self-orthogonal code. Consequently, we first present a new general construction of infinitely families of quantum MDS codes from known ones. Moreover, applying the trace function and norm function over finite fields, we give another two new constructions of quantum MDS codes with flexible parameters. It turns out that the forms of the lengths of our quantum MDS codes are quite different from previous known results in the literature. Meanwhile, the minimum distances of all the q-ary quantum MDS codes are bigger than $q/2+1$.     

A note on the Hambleton-Taylor-Williams conjecture

I. Hambleton, L. Taylor and B. Williams conjectured a general formula in the spirit of H. Lenstra for the decomposition of $G_n(RG)$ for any finite group G and noetherian ring R. The conjectured decomposition was shown to hold for some large classes of finite groups. D. Webb and D. Yao discovered that the conjecture failed for the symmetric group $S_5$, but remarked that it still might be reasonable to expect the HTW-decomposition for solvable groups. In this paper we show that the solvable group $\mathrm{SL}(2,{\mathbb{F}}_3)$ is also a counterexample to the conjectured HTW-decomposition. Nevertheless, we prove that for any finite group G the rank of $G_1(\mathbb{Z}G)$ does not exceed the rank of the expression in the HTW-decomposition. We also show that the HTW-decomposition predicts correct torsion for $G_1(\mathbb{Z}G)$ for any finite group G. Furthermore, we prove that for any degree other than $n=1$ the conjecture gives a correct prediction for the rank of $G_n(\mathbb{Z}G)$.     

Point partition numbers: Decomposable and indecomposable critical graphs

Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number ${\chi }_t(G)$ is the least integer k for which G admits a coloring with k colors such that each color class induces a $(t?1)$-degenerate subgraph of G. So ${\chi }_1$ is the chromatic number and ${\chi }_2$ is the point arboricity. The point partition number ${\chi }_t$ with $t\ge 1$ was introduced by Lick and White. A graph G is called ${\chi }_t$-critical if every proper subgraph H of G satisfies ${\chi }_t(H)<{\chi }_t(G)$. In this paper we prove that if G is a ${\chi }_t$-critical graph whose order satisfies $|G|\le 2{\chi }_t(G)?2$, then G can be obtained from two non-empty disjoint subgraphs $G_1$ and $G_2$ by adding t edges between any pair $u,v$ of vertices with $u\in V(G_1)$ and $v\in V(G_2)$. Based on this result we establish the minimum number of edges possible in a ${\chi }_t$-critical graph G of order n and with ${\chi }_t(G)=k$, provided that $n\le 2k?1$ and t is even. For $t=1$ the corresponding two results were obtained in 1963 by Tibor Gallai.     

Construction and enumeration of left dihedral codes satisfying certain duality properties

Let ${\mathbb{F}}_q$ be the finite field of q elements and let $D_{2n}=〈x,y|x^n=1,y^2=1,yxy=x^{n?1}〉$ be the dihedral group of 2n elements. Left ideals of the group algebra ${\mathbb{F}}_q[D_{2n}]$ are known as left dihedral codes over ${\mathbb{F}}_q$ of length 2n, and abbreviated as left $D_{2n}$-codes. Let $\gcd (n,q)=1$. In this paper, we give an explicit representation for the Euclidean hull of every left $D_{2n}$-code over ${\mathbb{F}}_q$. On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left $D_{2n}$-codes over ${\mathbb{F}}_q$. In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left $D_{2n}$-codes and self-dual left $D_{2n}$-codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left $D_{2n}$-code over ${\mathbb{F}}_q$, and present several numerical examples to illustrative our applications.     

On the chromatic number of some P5-free graphs

Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, $V(H)$ can be partitioned into A and B such that $H[A]$ is perfect and $\omega (H[B])<\omega (H)$. We use $P_t$ and $C_t$ to denote a path and a cycle on t vertices, respectively. For two disjoint graphs $F_1$ and $F_2$, we use $F_1\cup F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)$, and use $F_1+F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)\cup \{xy|x\in V(F_1)\text{ and }y\in V(F_2)\}$. In this paper, we prove that (i) $(P_5,C_5,K_{2,3})$-free graphs are perfectly divisible, (ii) $\chi (G)\le 2{\omega }^2(G)?\omega (G)?3$ if G is $(P_5,K_{2,3})$-free with $\omega (G)\ge 2$, (iii) $\chi (G)\le \frac{3}{2}({\omega }^2(G)?\omega (G))$ if G is $(P_5,K_1+2K_2)$-free, and (iv) $\chi (G)\le 3\omega (G)+11$ if G is $(P_5,K_1+(K_1\cup K_3))$-free.     

The component counts of random functions

Consider functions $f:A\to A\cup C$, where A and C are disjoint finite sets. The weakly connected components of the digraph of such a function are cycles of rooted trees, as in random mappings, and isolated rooted trees. Let $n_1=|A|$ and $n_3=|C|$. When a function is chosen from all ${(n_1+n_3)}^{n_1}$ possibilities uniformly at random, then we find the following limiting behaviour as $n_1\to \infty$. If $n_3=o(n_1)$, then the size of the maximal mapping component goes to infinity almost surely; if $n_3～\gamma n_1$, $\gamma >0$ a constant, then process counting numbers of mapping components of different sizes converges; if $n_1=o(n_3)$, then the number of mapping components converges to 0 in probability. We get estimates on the size of the largest tree component which are of order $\log ?n_3$ when $n_3～\gamma n_1$ and constant when $n_3～n_1^{\alpha }$, $\alpha >1$. These results are similar to ones obtained previously for random injections, for which the weakly connected components are cycles and linear trees.     

On color isomorphic subdivisions

Given a graph H and an integer $k?2$, let $f_k(n,H)$ be the smallest number of colors C such that there exists a proper edge-coloring of the complete graph $K_n$ with C colors containing no k vertex-disjoint color isomorphic copies of H. In this paper, we prove that $f_2(n,H_t)=\mathrm{\Omega }(n^{1+\frac{1}{2t?3}})$ where $H_t$ is the 1-subdivision of the complete graph $K_t$. This answers a question of Conlon and Tyomkyn (2021) [4].     

Multiplicative preprojective algebras of Dynkin quivers

For a commutative ring R and an ADE Dynkin quiver Q, we prove that the multiplicative preprojective algebra of Crawley-Boevey and Shaw, with parameter $q=1$, is isomorphic to the (additive) preprojective algebra as R-algebras if and only if the bad primes for Q – 2 in type D, 2 and 3 for $Q=E_6$, $E_7$ and 2, 3 and 5 for $Q=E_8$ – are invertible in R. We construct an explicit isomorphism over $\mathbb{Z}[1/2]$ in type D, over $\mathbb{Z}[1/2,1/3]$ for $Q=E_6$, $E_7$ and over $\mathbb{Z}[1/2,1/3,1/5]$ for $Q=E_8$. Conversely, if some bad prime is not invertible in R, we show that the additive and multiplicative preprojective algebras differ in zeroth Hochschild homology, and hence are not isomorphic. In fact, one only needs the vanishing of certain classes in zeroth Hochschild homology of the multiplicative preprojective algebra, utilizing a rigidification argument for isomorphisms that may be of independent interest.In the setting of Ginzburg dg-algebras, our obstructions are new in type E and give a more elementary proof of the negative result of Etgü–Lekili [5, Theorem 13] in type D. Moreover, the zeroth Hochschild homology of the multiplicative preprojective algebra, computed in Section 4, can be interpreted as the space of unobstructed deformations of the multiplicative Ginzburg dg-algebra by Van den Bergh duality. Finally, we observe that the multiplicative preprojective algebra is not symmetric Frobenius if $Q\ne A_1$, a departure from the additive preprojective algebra in characteristic 2 for $Q=D_{2n}$, $n\ge 2$ and $Q=E_7$, $E_8$.