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.     

Regularity of optimal sets for some functional involving eigenvalues of an operator in divergence form

In this paper we consider minimizers of the functional$\min \{{\lambda }_1(\mathrm{\Omega })+\cdots +{\lambda }_k(\mathrm{\Omega })+\mathrm{\Lambda }|\mathrm{\Omega }|,:\mathrm{\Omega }\subset D\text{ open}\}$ where $D\subset {\mathbb{R}}^d$ is a bounded open set and where $0<{\lambda }_1(\mathrm{\Omega })\le \cdots \le {\lambda }_k(\mathrm{\Omega })$ are the first k eigenvalues on Ω of an operator in divergence form with Dirichlet boundary condition and with Hölder continuous coefficients. We prove that the optimal sets ${\mathrm{\Omega }}^{⁎}$ have finite perimeter and that their free boundary $\partial {\mathrm{\Omega }}^{⁎}\cap D$ is composed of a regular part, which is locally the graph of a $C^{1,\alpha }$-regular function, and a singular part, which is empty if $d<d^{⁎}$, discrete if $d=d^{⁎}$ and of Hausdorff dimension at most $d-d^{⁎}$ if $d>d^{⁎}$, for some $d^{⁎}\in \{5,6,7\}$.     

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.     

Finding any given 2‐factor in sparse pseudorandom graphs efficiently

Given an $n$‐vertex pseudorandom graph $G$ and an $n$‐vertex graph $H$ with maximum degree at most two, we wish to find a copy of $H$ in $G$, that is, an embedding $\phi :V\left(H\right)\to V\left(G\right)$ so that $\phi \left(u\right)\phi \left(v\right)\in E\left(G\right)$ for all $uv\in E\left(H\right)$. Particular instances of this problem include finding a triangle‐factor and finding a Hamilton cycle in $G$. Here, we provide a deterministic polynomial time algorithm that finds a given $H$ in any suitably pseudorandom graph $G$. The pseudorandom graphs we consider are $\left(p,\lambda \right)$‐bijumbled graphs of minimum degree which is a constant proportion of the average degree, that is, $\mathrm{\Omega }\left(pn\right)$. A $\left(p,\lambda \right)$‐bijumbled graph is characterised through the discrepancy property: $|e\left(A,B\right)?p|A||B||<\lambda \sqrt{|A||B|}$ for any two sets of vertices $A$ and $B$. Our condition $\lambda =O(p^{2}n/\log n)$ on bijumbledness is within a log factor from being tight and provides a positive answer to a recent question of Nenadov. We combine novel variants of the absorption‐reservoir method, a powerful tool from extremal graph theory and random graphs. Our approach builds on our previous work, incorporating the work of Nenadov, together with additional ideas and simplifications.