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.     

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.     

On the distance between linear codes

Let V be an n-dimensional vector space over the finite field consisting of q elements and let ${\mathrm{\Gamma }}_k(V)$ be the Grassmann graph formed by k-dimensional subspaces of V, $1<k<n-1$. Denote by $\mathrm{\Gamma }{(n,k)}_q$ the restriction of ${\mathrm{\Gamma }}_k(V)$ to the set of all non-degenerate linear ${[n,k]}_q$ codes. We show that for any two codes the distance in $\mathrm{\Gamma }{(n,k)}_q$ coincides with the distance in ${\mathrm{\Gamma }}_k(V)$ only in the case when $n<{(q+1)}^2+k-2$, i.e. if n is sufficiently large then for some pairs of codes the distances in the graphs ${\mathrm{\Gamma }}_k(V)$ and $\mathrm{\Gamma }{(n,k)}_q$ are distinct. We describe one class of such pairs.     

Approximation of maximum of Gaussian random fields

This contribution is concerned with Gumbel limiting results for supremum ${\mathbb{M}}_{\mathit{n}}={\sup }_{\mathit{t}\in [\mathbf{0},{\mathit{T}}_{\mathit{n}}]}?|X_{\mathit{n}}(\mathit{t})|$ with $X_{\mathit{n}},\mathit{n}\in {\mathbb{N}}^2$ centered Gaussian random fields with continuous trajectories. We show first the convergence of a related point process to a Poisson point process thereby extending previous results obtained in [8] for Gaussian processes. Furthermore, we derive Gumbel limit results for ${\mathbb{M}}_{\mathit{n}}$ as $\mathit{n}\to \infty$ and show a second-order approximation for $\mathbb{E}{\{{\mathbb{M}}_{\mathit{n}}^p\}}^{1/p}$ for any $p\ge 1$.     

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.     

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.     

Untangling polygons and graphs

Untangling is a process in which some vertices of a plane graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph $C_n$ while keeping at least $\mathrm{\Omega }(n^{2/3})$ vertices fixed. For any graph G, we also present an upper bound for the number of fixed vertices in the worst case. The bound is a function of the number of vertices, maximum degree and diameter of G. One of its consequences is the upper bound $O({(n\log n)}^{2/3})$ for all 3-vertex-connected planar graphs.