零维到三维结构中三核铜自旋阻挫簇单元的磁构关系和反对称交换

量子自旋液体是最近几年刚被人们证实除铁磁体、反铁磁体之外的第三种磁性类型,因其有望解释高温超导的运行机制、改变计算机硬盘信息存储方式而在物理、材料等领域备受关注。自旋阻挫作为量子自旋液体的最小单元可能是解开量子自旋液体诸多问题的钥匙,所以在磁学、电学研究领域再一次成为人们研究的热点。基于文献报道的三核铜配合物[Cu3(μ3-OH)(μ-OPz)3(NO3)2(H2O)2]·CH3OH(1),我们合成了三维金属有机框架配合物{[Ag(HOPz)Cu3(μ3-OH)(NO3)3(OPz)2Ag(NO3)]·6H2O}n(2)(HOPz=甲基(2-吡嗪基)酮肟),并从自旋阻挫的角度对二者磁性质进行对比和详细分析。磁化率数据表明自旋间有很强的反铁磁相互作用和反对称交换。通过包含各向同性和反对称交换的哈密顿算符对两者磁学数据进行拟合并研究其磁构关系,所获最佳拟合参数为:配合物1:Jav=-426 cm^-1,g⊥=1.83,g∥=2.00;配合物2:Jav=-401 cm^-1,g⊥=1.85,g∥=2.00。     

Formation of Azulene-Embedded Nanographene: Naphthalene to Azulene Rearrangement During the Scholl Reaction

Incorporation of a non-hexagonal ring into a nanographene framework can lead to new electronic properties. During the attempted synthesis of naphthalene-bridged double [6]helicene and heptagon-containing nanographene by the Scholl reaction, an unexpected azulene-embedded nanographene and its triflyloxylated product were obtained, as confirmed by X-ray crystallographic analysis and 2D NMR spectroscopy. A 5/7/7/5 ring-fused substructure containing two formal azulene units is formed, but only one of them shows an azulene-like electronic structure. The formation of this unique structure is explained by arenium ion mediated 1,2-phenyl migration and a naphthalene to azulene rearrangement reaction according to an in-silico study. This report represents the first experimental example of the thermodynamically unfavorable naphthalene to azulene rearrangement and may lead to new azulene-based molecular materials.     

A New Approach to Develop a Standardized Method for Simultaneous Analysis of Astragaloside IV and Formononetin in Radix Astragali by High-Performance Thin-Layer Chromatography

JPC – Journal of Planar Chromatography – Modern TLC - A new high-performance thin-layer chromatographic (HPTLC) method has been developed for the simultaneous estimation of...     

A generalized super AKNS hierarchy associated with orthosymplectic Lie superalgebra OSP(2,2) and its super bi-Hamiltonian structures

For the orthosymplectic Lie superalgebra $\text{◂⋅▸}OSP(2,2)$, we choose a set of basis matrices. A linear combination of those basis matrices presents a spatial spectral matrix. The compatible condition of the spatial part and the corresponding temporal parts of the spectral problem leads to a generalized super AKNS (GSAKNS) hierarchy. By making use of the supertrace identity, the obtained GSAKNS hierarchy can be written as the super bi-Hamiltonian structures.     

Uniform local well-posedness and inviscid limit for the Benjamin-Ono-Burgers equation

In this paper, we study the Cauchy problem for the Benjamin-Ono-Burgers equation \({\partial _t}u - \epsilon \partial _x^2u + {\cal H}\partial _x^2u + u{u_x} = 0\), where \({\cal H}\) denotes the Hilbert transform operator. We obtain that it is uniformly locally well-posed for small data in the refined Sobolev space \({\tilde H^\sigma }(\mathbb{R})\,\,(\sigma \geqslant 0)\), which is a subspace of L²(ℝ). It is worth noting that the low-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is scaling critical, and thus the small data is necessary. The high-frequency part of \({\tilde H^\sigma }(\mathbb{R})\) is equal to the Sobolev space H^σ (ℝ) (σ ⩾ 0) and reduces to L²(ℝ). Furthermore, we also obtain its inviscid limit behavior in \({\tilde H^\sigma }(\mathbb{R})\) (σ ⩾ 0).

     

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.