Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

Colloidal ZnO nanostructures and functional coatings: A survey

The past research work devoted to ZnO nanocolloidal sol-gel route is reviewed. It highlights the cluster chemistry of alcoholic ZnAc₂ solutions and the results of ZnO colloid growth investigations performed worldwide. Moreover, the role of doping and co-doping in the processing of functional ZnO coatings is discussed. The possibilities of tuning the optical properties are also reported with a particular attention to luminescence. The last part of this paper deals with electrical and photoelectrochemical properties of ZnO nanocrystals and their aggregates. This contribution is dedicated to the 80th birthday of Prof. Arnim Henglein from the Hahn-Meitner-Institut in Berlin and to the memory of Prof. Jacques Mugnier from the Université Claude-Bernard Lyon 1 in France.     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

Nanophotonics and nanometrology with planar X-ray waveguide-resonator

The mechanism of X-ray waveguide-resonance propagation or the radiation superstream model, which can become the ground of X-ray nanophotonics, is discussed briefly. Some attention is devoted to features consideration of the simplest devices characterized by the waveguide-resonance transportation of X-ray beams. The experimental data showing the user possibilities of a simplest waveguide-resonators application for diffractometry are presented. We discuss the main reasons to improve the metrological characteristics for total reflection X-ray fluorescence (TXRF) analytical method in case when the target exciting beam is formed by a waveguide-resonator. Some problems appearing during the waveguide-resonator application are formulated.     

Self-similar planar curves related to modified Korteweg-de Vries equation

We exhibit a time reversible geometric flow of planar curves which can develop singularities in finite time within the uniform topology. The example is based on the construction of selfsimilar solutions of modified Korteweg-de Vries equation of a given (small) mean.     

A family of skew Hadamard difference sets

In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics.     

半群K(n,r)中的幂等生成元

设Singn是由一个n元集上的所有奇异变换所构成的奇异变换半群，I是由Singn中一些亏数为1的幂等元组成的集合，Howie利用有向图证明了：I是Singn的一个生成集当且仅当与其相应的有向图D（I）是强连通的完全图，本文利用多重有向图将这一结果推广到Singn的每个理想K（,r)上。     

Design and synthesis of novel imidazolium-based ionic liquids with a pseudo crown-ether moiety: diastereomeric interaction of a racemic ionic liquid with enantiopure europium complexes

A planar-chiral imidazolium salt with a tris(oxoethylene) bridge was synthesized, and its potential application as a room temperature ionic liquid with a molecular-recognition ability was demonstrated.     

The design of molecules containing planar tetracoordinate carbon

A novel preference for planar tetracoordination was observed over the conventional tetrahedral arrangement in a new series of C₅H₂, C₅H₄, C₅H₄^1+/2+ and related compounds. The stability of these molecules is assessed with the ring-opening barriers, HOMO-LUMO gap, singlet-triplet energy differences and nucleus independent chemical shift values.