Hysteresis loops for para–ferromagnetic phase transitions

In this paper, by an extension of the Ginzburg–Landau theory, we propose a mathematical model describing hard magnets within which we are able to explore the para–ferromagnetic transition and by using the Landau–Lifshitz–Gilbert equation, to study the 3D evolution of magnetic field. Finally, the hysteresis loops are obtained and represented by numerical implementations.     

Derivatives of Wronskians with applications to families of special Weierstrass points

Let be a flat proper family of smooth connected projective curves parametrized by some smooth scheme of finite type over . On every such a family, suitable derivatives along the fibers" (in the sense of Lax) of the relative wronskian, as defined by Laksov and Thorup, are constructed. They are sections of suitable jets extensions of the -th tensor power of the relative canonical bundle of the family itself.

The geometrical meaning of such sections is discussed: the zero schemes of the -th derivative () of a relative wronskian correspond to families of Weierstrass Points (WP's) having weight at least .

The locus in , the coarse moduli space of smooth projective curves of genus , of curves possessing a WP of weight at least , is denoted by . The fact that has the expected dimension for all was implicitly known in the literature. The main result of this paper hence consists in showing that has the expected dimension for all . As an application we compute the codimension Chow (-)class of for all , the main ingredient being the definition of the -th derivative of a relative wronskian, which is the crucial tool which the paper is built on. In the concluding remarks we show how this result may be used to get relations among some codimension Chow (-)classes in (), corresponding to varieties of curves having a point with a suitable prescribed Weierstrass Gap Sequence, relating to previous work of Lax.

     

Edge partitions of optimal 2-plane and 3-plane graphs

A topological graph is a graph drawn in the plane. A topological graph is $k$-plane, $k>0$, if each edge is crossed at most $k$ times. We study the problem of partitioning the edges of a $k$-plane graph such that each partite set forms a graph with a simpler structure. While this problem has been studied for $k=1$, we focus on optimal 2-plane and on optimal 3-plane graphs, which are 2-plane and 3-plane graphs with maximum density. We prove the following results. (i) It is not possible to partition the edges of a simple (i.e., with neither self-loops nor parallel edges) optimal 2-plane graph into a 1-plane graph and a forest, while (ii) an edge partition formed by a 1-plane graph and two plane forests always exists and can be computed in linear time. (iii) There exist efficient algorithms to partition the edges of a simple optimal 2-plane graph into a 1-plane graph and a plane graph with maximum vertex degree at most 12, or with maximum vertex degree at most 8 if the optimal2-plane graph is such that its crossing-free edges form a graph with no separating triangles. (iv) There exists an infinite family of simple optimal 2-plane graphs such that in any edge partition composed of a 1-plane graph and a plane graph, the plane graph has maximum vertex degree at least 6 and the 1-plane graph has maximum vertex degree at least 12. (v) Every optimal 3-plane graph whose crossing-free edges form a biconnected graph can be decomposed, in linear time, into a 2-plane graph and two plane forests.     

The structure of the fractional powers of the noncommutative Fourier law

In the recent years, there has been a lot of interest in fractional diffusion and fractional evolution problems. The spectral theory on the S‐spectrum turned out to be an important tool to define new fractional diffusion operators stating from the Fourier law for nonhomogeneous materials. Precisely, let e_?, e_?=1,2,3 be orthogonal unit vectors in and let be a bounded open set with smooth boundary ?Ω. Denoting by a point in Ω, the heat equation is obtained replacing the Fourier law given by into the conservation of energy law. In this paper, we investigate the structure of the fractional powers of the vector operator T, with homogeneous Dirichlet boundary conditions. Recently, we have found sufficient conditions on the coefficients a, b, such that the fractional powers of T exist in the sense of the S‐spectrum approach. In this paper, we show that under a different set of conditions on the coefficients a, b, c, the fractional powers of T have a different structure.     

Dense trees: a new look at degenerate graphs

Dense trees are undirected graphs defined as natural extensions of trees. They are already known in the realm of graph coloring under the name of k-degenerate graphs. For a given integer k1, a k-dense cycle is a connected graph, where the degree of each vertex is greater than k. A k-dense forest F=(V,E) is a graph without k-dense cycles as subgraphs. If F is connected, then is a k-dense tree. 1-dense trees are standard trees. We have |E|k|V|−k(k+1)/2. If equality holds F is connected and is called a maximal k-dense tree. k-trees (a subfamily of triangulated graphs) are special cases of maximal k-dense trees.We review the basic theory of dense trees in the family of graphs and show their relation with k-trees. Vertex and edge connectivity is thoroughly investigated, and the role of maximal k-dense trees as “reinforced” spanning trees of arbitrary graphs is presented. Then it is shown how a k-dense forest or tree can be decomposed into a set of standard spanning trees connected through a common “root” of k vertices. All sections include efficient construction algorithms. Applications of k-dense trees in the fields of distributed systems and data structures are finally indicated.     

Design of transverse electric ring isolators for ultra-low-loss Si3N4 waveguides based on the finite element method

In this Letter we present the design of a novel (to our best knowledge) integrated TE isolator realized using ultra-low-loss Si(3)N(4) waveguides. The device is made of two straight waveguides coupled to an array of ring resonators including a Ce:YIG garnet grown on their internal side. The analysis demonstrates advantages in loss, isolation, and passband width as the number of rings is increased.     

Chemical composition of the essential oil of Kaliphora madagascariensis Hook. f.

Kaliphora madagascariensis is an evergreen shrub or small tree endemic to Madagascar where it is traditionally used for the treatment of persistent cephalalgia by a strong inhalation of its odour. In this work, we analysed for the first time the essential oil obtained from leaves by Gas Chromatography-Mass Spectrometry. The chemical composition was dominated by oxygenated sesquiterpenes (68.1%), with caryophyllene oxide (14.7%) and β-eudesmol (10.7%) as the most abundant constituents. These compounds are endowed with documented healthy effects such as analgesic, anti-inflammatory, neuritogenic, antiepileptic and hypotensive, and its abundance might explain the traditional use of the plant in Madagascar.