Orderings of uniquely colorable hypergraphs

For a mixed hypergraph H=(X,C,D), where C and D are set systems over the vertex set X, a coloring is a partition of X into ‘color classes’ such that every C∈C meets some class in more than one vertex, and every D∈D has a nonempty intersection with at least two classes. A vertex-orderx₁,x₂,…,x_n on X (n=|X|) is uniquely colorable if the subhypergraph induced by {x_j:1?j?i} has precisely one coloring, for each i (1?i?n). We prove that it is NP-complete to decide whether a mixed hypergraph admits a uniquely colorable vertex-order, even if the input is restricted to have just one coloring. On the other hand, via a characterization theorem it can be decided in linear time whether a given color-sequence belongs to a mixed hypergraph in which the uniquely colorable vertex-order is unique.     

Irregular Behavior of Solutions for Fisher’s Equation

This paper is concerned with the irregular behavior of solutions for Fisher’s equation when initial data do not decay in a regular way at the spatial infinity. In the one-dimensional case, we show the existence of a solution whose profile and average speed are not convergent. In the higher-dimensional case, we show the existence of expanding fronts with arbitrarily prescribed profiles. We also show the existence of irregularly expanding fronts whose profile varies in time. Proofs are based on some estimate of the difference of two distinct solutions and a comparison technique. Dedicated to Professor Pavol Brunovsky on his 70th birthday.     

The VC dimension of k‐uniform random hypergraphs

A set of vertices is shattered in a hypergraph if any of its subsets is obtained as the intersection of an edge with the set. The VC dimension is the size of the largest shattered subset. Under the binomial model of k‐uniform random hypergraphs, the threshold function for the VC dimension to be larger than a given integer is obtained. The same is done for the testing dimension, which is the largest integer d such that all sets of cardinality d are shattered. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

关于不含k-C-圈的n阶r-一致超图的若干结果

主要讨论了不含k-C-圈的n阶r-一致超图,对不同的k,分别得出了它的极大边数的一个下界,并且得出在有些情况下它的下界是最大的.另外,我们得到了Krn含k-C-圈的一个充分必要条件.     

Oriented hypergraphs: Balanceability

An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.     

A MORPHOLOGICAL STUDY OF POLY（DIVINYLBENZENE-co-ACRYLIC ACID） IN CROSSLINKING PRECIPITATION POLYMERIZATION

Divinylbenzene-80 （DVB-80） and polar monomer acrylic acid （AA） having hydrogen bonding at a total monomer loading of 5 vol% were precipitated-copolymerized in a variety of organic solvents with 2,2＇-azobis（isobutyronitrile） （AIBN） as initiator. The experiments were investigated from a two-dimensional matrix, i.e., the actual crosslinking degree of DVB varying from 0 to 80% and the solvent composition varying from 0 to 100% of toluene mixture with acetonitrile, when the mixture of acetonitrile and toluene was used as the reaction solvent. Under various reaction conditions, six distinct morphologies including soluble polymers, swellable microgels, coagulum, irregular microparticles, and nano-/micrometer microspheres were formed and the structures of these polymer architectures were described. A morphological map was utilized to discuss the effects of both crosslinking degree of DVB and composition of solvent on the transitions between morphology domains. The results demonstrated that the microspheres are formed by an internal contraction due to the marginal solvency of the continuous phase and the crosslinking of the polymer network through the covalent bonding from DVB as well as the interchain hydrogen-bonding between the carboxylic acid units.     

New Ni(II)Cu(II)Ni(II) trinuclear complexes with an 5=3/2 high-spin ground

Four new heterotrinuclear complexes have been synthesized and characterized, namely {[Ni(L)₂]₂[Cu(opba)]}(ClO₄)₂, where opba denotes o-phenylenebis(oxamato) and L stands for 1,10-phenanthroline(phen) (1), 5-nitro-l,10-phenanthroline(NO₂-phen) (2), 2,2′-bipyridyl(bpy) (S) and 4,4′-dimethyl-2,2′-bipyridyl(Me₂bpy) (4). The temperature dependence of the magnetic susceptibility of {[Ni(phen)₂]₂[Cu(opba)]}(ClO₄)₂3H₂O has been studied in the 4–300 K range, giving the exchange integral J—109 cm^?1. The HMT vs. T plot exhibits a minimum at about 100 K, characteristic of this kind of coupled polymetallic complex with an irregular spin-state structure.     

Embedding hypertrees into steiner triple systems

In this paper, we are interested in the following question: given an arbitrary Steiner triple system on vertices and any 3‐uniform hypertree on vertices, is it necessary that contains as a subgraph provided ? We show the answer is positive for a class of hypertrees and conjecture that the answer is always positive.