Asymmetric Total Syntheses,Stereostructures, and Cytotoxicities of Marine Bromotriterpenoids Aplysiol B (Laurenmariannol) and Saiyacenol A

There are marine cytotoxic bromotriterpenoids, named the thyrsiferol family that are structurally characterized by some tetrahydropyran (THP) and tetrahydrofuran (THF) rings. The thyrsiferol family belongs to natural products that are often difficult to determine their stereostructures even by the current, highly advanced spectroscopic methods, especially in acyclic systems including stereogenic tetrasubstituted carbon centers. In such cases, it is effective to predict and synthesize the possible stereostructures. Herein, to elucidate ambiguous stereostructures and unassigned absolute configurations of aplysiol B, laurenmariannol, and saiyacenol A, members of the thyrsiferol family, we carried out their asymmetric chemical syntheses featuring 6-exo and 5-exo oxacyclizations of epoxy alcohol precursors and 6-endo bromoetherification of a bishomoallylic alcohol. In this paper, we report total assignments of their stereostructures through their asymmetric chemical syntheses and also their preliminary cytotoxic activities against some tumor cells. These results could not have been achieved without depending on asymmetric total synthesis.     

A simple three‐wave approximate Riemann solver for the Saint‐Venant‐Exner equations

Erosion and sediments transport processes have a great impact on industrial structures and on water quality. Despite its limitations, the Saint‐Venant‐Exner system is still (and for sure for some years) widely used in industrial codes to model the bedload sediment transport. In practice, its numerical resolution is mostly handled by a splitting technique that allows a weak coupling between hydraulic and morphodynamic distinct softwares but may suffer from important stability issues. In recent works, many authors proposed alternative methods based on a strong coupling that cure this problem but are not so trivial to implement in an industrial context. In this work, we then pursue 2 objectives. First, we propose a very simple scheme based on an approximate Riemann solver, respecting the strong coupling framework, and we demonstrate its stability and accuracy through a number of numerical test cases. However, second, we reinterpret our scheme as a splitting technique and we extend the purpose to propose what should be the minimal coupling that ensures the stability of the global numerical process in industrial codes, at least, when dealing with collocated finite volume method. The resulting splitting method is, up to our knowledge, the only one for which stability properties are fully demonstrated.     

悬链线竖向集中力作用下的构形分析和张力计算

目前,悬链线在竖向集中力和均布荷载共同作用下的构形分析和受力计算的理论仍不完善。针对这一问题,通过引入悬链线的几何约束方程、力平衡方程和超越方程,建立了竖向集中力与均布荷载共同作用下的非线性方程组。采用牛顿迭代法求解方程组,得到了悬链线的构形和受力情况。为了验证理论计算的正确性,进行了算例和试验验证。结果表明,算例的计算结果与文献结论保持一致,试验测得的构形和水平张力大小与理论计算的构形和水平张力大小吻合较好。本文的理论计算可以更加简单精确地计算出悬链线在竖向集中力和均布荷载共同作用下的构形和受力情况,为实际工程提供重要的理论指导。     

Group divisible 3‐designs with block size four and group type 1ns1

In this article, we mainly consider the existence problem of a group divisible design GDD $\left(3,4,n+s\right)$ of type $1^n{s}^1$. We present two recursive constructions for this configuration using candelabra systems and construct explicitly a few small examples admitting given automorphism groups. As an application, several new infinite classes of GDD $\left(3,4,n+s\right)$s of type $1^n{s}^1$ are produced. Meanwhile a few new infinite families on candelabra quadruple systems with group sizes being odd and stem size greater than one are also obtained.     

Decomposable super‐simple NRBIBDs with block size 4 and index 6

Necessary conditions for the existence of a super‐simple, decomposable, near‐resolvable ‐balanced incomplete block design (BIBD) whose 2‐component subdesigns are both near‐resolvable ‐BIBDs are (mod ) and . In this paper, we show that these necessary conditions are sufficient. Using these designs, we also establish that the necessary conditions for the existence of a super‐simple near‐resolvable ‐RBIBD, namely (mod ) and , are sufficient. A few new pairwise balanced designs are also given.     

Anti‐Pasch optimal packings with triples

It is shown that for , there exists an optimal packing with triples on points that contains no Pasch configurations. Furthermore, for all (mod 6), there exists a pairwise balanced design of order , whose blocks are all triples apart from a single quintuple, and that has no Pasch configurations amongst its triples.     

Using block designs in crossing number bounds

The crossing number $\mathrm{\text{CR}}\left(G\right)$ of a graph $G=\left(V,E\right)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$‐planar crossing number of $G,{\mathrm{\text{CR}}}_k\left(G\right)$, is defined as the minimum of $\text{CR}\left(G_1\right)+\text{CR}\left(G_2\right)+?+\text{CR}\left(G_k\right)$ over all graphs $G_1,G_2,\dots ,G_k$ with ${\cup }_{i=1}^k{G}_i=G$. Pach et al [Comput. Geom.: Theory Appl. 68 (2018), pp. 2–6] showed that for every $k\ge 1$, we have ${\text{CR}}_k\left(G\right)\le (2/k^2?1/k^3)\text{CR}\left(G\right)$ and that this bound does not remain true if we replace the constant $2/k^2?1/k^3$ by any number smaller than $1/k^2$. We improve the upper bound to $(1/k^2)\left(1+o\left(1\right)\right)$ as $k\to \infty$. For the class of bipartite graphs, we show that the best constant is exactly $1/k^2$ for every $k$. The results extend to the rectilinear variant of the $k$‐planar crossing number.