The E-normal structure of odd dimensional unitary groups

In this paper we define odd dimensional unitary groups ${\mathrm{U}}_{2n+1}(R,\mathrm{\Delta })$. These groups contain as special cases the odd dimensional general linear groups ${\mathrm{GL}}_{2n+1}(R)$ where R is any ring, the odd dimensional orthogonal and symplectic groups ${\mathrm{O}}_{2n+1}(R)$ and ${\mathrm{Sp}}_{2n+1}(R)$ where R is any commutative ring and further the first author's even dimensional unitary groups ${\mathrm{U}}_{2n}(R,\mathrm{\Lambda })$ where $(R,\mathrm{\Lambda })$ is any form ring. We classify the E-normal subgroups of the groups ${\mathrm{U}}_{2n+1}(R,\mathrm{\Delta })$ (i.e. the subgroups which are normalized by the elementary subgroup ${\mathrm{EU}}_{2n+1}(R,\mathrm{\Delta })$), under the condition that R is either a semilocal or quasifinite ring with involution and $n\ge 3$. Further we investigate the action of ${\mathrm{U}}_{2n+1}(R,\mathrm{\Delta })$ by conjugation on the set of all E-normal subgroups.     

Compact simple Lie groups admitting left-invariant Einstein metrics that are not geodesic orbit

In this article, we prove that the compact simple Lie groups $\mathrm{S}\mathrm{U}(n)$ for $n\ge 6$, $\mathrm{S}\mathrm{O}(n)$ for $n\ge 7$, $\mathrm{S}\mathrm{p}(n)$ for $n\ge 3$, ${\mathrm{E}}_6,{\mathrm{E}}_7,{\mathrm{E}}_8$, and ${\mathrm{F}}_4$ admit left-invariant Einstein metrics that are not geodesic orbit. This gives a positive answer to an open problem recently posed by Nikonorov.     

Construction of quasi-cyclic self-dual codes

There is a one-to-one correspondence between ?-quasi-cyclic codes over a finite field ${\mathbb{F}}_q$ and linear codes over a ring $R={\mathbb{F}}_q[Y]/(Y^m?1)$. Using this correspondence, we prove that every ?-quasi-cyclic self-dual code of length m? over a finite field ${\mathbb{F}}_q$ can be obtained by the building-up construction, provided that $\mathrm{char}({\mathbb{F}}_q)=2$ or $q\equiv 1(\mathrm{mod}4)$, m is a prime p, and q is a primitive element of ${\mathbb{F}}_p$. We determine possible weight enumerators of a binary ?-quasi-cyclic self-dual code of length p? (with p a prime) in terms of divisibility by p. We improve the result of Bonnecaze et al. (2003) [3] by constructing new binary cubic (i.e., ?-quasi-cyclic codes of length 3?) optimal self-dual codes of lengths $30,36,42,48$ (Type I), 54 and 66. We also find quasi-cyclic optimal self-dual codes of lengths 40, 50, and 60. When $m=5$, we obtain a new 8-quasi-cyclic self-dual $[40,20,12]$ code over ${\mathbb{F}}_3$ and a new 6-quasi-cyclic self-dual $[30,15,10]$ code over ${\mathbb{F}}_4$. When $m=7$, we find a new 4-quasi-cyclic self-dual $[28,14,9]$ code over ${\mathbb{F}}_4$ and a new 6-quasi-cyclic self-dual $[42,21,12]$ code over ${\mathbb{F}}_4$.     

The mod 2 cohomology of the mapping class group of the Klein bottle with marked points

The purpose of this article is to compute the mod 2 cohomology of ${\mathrm{\Gamma }}^q(\mathbb{K})$, the mapping class group of the Klein bottle with q marked points. We provide a concrete construction of Eilenberg–MacLane spaces $X_q=K({\mathrm{\Gamma }}^q(\mathbb{K}),1)$ and fiber bundles $F_q(\mathbb{K})/{\mathrm{\Sigma }}_q\to X_q\to B({\mathbb{Z}}_2\times O(2))$, where $F_q(\mathbb{K})/{\mathrm{\Sigma }}_q$ denotes the configuration space of unordered q-tuples of distinct points in $\mathbb{K}$ and $B({\mathbb{Z}}_2\times O(2))$ is the classifying space of the group ${\mathbb{Z}}_2\times O(2)$. Moreover, we show the mod 2 Serre spectral sequence of the bundle above collapses.     

Efficient exponential-time algorithms for edit distance between unordered trees

The edit distance problem for rooted unordered trees is known to be NP-hard. Based on this fact, this paper studies exponential-time algorithms for the problem. For a general case, an $O(\min ({1.26}^{n_1+n_2},2^{b_1+b_2}\cdot \text{<mi mathvariant="italic" is="true">poly</mi>}(n_1,n_2)))$ time algorithm is presented, where $n_1$ and $n_2$ are the numbers of nodes and $b_1$ and $b_2$ are the numbers of branching nodes in two input trees. This algorithm is obtained by a combination of dynamic programming, exhaustive search, and maximum weighted bipartite matching. For bounded degree trees over a fixed alphabet, it is shown that the problem can be solved in $O({(1+ϵ)}^{n_1+n_2})$ time for any fixed $ϵ>0$. This result is achieved by avoiding duplicate calculations for identical subsets of small subtrees.     

On maximizing the fundamental frequency of the complement of an obstacle

Let $\mathrm{\Omega }?{\mathbb{R}}^n$ be a bounded domain satisfying a Hayman-type asymmetry condition, and let D be an arbitrary bounded domain referred to as an “obstacle”. We are interested in the behavior of the first Dirichlet eigenvalue ${\lambda }_1(\mathrm{\Omega }?(x+D))$.First, we prove an upper bound on ${\lambda }_1(\mathrm{\Omega }?(x+D))$ in terms of the distance of the set $x+D$ to the set of maximum points $x_0$ of the first Dirichlet ground state ${?}_{{\lambda }_1}>0$ of Ω. In short, a direct corollary is that if

(1)${\mu }_{\mathrm{\Omega }}:=\underset{x}{\max }?{\lambda }_1(\mathrm{\Omega }?(x+D))$

is large enough in terms of ${\lambda }_1(\mathrm{\Omega })$, then all maximizer sets $x+D$ of ${\mu }_{\mathrm{\Omega }}$ are close to each maximum point $x_0$ of ${?}_{{\lambda }_1}$.Second, we discuss the distribution of ${?}_{{\lambda }_1(\mathrm{\Omega })}$ and the possibility to inscribe wavelength balls at a given point in Ω.Finally, we specify our observations to convex obstacles D and show that if ${\mu }_{\mathrm{\Omega }}$ is sufficiently large with respect to ${\lambda }_1(\mathrm{\Omega })$, then all maximizers $x+D$ of ${\mu }_{\mathrm{\Omega }}$ contain all maximum points $x_0$ of ${?}_{{\lambda }_1(\mathrm{\Omega })}$.