HYDROGEN GENERATION FROM ARTIFICIAL SEA HATER IN A SEMICONDUCTOR SEPTUM ELECTROCHEMICAL PHOTOVOLTAIC CELL

Visible light of the solar spectrum is directly converted to stored chemical energy of hydrogen from artificial sea water in a novel electrochemical photovoltaic cell. The principal element of the cell, modeled after the photosynthetic thylakoid membrane, is a semiconductor septum made of polycrystalline n-CdSe thin film deposited on nickel foil, which separates two aqueous solutions. Under short-circuit conditions, vigorous hydrogen evolution was seen at the Ni surface and continued as long as the cell was operated. The novel cell, the concept of which was derived from pigmented bilayer lipid membrane studies, is easy to construct, simple to operate, and appears to be a practical approach to the photochemical conversion and storage of solar energy.     

Canonical Pattern Ramsey Numbers

A color pattern is a graph whose edges have been partitioned into color classes. A family of color patterns is a Ramsey family provided there is some sufficiently large integer N such that in any edge coloring of the complete graph K_N there is an (isomorphic) copy of at least one of the patterns from . The smallest such N is the Ramsey number of the family . The classical Canonical Ramsey theorem of Erds and Rado asserts that the family of color patterns is a Ramsey family if it consists of monochromatic, rainbow (totally multicolored) and lexically colored complete graphs. In this paper we treat the asymmetric case by studying the Ramsey number of families containing a rainbow triangle, a lexically colored complete graph and a fixed arbitrary monochromatic graph. In particular we give asymptotically tight bounds for the Ramsey number of a family consisting of rainbow and monochromatic triangle and a lexically colored K_N. Among others, we prove some canonical Ramsey results for cycles.     

PHOTOELECTRIC EFFECTS IN DYE-SENSITIZED ARTIFICIAL LIPID MEMBRANES

Using dyes of known redox potentials the specific mechanisms of dark and light potential generation is analyzed in pigmented lipid membranes. The role of the ionic and electronic conductance, as well as the redox potential gradient is specifically related to the observed open circuit voltage developed across the membrane. The results can be most easily explained by the redox electrode model.     

On the Chromatic Number of Subsets of the Euclidean Plane

The chromatic number of a subset of the real plane is the smallest number of colors assigned to the elements of that set such that no two points at distance 1 receive the same color. It is known that the chromatic number of the plane is at least 4 and at most 7. In this note, we determine the bounds on the chromatic number for several classes of subsets of the plane such as extensions of the rational plane, sets in convex position, infinite strips, and parallel lines.     

Slater绝缘体的磁性和能带计算研究

Slater相变是一种由于反铁磁序形成而导致的金属—绝缘体相变.本文采用第一性原理密度泛函计算方法研究了两种Slater绝缘体材料NaOsO_3和Cd_2Os_2O_7的电子结构,进而研究了反铁磁序排列、自旋轨道耦合和电子关联对其电子结构以及相变性质的影响.研究结果表明,非磁相的NaOsO_3具有金属性;而G型线性反铁磁结构是驱动NaOsO_3发生Slater相变的磁基态.此外,研究结果表明,非磁相的焦绿石Cd_2Os_2O_7的能带结构在费米能级处是连续的,表现为金属性;并且带有磁阻挫的Cd_2Os_2O_7发生Slater相变的条件十分苛刻,只有在自旋轨道耦合和1.8 eV电子关联的共同作用下一种全进—全出非线性反铁磁结构才能使其发生Slater相变.说明全进—全出非线性反铁磁结构是使Cd_2Os_2O_7发生Slater相变的磁基态,而自旋轨道耦合和1.8 eV的电子关联在消除磁阻挫上起到了关键作用.     

Sub-Ramsey Numbers for Arithmetic Progressions

Let the integers 1, . . . ,n be assigned colors. Szemerédi's theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing totally multicolored arithmetic progressions of length 3. Let f(n) be the smallest integer k such that there is a coloring of {1, . . . ,n} without totally multicolored arithmetic progressions of length three and such that each color appears on at most k integers. We provide an exact value for f(n) when n is sufficiently large, and all extremal colorings. In particular, we show that f(n)=8n/17+O(1). This completely answers a question of Alon, Caro and Tuza.     

Optimal peeling order for pedigrees with incomplete genotypic information

The likelihood approach is common in linkage analysis of large extended pedigrees. Various peeling procedures, based on the conditional independence of separate parts of a pedigree, are typically used for likelihood calculations. A peeling order may significantly affect the complexity of such calculations, particularly for pedigrees with loops or when many pedigrees members have unknown genotypes. Several algorithms have been proposed to address this problem for pedigrees with loops. However, the problem has not been solved for pedigrees without loops until now. In this paper, we suggest a new graph theoretic algorithm for optimal selection of peeling order in zero-loop pedigrees with incomplete genotypic information. It is especially useful when multiple likelihood calculation is needed, for example, when genetic parameters are estimated or linkage with multiple marker loci is tested. The algorithm can be easily introduced into the existing software packages for linkage analysis based on the Elston-Stewart algorithm for likelihood calculation. The algorithm was implemented in a software package PedPeel, which is freely available at http://mga.bionet.nsc.ru/nlru/.     

Rainbows in the Hypercube

Let Q_n be a hypercube of dimension n, that is, a graph whose vertices are binary n-tuples and two vertices are adjacent iff the corresponding n-tuples differ in exactly one position. An edge coloring of a graph H is called rainbow if no two edges of H have the same color. Let f(G,H) be the largest number of colors such that there exists an edge coloring of G with f(G,H) colors such that no subgraph isomorphic to H is rainbow. In this paper we start the investigation of this anti-Ramsey problem by providing bounds on f(Q_n,Q_k) which are asymptotically tight for k = 2 and by giving some exact results.