Fabrication and characterization of a PbTe quantum dots multilayer structure

Multilayer PbTe quantum dots (QDs) and SiO₂ were grown by pulsed laser deposition (PLD) and Plasma enhanced chemical vapor deposition (PECVD) techniques. The crystalline structure, QD size and size dispersion were observed by high-resolution transmission electron microscopy (HRTEM) measurements. This technique allows one to grow PbTe QDs as small as 1.8 nm diameter and 0.6 nm size dispersion. The whole structure can be used in a Fabry–Perot cavity for an optical device operating at the mid-infrared region.     

Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems

Generalizations of the Nikodym boundedness and Vitali–Hahn–Saks theorems for scalar-valued measures on rings of sets that are in general not σ-rings are presented. As a consequence, the rings of subsets of N with density zero and uniform density zero are shown to have the Nikodym property. In addition, vector measure generalizations of the Vitali–Hahn–Saks theorem are given.     

Synthesis of molecular imprinted organic-inorganic hybrid polymer binding caffeine

Random copolymers of poly{(methacrylamide)-co-(vinyl trimethoxysilane)} and poly{(methacrylic acid)-co-(vinyl trimethoxysilane)} were synthesized via a free radical polymerization reaction. Acid catalyzed sol-gel process of tetraethylorthosilicate (TEOS) with aforementioned polymers in the presence of methyl xanthine class of alkaloid like caffeine resulted in the formation of highly transparent monoliths. Solvent extraction of the template leaves behind the recognition sites intact with high selectivity towards the print molecule. The ionic and non-specific adsorptions, which are considered to be the main disadvantages of the molecularly imprinted polymers (MIP), are prevented to a considerable extent by the end capping of surface silanol groups. The template binding efficiencies of MIP were determined by HPLC analysis.     

The Translation Invariant Massive Nelson Model: I. The Bottom of the Spectrum

In this paper we analyze the bottom of the energy-momentum spectrum of the translation invariant Nelson model, describing one electron linearly coupled to a second quantized massive scalar field. Our results are valid for all values of the coupling constant and include an HVZ theorem, non-degeneracy of ground states, existence of isolated groundstates in dimensions 1 and 2, non-existence of ground states embedded in the bottom of the essential spectrum in dimensions 3 and 4, (i.e., at total momenta where no isolated groundstate eigenvalue exists), and we study regularity and monotonicity properties of the bottom of the essential spectrum, as a function of total momentum. Communicated by Joel Feldman submitted 04/11/04, accepted 17/02/05     

Comparative behavior of polybutadiene and polynorbornene‐based latices prepared by dispersion ring‐opening metathesis polymerization with a poly(ethylene oxide) macromonomer

This study critically examines the similarities and differences between poly(ethylene oxide) (PEO) stabilized latices of polynorbornene and polybutadiene. Features such as the kinetics of copolymerization of norbornene and cyclooctadiene with a macromonomer of PEO, the particles' size and morphology, the type of copolymer formed, and the stability of these latices were investigated and the results obtained are considered. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 2705–2716, 2004     

The exponential power law: partial wetting kinetics and dynamic contact angles

An equation for the kinetics of partial drop spreading is proposed. This equation was empirically derived from experimental data for the spreading kinetics of partially wetting liquids in terms of the wet area versus time. The equation has the form of an exponential power law (EPL), and transforms into the well-known power law for complete wetting, when the equilibrium contact angle approaches zero. The EPL fits very well available experimental data. To lend additional support to the validity of this generalized equation, it will be demonstrated that when it is transformed to present the dynamic contact angle (DCA), it fits very well DCA experimental data for other wetting processes, such as capillary flow and tape coating.     

On Rado's Boundedness Conjecture

We prove that Rado's Boundedness Conjecture from Richard Rado's 1933 famous dissertation Studien zur Kombinatorik is true if it is true for homogeneous equations. We then prove the first nontrivial case of Rado's Boundedness Conjecture: if a₁,a₂, and a₃ are integers, and if for every 24-coloring of the positive integers (or even the nonzero rational numbers) there is a monochromatic solution to the equation a₁x₁+a₂x₂+a₃x₃=0, then for every finite coloring of the positive integers there is a monochromatic solution to a₁x₁+a₂x₂+a₃x₃=0.     

Rhythmic pattern formations in gels and Matalon—Packter law: A fresh perspective

The periodic precipitation pattern formation in gelatinous media is interpreted as a moving boundary problem. The time law, spacing law and width law are revisited on the basis of the new scenario. The explicit dependence of the geometric structure on the initial concentrations of the reactants is derived. Matalon—Packter law, which relates the spacing coefficient with the initial concentrations is reformulated removing many ambiguities and impractical parameters. Experimental results are discussed to establish the significance of moving boundary concept in the diffusion controlled pattern forming systems     

The diameter of randomly perturbed digraphs and some applications

The central observation of this paper is that if εn random arcs are added to any n‐node strongly connected digraph with bounded degree then the resulting graph has diameter 𝒪(lnn) with high probability. We apply this to smoothed analysis of algorithms and property testing. Smoothed Analysis: Recognizing strongly connected digraphs is a basic computational task in graph theory. Even for digraphs with bounded degree, it is NL‐complete. By XORing an arbitrary bounded degree digraph with a sparse random digraph R ∼ 𝔻_n,ε/n we obtain a “smoothed” instance. We show that, with high probability, a log‐space algorithm will correctly determine if a smoothed instance is strongly connected. We also show that if NL ⫅̸ almost‐L then no heuristic can recognize similarly perturbed instances of (s,t)‐connectivity. Property Testing: A digraph is called k‐linked if, for every choice of 2k distinct vertices s₁,…,s_k,t₁,…,t_k, the graph contains k vertex disjoint paths joining s_r to t_r for r = 1,…,k. Recognizing k‐linked digraphs is NP‐complete for k ≥ 2. We describe a polynomial time algorithm for bounded degree digraphs, which accepts k‐linked graphs with high probability, and rejects all graphs that are at least εn arcs away from being k‐linked. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

Corner spontaneous magnetization

Details are given of a new method allowing an exact calculation of the spontaneous magnetization in the corner as well as along the edge at an arbitrary distance of the corner for a rectangular planar Ising ferromagnet.