TRANILAST ^1H^13CNMR谱分析及其结构的鉴定

本文用COSY,CHCOR等二维核磁共振技术对TRANILAST,2[]3-(3.4-二甲基苯基)1-氧代-2-丙烯基]氨基]苯甲到进行了~1H、~(13)C NMR谱数据分析及归属,并结合~(13)C弛豫时间T_1 及变温实验对合成产品进行了结构鉴定.     

A study of the effect of ZrO2 on the magnetic properties of FePt/ZrO2 multilayer

Fe_xPt_100−x(30 nm) and [Fe_xPt_100−x(3 nm)/ZrO₂]₁₀ (x = 37, 48, 57, 63, 69) films with different ZrO₂ content were prepared by RF magnetron sputtering technique, then were annealed at 550 °C for 30 min. This work investigates the effect of ZrO₂ doping on the microstructural evolution, magnetic properties, grain size, as well as the ordering kinetics of FePt alloy films. The as-deposited films behaved a disordered state, and the ordered L1₀ structure was obtained by post-annealing. The magnetic properties of the films are changed from soft magnetism to hard magnetism after annealing. The variation of the largest coercivities of [Fe_xPt_100−x/ZrO₂]₁₀ films with the Fe atomic percentage, x and differing amounts of ZrO₂ content reveals that as we increase the ZrO₂ content we must correspondingly increase the amount of Fe. This phenomenon suggests that the Zr or O atoms of ZrO₂ preferentially react with the Fe atoms of FePt alloy to form compounds. In addition, introducing the nonmagnetic ZrO₂ can reduce the intergrain exchange interactions of the FePt/ZrO₂ films, and the interactions are decreased as the ZrO₂ content increases, the dipole interactions are observed in FePt/ZrO₂ films as the ZrO₂ content is more than 15%.     

On the genericity of chaos

Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).     

On dimensional rigidity of bar-and-joint frameworks

Let V={1,2,…,n}. A mapping p:V→R^r, where p¹,…,pⁿ are not contained in a proper hyper-plane is called an r-configuration. Let G=(V,E) be a simple connected graph on n vertices. Then an r-configuration p together with graph G, where adjacent vertices of G are constrained to stay the same distance apart, is called a bar-and-joint framework (or a framework) in R^r, and is denoted by G(p). In this paper we introduce the notion of dimensional rigidity of frameworks, and we study the problem of determining whether or not a given G(p) is dimensionally rigid. A given framework G(p) in R^r is said to be dimensionally rigid iff there does not exist a framework G(q) in R^s for s?r+1, such that ∥qⁱ-q^j∥²=∥pⁱ-p^j∥² for all (i,j)∈E. We present necessary and sufficient conditions for G(p) to be dimensionally rigid, and we formulate the problem of checking the validity of these conditions as a semidefinite programming (SDP) problem. The case where the points p¹,…,pⁿ of the given r-configuration are in general position, is also investigated.     

The minimum span of L(2,1)-labelings of certain generalized Petersen graphs

In the classical channel assignment problem, transmitters that are sufficiently close together are assigned transmission frequencies that differ by prescribed amounts, with the goal of minimizing the span of frequencies required. This problem can be modeled through the use of an L(2,1)-labeling, which is a function f from the vertex set of a graph G to the non-negative integers such that |f(x)-f(y)|? 2 if xand y are adjacent vertices and |f(x)-f(y)|?1 if xand y are at distance two. The goal is to determine the λ-number of G, which is defined as the minimum span over all L(2,1)-labelings of G, or equivalently, the smallest number k such that G has an L(2,1)-labeling using integers from {0,1,…,k}. Recent work has focused on determining the λ-number of generalized Petersen graphs (GPGs) of order n. This paper provides exact values for the λ-numbers of GPGs of orders 5, 7, and 8, closing all remaining open cases for orders at most 8. It is also shown that there are no GPGs of order 4, 5, 8, or 11 with λ-number exactly equal to the known lower bound of 5, however, a construction is provided to obtain examples of GPGs with λ-number 5 for all other orders. This paper also provides an upper bound for the number of distinct isomorphism classes for GPGs of any given order. Finally, the exact values for the λ-number of n-stars, a subclass of the GPGs inspired by the classical Petersen graph, are also determined. These generalized stars have a useful representation on Möebius strips, which is fundamental in verifying our results.     

On the third largest Laplacian eigenvalue of a graph

In this article, a sharp lower bound for the third largest Laplacian eigenvalue of a graph is given in terms of the third largest degree of the graph.     

Traces on the skein algebra of the torus

For a surface F, the Kauffman bracket skein module of F×[0,1], denoted K(F), admits a natural multiplication which makes it an algebra. When specialized at a complex number t, nonzero and not a root of unity, we have Kt(F), a vector space over C. In this paper, we will use the product-to-sum formula of Frohman and Gelca to show that the vector space Kt(T²) has five distinct traces. One trace, the Yang-Mills measure, is obtained by picking off the coefficient of the empty skein. The other four traces on Kt(T²) correspond to the four singular points of the moduli space of flat SU(2)-connections on the torus.     

Coalgebraic representations of distributive lattices with operators

We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators.     

Periodic solutions for a Lotka–Volterra mutualism system with several delays

In the present paper, a Lotka–Volterra type mutualism system with several delays is studied. Some new and interesting sufficient conditions are obtained for the global existence of positive periodic solutions of the mutualism system. Our method is based on Mawhin’s coincidence degree and novel estimation techniques for the a priori bounds of unknown solutions. Our results are different from the existing ones such as those in of Yang et al. [F. Yang, D. Jiang, A. Ying, Existence of positive solution of multidelays facultative mutualism system, J. Eng. Math. 3 (2002) 64–68] and Chen et al. [F. Chen, J. Shi, X. Chen, Periodicity in a Lotka–Volterra facultative mutualism system with several delays, J. Eng. Math. 21 (3) (2004) 403–409].