How the SiC substrate impacts graphene's atomic and electronic structure

Graphene, the two‐dimensional form of carbon presents outstanding electronic and transport properties. This gives hope for the development of applications in nanoelectronics. However, for industrial purpose, graphene has to be supported by a substrate. We focus here on the graphene‐on‐SiC system to discuss how the SiC substrate interacts with the graphene layer and to show the effect of the interface on graphene atomic and electronic structures.

     

Global existence and uniform stability of solutions for a quasilinear viscoelastic problem

In this paper the nonlinear viscoelastic wave equation in canonical form with Dirichlet boundary condition is considered. By introducing a new functional and using the potential well method, we show that the damping induced by the viscoelastic term is enough to ensure global existence and uniform decay of solutions provided that the initial data are in some stable set. Copyright © 2006 John Wiley & Sons, Ltd.     

Global periodicity and complete integrability of discrete dynamical systems

Consider the discrete dynamical system generated by a map F. It is said that it is globally periodic if there exists a natural number p such that F ^p (x)=x for all x in the phase space. On the other hand, it is called completely integrable if it has as many functionally independent first integrals as the dimension of the phase space. In this paper, we relate both concepts. We also give a large list of globally periodic dynamical systems together with a complete set of their first integrals, emphasizing the ones coming from difference equations.     

Rotational CARS N2 thermometry: validation experiments for the influence of nitrogen spectral line broadening by hydrogen

Rotational coherent anti‐Stokes Raman spectroscopy (CARS) in fuel‐rich hydrocarbon flames, with a large content of hydrogen in the product gases (∼20%), has in previous work shown that evaluated temperatures are raised several tens of Kelvin by taking newly derived N₂ H₂ Raman line widths into account. To validate these results, in this work calibrated temperature measurements at around 300, 500 and 700 K were performed in a cell with binary gas mixtures of nitrogen and hydrogen. The temperature evaluation was made with respect to Raman line widths either from self‐broadened nitrogen only, N₂ N₂ [energy‐corrected‐sudden (ECS)], or by also taking nitrogen broadened by hydrogen, N₂ H₂ [Robert–Bonamy (RB)], Raman line widths into account. With increased amount of hydrogen in the cell at constant temperature, the evaluated CARS temperatures were clearly lowered with the use of Raman line widths from self‐broadened nitrogen only, and the case with inclusion of N₂ H₂ Raman line widths was more successful. The difference in evaluated temperatures between the two different sets increases approximately linearly, reaching 20 K (at T ∼ 300 K), 43 K (at T = 500 K) and 61 K (at T = 700 K) at the highest hydrogen concentration (90%). The results from this work further emphasize the importance of using adequate Raman line widths for accurate rotational CARS thermometry. Copyright © 2010 John Wiley & Sons, Ltd.     

Continuous wave mirrorless lasing in cholesteric liquid crystals with a pitch gradient across the cell gap

Despite numerous efforts, continuous wave (CW) lasing in dye doped, one-dimensional (1D) photonic bandgap cholesteric liquid crystal (CLC) structures has not been previously reported, to our knowledge. Here we report on the observation of lasing in such structures under both coherent (laser) and incoherent (LED) CW light excitation. To achieve this effect, we used a 1D-photonic bandgap structure made of a polymer stabilized CLC with a pitch gradient across the cell thickness. A spectral reflectivity profile of such a CLC structure reveals local minima in the area within a photonic stopband and close to it. The realization of lasing pumped by low power CW light sources opens the possibility of all-organic, compact, tunable CW lasers for display and medical applications.     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].     

Bounds for point recolouring in geometric graphs

We examine a recolouring scheme ostensibly used to assist in classifying geographic data. Given a drawing of a graph with bi-chromatic points, where the points are the vertices of the graph, a point can be recoloured if it is surrounded by neighbours of the opposite colour. The notion of surrounded is defined as a contiguous subset of neighbours that span an angle greater than 180 degrees. The recolouring of surrounded points continues in sequence, in no particular order, until no point remains surrounded. We show that for some classes of graphs the process terminates in a polynomial number of steps. On the other hand, there are classes of graphs with infinite recolouring sequences.