On the structure of certain valued fields

In this article, we study the structure of finitely ramified mixed characteristic valued fields. For any two complete discrete valued fields $K_1$ and $K_2$ of mixed characteristic with perfect residue fields, we show that if the n-th residue rings are isomorphic for each $n\ge 1$, then $K_1$ and $K_2$ are isometric and isomorphic. More generally, for $n_1\ge 1$, there is $n_2$ depending only on the ramification indices of $K_1$ and $K_2$ such that any homomorphism from the $n_1$-th residue ring of $K_1$ to the $n_2$-th residue ring of $K_2$ can be lifted to a homomorphism between the valuation rings. Moreover, we get a functor from the category of certain principal Artinian local rings of length n to the category of certain complete discrete valuation rings of mixed characteristic with perfect residue fields, which naturally generalizes the functorial property of unramified complete discrete valuation rings. Our lifting result improves Basarab's relative completeness theorem for finitely ramified henselian valued fields, which solves a question posed by Basarab, in the case of perfect residue fields.     

Linearity and classification of ZpZp2-linear generalized Hadamard codes

The ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-additive codes are subgroups of ${\mathbb{Z}}_p^{{\alpha }_1}\times {\mathbb{Z}}_{p^2}^{{\alpha }_2}$, and can be seen as linear codes over ${\mathbb{Z}}_p$ when ${\alpha }_2=0$, ${\mathbb{Z}}_{p^2}$-additive codes when ${\alpha }_1=0$, or ${\mathbb{Z}}_2{\mathbb{Z}}_4$-additive codes when $p=2$. A ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear generalized Hadamard (GH) code is a GH code over ${\mathbb{Z}}_p$ which is the Gray map image of a ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-additive code. Recursive constructions of ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-additive GH codes of type $({\alpha }_1,{\alpha }_2;t_1,t_2)$ with $t_1,t_2\ge 1$ are known. In this paper, we generalize some known results for ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes with $p=2$ to any $p\ge 3$ prime when ${\alpha }_1\ne 0$, and then we compare them with the ones obtained when ${\alpha }_1=0$. First, we show for which types the corresponding ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes are nonlinear over ${\mathbb{Z}}_p$. Then, for these codes, we compute the kernel and its dimension, which allow us to classify them completely. Moreover, by computing the rank of some of these codes, we show that, unlike ${\mathbb{Z}}_4$-linear Hadamard codes, the ${\mathbb{Z}}_{p^2}$-linear GH codes are not included in the family of ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes with ${\alpha }_1\ne 0$ when $p\ge 3$ prime. Indeed, there are some families with infinite nonlinear ${\mathbb{Z}}_p{\mathbb{Z}}_{p^2}$-linear GH codes, where the codes are not equivalent to any ${\mathbb{Z}}_{p^s}$-linear GH code with $s\ge 2$.     

Fractional chromatic numbers of tensor products of three graphs

The tensor product $(G_1,G_2,G_3)$ of graphs $G_1$, $G_2$ and $G_3$ is defined by $V(G_1,G_2,G_3)=V\left(G_1\right)\times V\left(G_2\right)\times V\left(G_3\right)$and $E(G_1,G_2,G_3)=\left\{\left((u_1,u_2,u_3),(v_1,v_2,v_3)\right):\left|\{i:(u_i,v_i)\in E\left(G_i\right)\}\right|\ge 2\right\}.$Let ${\chi }_f\left(G\right)$ be the fractional chromatic number of a graph $G$. In this paper, we prove that if one of the three graphs $G_1$, $G_2$ and $G_3$ is a circular clique, ${\chi }_f(G_1,G_2,G_3)=min\{{\chi }_f\left(G_1\right){\chi }_f\left(G_2\right),{\chi }_f\left(G_1\right){\chi }_f\left(G_3\right),{\chi }_f\left(G_2\right){\chi }_f\left(G_3\right)\}.$     

Two disjoint shortest paths problem with non-negative edge length

In the two disjoint shortest paths problem ( 2-DSPP), the input is a graph (or a digraph) and its vertex pairs $(s_1,t_1)$ and $(s_2,t_2)$, and the objective is to find two vertex-disjoint paths $P_1$ and $P_2$ such that $P_i$ is a shortest path from $s_i$ to $t_i$ for $i=1,2$, if they exist. In this paper, we give a first polynomial-time algorithm for the undirected version of the 2-DSPP with an arbitrary non-negative edge length function.     

Gerstenhaber bracket on Hopf algebra and Hochschild cohomologies

We calculate the Gerstenhaber bracket on Hopf algebra and Hochschild cohomologies of the Taft algebra $T_p$ for any integer $p>2$ which is a nonquasi-triangular Hopf algebra. We show that the bracket is indeed zero on Hopf algebra cohomology of $T_p$, as in all known quasi-triangular Hopf algebras. This example is the first known bracket computation for a nonquasi-triangular algebra. Also, we find a general formula for the bracket on Hopf algebra cohomology of any Hopf algebra with bijective antipode on the bar resolution that is reminiscent of Gerstenhaber's original formula for Hochschild cohomology.     

Minimal reversible nonsymmetric rings

Marks showed that ${\mathbb{F}}_2{Q}_8$, the ${\mathbb{F}}_2$ group algebra over the quaternion group, is a reversible nonsymmetric ring, then questioned whether or not this ring is minimal with respect to cardinality. In this work, it is shown that the cardinality of a minimal reversible nonsymmetric ring is indeed 256. Furthermore, it is shown that although ${\mathbb{F}}_2{Q}_8$ is a duo ring, there are also examples of minimal reversible nonsymmetric rings which are nonduo.     

Construction of extremal Type II Z2k-codes

We give methods for constructing many self-dual ${\mathbb{Z}}_m$-codes and Type II ${\mathbb{Z}}_{2k}$-codes of length 2n starting from a given self-dual ${\mathbb{Z}}_m$-code and Type II ${\mathbb{Z}}_{2k}$-code of length 2n, respectively. As an application, we construct extremal Type II ${\mathbb{Z}}_{2k}$-codes of length 24 for $k=4,5,\dots ,20$ and extremal Type II ${\mathbb{Z}}_{2k}$-codes of length 32 for $k=4,5,\dots ,10$. We also construct new extremal Type II ${\mathbb{Z}}_4$-codes of lengths 56 and 64.     

Spanning trees with at most 4 leaves in K1,5-free graphs

In 2009, Kyaw proved that every $n$-vertex connected $K_{1,4}$-free graph $G$ with ${\sigma }_4\left(G\right)\ge n?1$ contains a spanning tree with at most 3 leaves. In this paper, we prove an analogue of Kyaw’s result for connected $K_{1,5}$-free graphs. We show that every $n$-vertex connected $K_{1,5}$-free graph $G$ with ${\sigma }_5\left(G\right)\ge n?1$ contains a spanning tree with at most 4 leaves. Moreover, the degree sum condition “${\sigma }_5\left(G\right)\ge n?1$” is best possible.     

Uniqueness of certain Fourier-Jacobi models over finite fields

In this paper, we prove the uniqueness of certain Fourier-Jacobi models for the split exceptional group ${\mathrm{G}}_2$ over finite fields with odd characteristic. Similar results are also proved for ${\mathrm{Sp}}_4$ and ${\mathrm{U}}_4$.     

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.     

Standing waves for the NLS on the double-bridge graph and a rational–irrational dichotomy

We study standing waves of NLS equation posed on the double-bridge graph: two semi-infinite half-lines attached at a circle. At the two vertices Kirchhoff boundary conditions are imposed. The configuration of the graph is characterized by two lengths, $L_1$ and $L_2$. We study the solutions with possibly nontrivial components on the half-lines and a cnoidal component on the circle. The problem is equivalent to a nonlinear boundary value problem in which the boundary condition depends on the spectral parameter ω. After classifying the solutions with rational $L_1/L_2$, we turn to $L_1/L_2$ irrational showing that there exist standing waves only in correspondence to a countable set of negative frequencies ${\omega }_n$. Moreover we show that the frequency sequence admits cluster points and any negative real number can be a limit point of frequencies choosing a suitable irrational geometry $L_1/L_2$. These results depend on basic properties of diophantine approximation of real numbers.