Klingen $${\mathfrak {p}}^2$$ p 2 vectors for $$\mathrm{GSp}(4)$$ GSp ( 4 )

The Ramanujan Journal - We calculate the dimensions of the spaces of invariant vectors under the Klingen congruence subgroup of level $${\mathfrak {p}}^2$$ for all irreducible, admissible...     

Visible-light-induced,autopromoted nickel-catalyzed three-component arylsulfonation of 1,3-enynes and mechanistic insights

Science China Chemistry - A light-induced, nickel-catalyzed three-component arylsulfonation of 1,3-enynes in the absence of photocatalyst is reported. This methodology exhibited mild conditions,...     

砂土串囊式充气锚杆承载力的研究

在砂土地层中,串囊式充气锚杆的研究还比较少,其承载特性及受力机理尚不明确。本文基于莫尔-库仑模型和Vesic圆孔扩张理论法,分别对圆柱体、球体、组合体、椭球体假设下的串囊式充气锚杆的扩大段进行计算分析。并将计算结果与试验得到的实测值进行对比。结果表明:四种形状假设中椭球体的形状假设理论值与实测值的误差最小,仅为8.35%。通过拟合试验数据,并引入与端阻力和侧摩阻力有关的两个系数对承载力公式进行修正,得到了抗拔承载力的经验公式。     

On s-hamiltonian line graphs of claw-free graphs

For an integer $s\ge 0$, a graph $G$ is $s$-hamiltonian if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian, and $G$ is $s$-hamiltonian connected if for any vertex subset $S?V\left(G\right)$ with $\left|S\right|\le s$, $G?S$ is hamiltonian connected. Thomassen in 1984 conjectured that every 4-connected line graph is hamiltonian (see Thomassen, 1986), and Ku?zel and Xiong in 2004 conjectured that every 4-connected line graph is hamiltonian connected (see Ryjá?ek and Vrána, 2011). In Broersma and Veldman (1987), Broersma and Veldman raised the characterization problem of $s$-hamiltonian line graphs. In Lai and Shao (2013), it is conjectured that for $s\ge 2$, a line graph $L\left(G\right)$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected. In this paper we prove the following.(i) For an integer $s\ge 2$, the line graph $L\left(G\right)$ of a claw-free graph $G$ is $s$-hamiltonian if and only if $L\left(G\right)$ is $(s+2)$-connected.(ii) The line graph $L\left(G\right)$ of a claw-free graph $G$ is 1-hamiltonian connected if and only if $L\left(G\right)$ is 4-connected.     

Sandwich-like Catalyst–Carbon–Catalyst Trilayer Structure as a Compact 2D Host for Highly Stable Lithium–Sulfur Batteries

Herein, we propose the construction of a sandwich-structured host filled with continuous 2D catalysis–conduction interfaces. This MoN-C-MoN trilayer architecture causes the strong conformal adsorption of S/Li₂S_x and its high-efficiency conversion on the two-sided nitride polar surfaces, which are supplied with high-flux electron transfer from the buried carbon interlayer. The 3D self-assembly of these 2D sandwich structures further reinforces the interconnection of conductive and catalytic networks. The maximized exposure of adsorptive/catalytic planes endows the MoN-C@S electrode with excellent cycling stability and high rate performance even under high S loading and low host surface area. The high conductivity of this trilayer texture does not compromise the capacity retention after the S content is increased. Such a job-synergistic mode between catalytic and conductive functions guarantees the homogeneous deposition of S/Li₂S_x, and avoids thick and devitalized accumulation (electrode passivation) even after high-rate and long-term cycling.     

Anti-Markovnikov Hydroamination of Racemic Allylic Alcohols to Access Chiral γ-Amino Alcohols

A ruthenium-catalyzed formal anti-Markovnikov hydroamination of allylic alcohols for the synthesis of chiral γ-amino alcohols is presented. Proceeding via an asymmetric hydrogen-borrowing process, the catalysis allows racemic secondary allylic alcohols to react with various amines, affording enantiomerically enriched chiral γ-amino alcohols with broad substrate scope and excellent enantioselectivities (68 examples, up to >99 % ee).     

An approach of dynamic mesh adaptation for simulating 3‐dimensional unsteady moving‐immersed‐boundary flows

In this paper, we present an approach of dynamic mesh adaptation for simulating complex 3‐dimensional incompressible moving‐boundary flows by immersed boundary methods. Tetrahedral meshes are adapted by a hierarchical refining/coarsening algorithm. Regular refinement is accomplished by dividing 1 tetrahedron into 8 subcells, and irregular refinement is only for eliminating the hanging points. Merging the 8 subcells obtained by regular refinement, the mesh is coarsened. With hierarchical refining/coarsening, mesh adaptivity can be achieved by adjusting the mesh only 1 time for each adaptation period. The level difference between 2 neighboring cells never exceeds 1, and the geometrical quality of mesh does not degrade as the level of adaptive mesh increases. A predictor‐corrector scheme is introduced to eliminate the phase lag between adapted mesh and unsteady solution. The error caused by each solution transferring from the old mesh to the new adapted one is small because most of the nodes on the 2 meshes are coincident. An immersed boundary method named local domain‐free discretization is employed to solve the flow equations. Several numerical experiments have been conducted for 3‐dimensional incompressible moving‐boundary flows. By using the present approach, the number of mesh nodes is reduced greatly while the accuracy of solution can be preserved.     

A dynamic dissemination model for recurring online public opinion

Nonlinear Dynamics - With an increasing number of people sharing feelings and opinions online, the online platforms have become one of the most important channels for public opinion dissemination....