Classification of homogeneous holomorphic two-spheres in complex Grassmann manifolds

In this paper we completely classify the linearly full homogeneous holomorphic two-spheres in the complex Grassmann manifolds $G(2,N)$ and $G(3,N)$. We also obtain the Gauss equation for the holomorphic immersions from a Riemann surface into $G(k,N)$. By using which, we give explicit expressions of the Gaussian curvature and the square of the length of the second fundamental form of these homogeneous holomorphic two-spheres in $G(2,N)$ and $G(3,N)$.     

Graded-division algebras and Galois extensions

Graded-division algebras are building blocks in the theory of finite-dimensional associative algebras graded by a group G. If G is abelian, they can be described, using a loop construction, in terms of central simple graded-division algebras.On the other hand, given a finite abelian group G, any central simple G-graded-division algebra over a field $\mathbb{F}$ is determined, thanks to a result of Picco and Platzeck, by its class in the (ordinary) Brauer group of $\mathbb{F}$ and the isomorphism class of a G-Galois extension of $\mathbb{F}$.This connection is used to classify the simple G-Galois extensions of $\mathbb{F}$ in terms of a Galois field extension $\mathbb{L}/\mathbb{F}$ with Galois group isomorphic to a quotient $G/K$ and an element in the quotient ${\mathrm{\text{Z}}}^2(K,{\mathbb{L}}^{\times })/{\mathrm{\text{B}}}^2(K,{\mathbb{F}}^{\times })$ subject to certain conditions. Non-simple G-Galois extensions are induced from simple T-Galois extensions for a subgroup T of G. We also classify finite-dimensional G-graded-division algebras and, as an application, finite G-graded-division rings.     

On distance-regular Cayley graphs of generalized dicyclic groups

Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of $G?\{1\}$ is called minimal if $〈S〉=G$ and there exists some $s\in S$ such that $〈S?\{s,s^{?1}\}〉\ne G$. In this paper, we characterize distance-regular Cayley graphs $\mathrm{Cay}(G,S)$ of G under the condition that S is minimal.     

A tight bound for conflict-free coloring in terms of distance to cluster

Given an undirected graph $G=(V,E)$, a conflict-free coloring with respect to open neighborhoods (CFON coloring) is a vertex coloring such that every vertex has a uniquely colored vertex in its open neighborhood. The minimum number of colors required for such a coloring is the CFON chromatic number of G, denoted by ${\chi }_{ON}(G)$.In previous work [WG 2020], we showed the upper bound ${\chi }_{ON}(G)\le \mathsf{dc}(G)+3$, where $\mathsf{dc}(G)$ denotes the distance to cluster parameter of G. In this paper, we obtain the improved upper bound of ${\chi }_{ON}(G)\le \mathsf{dc}(G)+1$. We also exhibit a family of graphs for which ${\chi }_{ON}(G)>\mathsf{dc}(G)$, thereby demonstrating that our upper bound is tight.     

Graphs with nullity 2c(G)+p(G)−1

Let G be a connected graph with $n(G)$ vertices and $e(G)$ edges. The nullity of G, denoted by $\eta (G)$, is the multiplicity of eigenvalue zero of the adjacency matrix of G. Ma, Wong and Tian (2016) proved that $\eta (G)\le 2c(G)+p(G)?1$ unless G is a cycle of order a multiple of 4, where $c(G)=e(G)?n(G)+1$ is the elementary cyclic number of G and $p(G)$ is the number of leaves of G. Recently, Chang, Chang and Zheng (2020) characterized the leaf-free graphs with nullity $2c(G)?1$, thus leaving the problem to characterize connected graphs G with nullity $2c(G)+p(G)?1$ when $p(G)\ne 0$. In this paper, we solve this problem completely.