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.     

Reactivity of a N-Coordinated Germylene-Borane Complex: From Ge→B to Ge→Ga Coordination

Reactivity studies of the Ge^II→B complex L(Cl)Ge⋅BH₃ ( 1 ; L=2-Et₂NCH₂-4,6-tBu₂-C₆H₂) were performed to determine the effect on the Ge^II→B donation. N-coordinated compounds L(OtBu)Ge⋅BH₃ ( 2 ) and [LGe⋅BH₃]₂ ( 3 ) were prepared. The possible tuning of the Ge^II→B interaction was proved experimentally, yielding compounds 1-PPh₂-8-(LGe)-C₁₀H₆ ( 4 ) and L(Cl)Ge⋅GaCl₃ ( 5 ) without a Ge^II→B interaction. In 5 , an unprecedented Ge^II→Ga coordination was revealed. The experimental results were complemented by a theoretical study focusing on the bonding in 1 − 5 . The different strength of the Ge^II→E (E=B, Ga) donation was evaluated by using energy decomposition analysis. The basicity of different L(X)Ge groups through proton affinity is also assessed.     

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.     

Chemistry of Pentafluorosulfanyl Derivatives and Related Analogs: From Synthesis to Applications

Pentafluorosulfanyl (SF₅)-containing compounds and corresponding analogs are a highly valuable class of fluorine-containing building blocks owing to their unique properties. The reason for that is the set of peculiar and tremendously beneficial characteristics they can impart on molecules once introduced onto them. Despite this, their application in distinct scientific fields remains modest, given the extremely harsh reaction conditions needed to access such compounds. The recent synthetic approaches via S−F, and C−SF₅ bond formation as well as the use of SF₅-containing building blocks embody a “stairway-to-heaven” loophole in the synthesis of otherwise-inaccessible chemical scaffolds only a few years ago. Herein, we report and evaluate the properties of the SF₅ group and analogs, by summarizing synthetic methodologies available to access them as well as following applications in material science and medicinal chemistry since 2015.     

Looking ahead: Joint small group detection and tracking in crowd scenes

Small group detection and tracking in crowd scenes are basis for high level crowd analysis tasks. However, it suffers from the ambiguities in generating proper groups and in handling dynamic changes of group configurations. In this paper, we propose a novel delay decision-making based method for addressing the above problems, motivated by the idea that these ambiguities can be solved using rich temporal context. Specifically, given individual detections, small group hypotheses are generated. Then candidate group hypotheses across consecutive frames and their potential associations are built in a tree. By seeking for the best non-conflicting subset from the hypothesis tree, small groups are determined and simultaneously their trajectories are got. So this framework is called joint detection and tracking. This joint framework reduces the ambiguities in small group decision and tracking by looking ahead for several frames. However, it results in the unmanageable solution space because the number of track hypotheses grows exponentially over time. To solve this problem, effective pruning strategies are developed, which can keep the solution space manageable and also improve the credibility of small groups. Experiments on public datasets demonstrate the effectiveness of our method. The method achieves the state-of-the-art performance even in noisy crowd scenes.