New coverings of t-sets with (t + 1)-sets

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predetermining automorphisms of desired covering designs. A stochastic heuristic search (embedded in the general framework of tabu search) is then used to find appropriate sets of orbits. A table of upper bounds on C(v, t + 1, t) for v 28 and t 8 is given, and the new covering designs are listed. © 1999 John Wiley & Sons, Inc. J. Combin Designs 7: 217–226, 1999     

Combinatorial coverings from geometries over principal ideal rings

A t-(v, k, λ) covering is an incidence structure with v points, each block incident on exactly k points, such that every set of t distinct points is incident on at least λ blocks. By considering certain geometries over finite principal ideal rings, we construct infinite families of t-(v, k, λ) coverings having many interesting combinatorial properties. © 1999 John & Sons, Inc. J Combin Designs 7: 247–268, 1999     

十二次对称准周期结构的自相似变换及准晶胞构造

研究十二次对称准晶体模型的几何结构性质.修正了Socolar在正方形-菱形-六边形拼图模型中自相似变换的错误.在Stampfli-Ghler正方形-菱形-三角形拼图模型的基础上,成功地构造出了准晶胞,使得十二次对称准周期结构可以用覆盖理论描述. 关键词： 准晶体 拼图模型 自相似变换 覆盖理论     

Zhang–Zhang polynomials of cyclo-polyphenacenes

The Zhang–Zhang polynomial (i.e., Clar covering polynomial) of hexagonal systems is introduced by H. Zhang and F. Zhang, which can be used to calculate many important invariants such as the Clar number, the number of Kekulé structures and the first Herndon number, etc. In this paper, we give out an explicit recurrence expression for the Zhang–Zhang polynomials of the cyclo-polyphenacenes, and determine their Clar numbers, numbers of Kekulé structures and their first Herndon numbers.     

Hopf algebras of primitive Lie pseudogroups and Hopf cyclic cohomology

We associate to each infinite primitive Lie pseudogroup a Hopf algebra of ‘transverse symmetries,’ by refining a procedure due to Connes and the first author in the case of the general pseudogroup. The affiliated Hopf algebra can be viewed as a ‘quantum group’ counterpart of the infinite-dimensional primitive Lie algebra of the pseudogroup. It is first constructed via its action on the étale groupoid associated to the pseudogroup, and then realized as a bicrossed product of a universal enveloping algebra by a Hopf algebra of regular functions on a formal group. The bicrossed product structure allows to express its Hopf cyclic cohomology in terms of a bicocyclic bicomplex analogous to the Chevalley-Eilenberg complex. As an application, we compute the relative Hopf cyclic cohomology modulo the linear isotropy for the Hopf algebra of the general pseudogroup, and find explicit cocycle representatives for the universal Chern classes in Hopf cyclic cohomology. As another application, we determine all Hopf cyclic cohomology groups for the Hopf algebra associated to the pseudogroup of local diffeomorphisms of the line.     

Interpolation problems on the spectrum of <Emphasis Type="Italic">H</Emphasis><Superscript>∞</Superscript>

We characterize those sequences (x _n ) in the spectrum of H ^∞ whose Nevanlinna–Pick interpolation problems admit thin Blaschke products as solutions. We also study under which conditions there is a Blaschke product B with prescribed zero-set distribution and solving problems of the form B(x) = f _n (x) for every x ∈ P(x _n ), where P(x _n ) is the Gleason part associated with the point x _n and where (f _n ) is an arbitrary sequence of functions in the unit ball of H ^∞. As a corollary we get a new characterization of Carleson–Newman Blaschke products in terms of bounded universal functions, a result first proved by Gallardo and Gorkin.      

Enumerating typical abelian prime-fold coverings of a circulant graph

Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265-272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85; R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum); M. Hofmeister, Graph covering projections arising from finite vector spaces over finite fields, Discrete Math. 143 (1995) 87-97; M. Hofmeister, Enumeration of concrete regular covering projections, SIAM J. Discrete Math. 8 (1995) 51-61; M. Hofmeister, A note on counting connected graph covering projections, SIAM J. Discrete Math. 11 (1998) 286-292; J.H. Kwak, J. Chun, J. Lee, Enumeration of regular graph coverings having finite abelian covering transformation groups, SIAM J. Discrete Math. 11 (1998) 273-285; J.H. Kwak, J. Lee, Isomorphism classes of graph bundles, Canad. J. Math. XLII (1990) 747-761]). A covering is called abelian (or circulant, respectively) if its covering graph is a Cayley graph on an abelian (or a cyclic, respectively) group. A covering p from a Cayley graph onto another Cay (Q,Y) is called typical if the map p:A→Q on the vertex sets is a group epimorphism. Recently, the isomorphism classes of connected typical circulant r-fold coverings of a circulant graph are enumerated in [R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85] for r=2 and in [R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum)] for any r. As a continuation of these works, we enumerate in this paper the isomorphism classes of typical abelian prime-fold coverings of a circulant graph.     

Saturated packings and reduced coverings obtained by perturbing tilings

Let a normed space X possess a tiling T consisting of unit balls. We show that any packing P of X obtained by a small perturbation of T is completely translatively saturated; that is, one cannot replace finitely many elements of P by a larger number of unit balls such that the resulting arrangement is still a packing.In contrast with that, given a tiling T of Rⁿ with images of a convex body C under Euclidean isometries, there may exist packings P consisting of isometric images of C obtained from T by arbitrarily small perturbations which are no longer completely saturated. This means that there exists some positive integer k such that one can replace k−1 members of P by k isometric copies of C without violating the packing property. However, we quantify a tradeoff between the size of the perturbation and the minimal k such that the above phenomenon occurs.Analogous results are obtained for coverings.