Parabolic subgroups in FC-type Artin groups

Parabolic subgroups are the building blocks of Artin groups. This paper extends previous results of Cumplido, Gebhardt, Gonzales-Meneses and Wiest, known only for parabolic subgroups of finite type Artin groups, to parabolic subgroups of FC-type Artin groups. We show that the class of finite type parabolic subgroups is closed under intersection. We also study an analog of the curve complex for mapping class group constructed by Cumplido et al. using parabolic subgroups. We extend the construction of this complex, called the complex of parabolic subgroups, to FC-type Artin groups. We show that this simplicial complex is, in most cases, infinite diameter and conjecture that it is δ-hyperbolic.     

The Coordination Chemistry of f-Block Elements in Molten Salts

The coordination chemistry of f-block elements (lanthanide and actinide) in molten salts has become a resounding topic in view of its great importance to the research and development (R&D) of molten salt reactors and pyroprocessing. In this Review article, a general overview of the coordination chemistry of f-block elements in molten salts is provided including past achievements and recent advances. Particular emphases are placed on the oxidation state, speciation, and solution structure of f-block metal ions in molten salts, as well as their relationships with the salt composition. Furthermore, this review briefly discusses the spectroscopic and theoretical methods that complement each other in revealing the coordination properties.     

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.     

Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Positive ground state solutions for Schrödinger–Poisson system with critical nonlocal term in ℝ3

This paper is dedicated to studying the following Schrödinger–Poisson system $$\left\{\begin{array}{ll}-\mathrm{\Delta }u+V(x)u-K(x)\varphi |u{|}^{3}u=a(x)f(u),& x\in {ℝ}^3,\\ -\mathrm{\Delta }\varphi =K(x)|u{|}^5,& x\in {ℝ}^3.\end{array}\right.$$ Under some different assumptions on functions V(x), K(x), a(x) and f(u), by using the variational approach, we establish the existence of positive ground state solutions.