Minimum sum set coloring of trees and line graphs of trees

In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph is minimum. The MSSC problem occurs in two versions: non-preemptive and preemptive. We show that the MSSC problem is strongly NP-hard both in the preemptive case on trees and in the non-preemptive case in line graphs of trees. Finally, we give exact parameterized algorithms for these two versions on trees and line graphs of trees.     

Ionic liquids as recycling solvents for the synthesis of magnetic nanoparticles

This work describes an easy synthesis (one pot) of MFe(2)O(4) (M = Co, Fe, Mn, and Ni) magnetic nanoparticles MNPs by the thermal decomposition of Fe(Acac)(3)/M(Acac)(2) by using BMI·NTf(2) (1-n-butyl-3-methylimidazolium bis(trifluoromethylsulfonyl)imide) or BMI·PF(6) (1-n-butyl-3-methylimidazolium hexafluorophosphate) ionic liquids (ILs) as recycling solvents and oleylamine as the reducing and surface modifier agent. The effects of reaction temperature and reaction time on the features of the magnetic nanomaterials (size and magnetic properties) were investigated. The growth of the MNPs is easily controlled in the IL by adjusting the reaction temperature and time, as inferred from Fe(3)O(4) MNPs obtained at 150 °C, 200 °C and 250 °C with mean diameters of 8, 10 and 15 nm, respectively. However, the thermal decomposition of Fe(Acac)(3) performed in a conventional high boiling point solvent (diphenyl ether, bp 259 °C), under a similar Fe to oleylamine molar ratio used in the IL synthesis, does not follow the same growth mechanism and rendered only smaller NPs of 5 nm mean diameter. All MNPs are covered by at least one monolayer of oleylamine making them readily dispersible in non-polar solvents. Besides the influence on the nanoparticles growth, which is important for the preparation of highly crystalline MNPs, the IL was easily recycled and has been used in at least 20 successive syntheses.     

Optimization of a 2D photonic crystal add/drop multiplexer based on contra-directional coupling

We present a highly integrated add/drop multiplexer, where the contra-directional coupling is realized by phase matching two photonic crystal waveguides. The device band structure, the corresponding transmission and drop spectra, and the coupling length are carefully analysed. Different device configurations are discussed and by tailoring the coupling factor, we optimize the frequency response of the filter, obtaining a -sized channel selector, characterized by a very high drop efficiency.     

Structural features responsible for GFPuv and S147P-GFP’s improved fluorescence

Green fluorescent protein (GFP) is used as a biological marker. It is a protein in the jellyfish, Aequorea victorea, which is found in the cold Pacific Northwest. Mature GFP, i.e. fully fluorescent GFP, is most efficiently formed at temperatures well below 37 °C. The GFPuv (F99S/M153T/V163A) and S147P-GFP mutants mature more efficiently at room temperature than wild-type GFP, and therefore result in increased fluorescence at room temperature. Computational methods have been used to examine whether the low-energy precyclized forms of these improved GFP-mutants are preorganized so that they can more efficiently form the chromophore than the wild-type and S65T-GFP. All mutations examined (S147P, F99S, M153T, V163A and F99S/M153T/V163A) more efficiently preorganize the immature precyclized forms of GFP for chromophore formation than immature wild-type GFP. It has been proposed that Arg96 is involved in chromophore formation. Our calculations suggest that the M153T and V163A mutations in GFPuv maybe partially responsible for the increased maturation efficiency observed in GFPuv because they improve the Arg96–Tyr66 interaction. The same is true for the S147P mutation in S147P-GFP.     

Bi-Sobolev mappings with differential matrices in Orlicz Zygmund classes

Bi-Sobolev mappings have been defined as those homeomorphisms such that f and f−1 belong to . We deduce regularity properties of the distortion of f from the regularity of the differential matrix Df−1 and conversely.     

Multiplication Operators on the Lipschitz Space of a Tree

In this paper, we study the multiplication operators on the space of complex-valued functions f on the set of vertices of a rooted infinite tree T which are Lipschitz when regarded as maps between metric spaces. The metric structure on T is induced by the distance function that counts the number of edges of the unique path connecting pairs of vertices, while the metric on ℂ is Euclidean. After observing that the space L{\mathcal{L}} of such functions can be endowed with a Banach space structure, we characterize the multiplication operators on L{\mathcal{L}} that are bounded, bounded below, and compact. In addition, we establish estimates on the operator norm and on the essential norm, and determine the spectrum. We then prove that the only isometric multiplication operators on L{\mathcal{L}} are the operators whose symbol is a constant of modulus one. We also study the multiplication operators on a separable subspace of L{\mathcal{L}} we call the little Lipschitz space.     

A Connectedness Theorem for Products of Weighted Projective Spaces

We prove a connectedness result for products of weighted projective spaces.     

Weighted Composition Operators From H^\infty into the Zygmund Spaces

In this work we characterize the bounded and the compact weighted composition operators from the space $H^\infty $ of bounded analytic functions on the open unit disk into the Zygmund space and the little Zygmund space. We also provide boundedness and compactness criteria of the weighted composition operators from the Bloch space into the little Zygmund space. In particular, we show that the bounded operators between these spaces are necessarily compact.     

On minimal forbidden subgraph characterizations of balanced graphs

A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.