Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Challenging Students to View the Concept of Area in Triangles in a Broad Context: Exploiting the Features of Cabri-II

This study focuses on the constructions in terms of area and perimeter in equivalent triangles developed by students aged 12–15 years-old, using the tools provided by Cabri-Geometry II [Labore (1990). Cabri-Geometry (software), Université de Grenoble]. Twenty-five students participated in a learning experiment where they were asked to construct: (a) pairs of equivalent triangles “in as many ways as possible” and to study their area and their perimeter using any of the tools provided and (b) “any possible sequence of modifications of an original triangle into other equivalent ones”. As regards the concept of area and in contrast to a paper and pencil environment, Cabri provided students with different and potential opportunities in terms of: (a) means of construction, (b) control, (c) variety of representations and (d) linking representations, by exploiting its capability for continuous modifications. By exploiting these opportunities in the context of the given open tasks, students were helped by the tools provided to develop a broader view of the concept of area than the typical view they would construct in a typical paper and pencil environment.     

Yet another way of calculating moments of the Kesten's distribution and its consequences for Catalan numbers and Catalan triangles

We calculate moments of the so-called Kesten distribution by means of the expansion of the denominator of the density of this distribution and then integrate all summands with respect to the semicircle distribution. By comparing this expression with the formulae for the moments of Kesten's distribution obtained by other means, we find identities involving polynomials whose power coefficients are closely related to Catalan numbers, Catalan triangles, binomial coefficients. Finally, as applications of these identities we obtain various interesting relations between the aforementioned numbers, also concerning Lucas, Fibonacci and Fine numbers.     

Half-Integer Spin Triangles: Old Dogs,New Tricks

Spin triangles, that is, triangular complexes of half-integer spins, are the oldest molecular nanomagnets (MNMs). Their magnetic properties have been studied long before molecular magnetism was delineated as a research field. This Review presents the history of their study, with references to the parallel development of new experimental investigations and new theoretical ideas used for their interpretation. It then presents an indicative list of spin-triangle families to illustrate their chemical diversity. Finally, it makes reference to recent developments in terms of theoretical ideas and new phenomena, as well as to the relevance of spin triangles to spintronic devices and new physics.     

One‐Step Multicomponent Self‐Assembly of a First‐Generation Sierpiński Triangle: From Fractal Design to Chemical Reality

A novel terpyridine‐based architecture that mimics a first‐generation Sierpiński triangle has been synthesized by multicomponent assembly and features tpy? Cd^II? tpy connectivity (tpy=terpyridine). The key terpyridine ligands were synthesized by the Suzuki cross‐coupling reaction. Mixing two different terpyridine‐based ligands and Cd^II in a precise stoichiometric ratio (1:1:3) produced the desired fractal architecture in near‐quantitative yield. Characterization was accomplished by NMR spectroscopy, mass spectrometry, and transmission electron microscopy.     

NMR for equilateral triangular geometry under conditions of surface relaxivity—analytical and random walk solution

We consider analytical and numerical solution of NMR relaxation under the condition of surface relaxation in an equilateral triangular geometry. We present an analytical expression for the Green’s function in this geometry. We calculate the transverse magnetic relaxation without magnetic gradients present, single-phase, both analytically and numerically. There is a very good match between the analytical and numerical results. We also show that the magnetic signal from an equilateral triangular geometry is qualitatively different from the known solution: plate, cylinder, and sphere, in the case of a nonuniform initial magnetization. Nonuniform magnetization close to the sharp corners makes the magnetic signal very fast multiexponential. This type of initial configuration fits qualitatively with the experimental results by Song (Phys. Rev. Lett. 85, 3878 (2000)), Song et al. (Nature 406, 178 (2000)), Song (Mag. Reson. Imag. 19, 417 (2001)) and Lisitza and Song (Phys. Rev. B 65, 172406 (2002)). It should also be noted that the solution presented here can be used to describe absorption of a chemical substance in an equilateral triangular geometry (for a stationary fluid).     

A NOTE ON C~1-CURVED FINITE ELEMENT

This paper shows that the C1-curved finite element developed by Bernadon in general can not satisfy the essential boundary conditions on approximate boundary. Furthermore, a modified C1-curved finite element is given, which is compatible with the element of Argyris triangle and can satisfy the homogeneous Dirichlet boundary conditions onapproximate boundary.     

Ruin probabilities allowing for delay in claims settlement

In this paper we use martingale techniques to derive upper bounds for the probability of ruin for a risk process. The important difference between our results and previous results in this area is that our model for the risk process explicitly allows for delay in claims settlement.