Higher genus Kashiwara–Vergne problems and the Goldman–Turaev Lie bialgebra

We define a family ${\mathrm{KV}}^{(g,n+1)}$ of Kashiwara–Vergne problems associated with compact connected oriented 2-manifolds of genus g with $n+1$ boundary components. The problem ${\mathrm{KV}}^{(0,3)}$ is the classical Kashiwara–Vergne problem from Lie theory. We show the existence of solutions to ${\mathrm{KV}}^{(g,n+1)}$ for arbitrary g and n. The key point is the solution to ${\mathrm{KV}}^{(1,1)}$ based on the results by B. Enriquez on elliptic associators. Our construction is motivated by applications to the formality problem for the Goldman–Turaev Lie bialgebra ${\mathfrak{g}}^{(g,n+1)}$. In more detail, we show that every solution to ${\mathrm{KV}}^{(g,n+1)}$ induces a Lie bialgebra isomorphism between ${\mathfrak{g}}^{(g,n+1)}$ and its associated graded $\mathrm{gr}{\mathfrak{g}}^{(g,n+1)}$. For $g=0$, a similar result was obtained by G. Massuyeau using the Kontsevich integral. For $g\ge 1$, $n=0$, our results imply that the obstruction to surjectivity of the Johnson homomorphism provided by the Turaev cobracket is equivalent to the Enomoto–Satoh obstruction.     

Self-complementary magic squares of doubly even orders

A magic square $M$ in which the entries consist of consecutive integers from $1,2,\dots ,n^2$ is said to be self-complementary of order$n$ if the resulting square obtained from $M$ by replacing each entry $i$ by $n^2+1?i$ is equivalent to $M$ (under rotation or reflection). We present a new construction for self-complementary magic squares of order $n$ for each $n\ge 4$, where $n$ is a multiple of $4$.     

A note on conservative galaxies,Skolem systems,cyclic cycle decompositions,and Heffter arrays

The conservative number of a graph $G$ is the minimum positive integer $M$, such that $G$ admits an orientation and a labeling of its edges by distinct integers in $\{1,2,\dots ,M\}$, such that at each vertex of degree at least three, the sum of the labels on the in-coming edges is equal to the sum of the labels on the out-going edges. A graph is conservative if $M=\left|E\left(G\right)\right|$. It is worth noting that determining whether certain biregular graphs are conservative is equivalent to find integer Heffter arrays.In this work we show that the conservative number of a galaxy (a disjoint union of stars) of size $M$ is $M$ for $M\equiv 0$, $3(mod4)$, and $M+1$ otherwise. Consequently, given positive integers $m_1$, $m_2$, …, $m_n$ with $m_i\ge 3$ for $1\le i\le n$, we construct a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of infinitely many circulant graphs, generalizing a result of Bryant, Gavlas and Ling (2003). In particular, it allows us to construct a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of the complete graph $K_{2M+1}$, where $M={\sum }_{i=1}^n{m}_i$. Also, we prove necessary and sufficient conditions for the existence of a cyclic $(m_1,m_2,\dots ,m_n)$-cycle system of $K_{2M+2}?F$, where $F$ is a 1-factor. Furthermore, we give a sufficient condition for a subset of ${\mathbb{Z}}_v?\left\{0\right\}$ to be sequenceable.     

Matrix completion problems over integral domains: The case with a diagonal of prescribed blocks

Let $\mathfrak{R}$ be an arbitrary integral domain, let $\wedge =\{{\lambda }_1\text{,}\dots \text{,}{\lambda }_n\}$ be a multiset of elements of $\mathfrak{R}$, let $\sigma$ be a permutation of $\{1\text{,}\dots \text{,}k\}$ let $n_1\text{,}\dots \text{,}{n}_k$ be positive integers such that $n_1+?+n_k=n$, and for $r=1\text{,}\dots \text{,}k$ let $A_r\in {\mathfrak{R}}^{n_r\times n_{\sigma (r)}}$. We are interested in the problem of finding a block matrix $Q={\left[Q_{\mathit{rs}}\right]}_{r\text{,}s=1}^k\in {\mathfrak{R}}^{n\times n}$ with spectrum $\mathrm{\Lambda }$ and such that $Q_{r\sigma (r)}=A_r$ for $r=1\text{,}\dots \text{,}k$. Cravo and Silva completely characterized the existence of such a matrix when $\mathfrak{R}$ is a field. In this work we construct a solution matrix $Q$ that solves the problem when $\mathfrak{R}$ is an integral domain with two exceptions: (i) $k=2$; (ii) $k\ge 3$, $\sigma (r)=r$ and $n_r>n/2$ for some $r$.What makes this work quite unique in this area is that we consider the problem over the more general algebraic structure of integral domains, which includes the important case of integers. Furthermore, we provide an explicit and easy to implement finite step algorithm that constructs an specific solution matrix (we point out that Cravo and Silva’s proof is not constructive).     

Positive block matrices and numerical ranges

Any positive matrix M partitioned in four n-by-n blocks satisfies the unitarily invariant norm inequality $6M6\le 6M_{1,1}+M_{2,2}+\omega I6$, where ω is the width of the numerical range of $M_{1,2}$. Some related inequalities and a reverse Lidskii majorization are given.     

Y spaces and global smooth solution of fractional Navier–Stokes equations with initial value in the critical oscillation spaces

For fractional Navier–Stokes equations and critical initial spaces X, one used to establish the well-posedness in the solution space which is contained in $C({\mathbb{R}}_{+},X)$. In this paper, for heat flow, we apply parameter Meyer wavelets to introduce Y spaces $Y^{m,\beta }$ where $Y^{m,\beta }$ is not contained in $C({\mathbb{R}}_{+},{\dot{B}}_{\infty }^{1?2\beta ,\infty })$. Consequently, for $\frac{1}{2}<\beta <1$, we establish the global well-posedness of fractional Navier–Stokes equations with small initial data in all the critical oscillation spaces. The critical oscillation spaces may be any Besov–Morrey spaces ${({\dot{B}}_{p,q}^{{\gamma }_1,{\gamma }_2}({\mathbb{R}}^n))}^n$ or any Triebel–Lizorkin–Morrey spaces ${({\dot{F}}_{p,q}^{{\gamma }_1,{\gamma }_2}({\mathbb{R}}^n))}^n$ where $1\le p,q\le \infty ,0\le {\gamma }_2\le \frac{n}{p},{\gamma }_1?{\gamma }_2=1?2\beta$. These critical spaces include many known spaces. For example, Besov spaces, Sobolev spaces, Bloch spaces, Q-spaces, Morrey spaces and Triebel–Lizorkin spaces etc.     

Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six

A cyclic ${(n,d,w)}_q$ code is a $q$-ary cyclic code of length $n$, minimum Hamming distance $d$ and weight $w$. In this paper, we investigate cyclic ${(n,6,4)}_3$ codes. A new upper bound on $C{A}_3(n,6,4)$, the largest possible number of codewords in a cyclic ${(n,6,4)}_3$ code, is given. Two new constructions for optimal cyclic ${(n,6,4)}_3$ codes based on cyclic $(n,4,1)$ difference packings are presented. As a consequence, the exact value of $C{A}_3(n,6,4)$ is determined for any positive integer $n\equiv 0,6,18(mod24)$. We also obtain some other infinite classes of optimal cyclic ${(n,6,4)}_3$ codes.