Combinatorial 3-Manifolds with Transitive Cyclic Symmetry

In this article we give combinatorial criteria to decide whether a transitive cyclic combinatorial d-manifold can be generalized to an infinite family of such complexes, together with an explicit construction in the case that such a family exists. In addition, we substantially extend the classification of combinatorial 3-manifolds with transitive cyclic symmetry up to 22 vertices. Finally, a combination of these results is used to describe new infinite families of transitive cyclic combinatorial manifolds and in particular a family of neighborly combinatorial lens spaces of infinitely many distinct topological types.     

Transitive Quasi-Uniformities and Topogenous Orders

The purpose of the present paper is to show that the concept of topogenous order, introduced in [1] and discussed in detail in [2], can be useful in answering questions concerning transitive quasi-uniformities.     

Extendability of Cyclic Orders

A cyclic order is a ternary relation that satisfies ternary transitivity and asymmetry conditions. Such a ternary relation is extendable if it is included in a complete cyclic order on the same ground set. Unlike the case of linear extensions of partial orders, a cyclic order need not be extendable. The extension problem for cyclic orders is to determine if a cyclic order is extendable. This problem is known to be NP-complete. We introduce a class of cyclic orders in which the extension problem can be solved in polynomial time. The class provides many explicit examples of nonextendable cyclic orders that were not previously known, including a nonextendable cyclic order on seven points. Let μ be the maximum cardinality of a ground set on which all cyclic orders are extendable. It has been shown that μ≤9. We prove that μ=6. This answers a question of Novák. In addition, we characterize the nonextendable cyclic orders on seven and eight points. Our results are intimately related to irreducible partially ordered set of order dimension three, and to fractional vertices of generalized transitive tournament polytopes. As by-products, we obtain a characterization of cyclically ordered sets of dimension two, and a new proof of a theorem of Dridi on small linear ordering polytopes. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Genesis of Interval Orders and Semiorders: Transitive NaP-preferences

A NaP-preference (necessary and possible preference) on a set A is a pair \({\left(\succsim^{^{_N}}\!,\,\succsim^{^{_P}}\!\right)}\) of binary relations on A such that its necessary component \({\succsim^{^{_N}} \!\!}\) is a partial preorder, its possible component \({\succsim^{^{_P}} \!\!}\) is a completion of \({\succsim^{^{_N}} \!\!}\) , and the two components jointly satisfy natural forms of mixed completeness and mixed transitivity. We study additional mixed transitivity properties of a NaP-preference \({\left(\succsim^{^{_N}}\!,\,\succsim^{^{_P}}\!\right)}\) , which culminate in the full transitivity of its possible component \({\succsim^{^{_P}} \!\!}\) . Interval orders and semiorders are strictly related to these properties, since they are the possible components of suitably transitive NaP-preferences. Further, we introduce strong versions of interval orders and semiorders, which are characterized by enhanced forms of mixed transitivity, and use a geometric approach to compare them to other well known preference relations.     

Transitive Permutation Groups with Cyclic Point Stabilizers of Maximum Order

We prove that a transitive permutation group of degree n with a cyclic point stabilizer and whose order is n(n-1) is isomorphic to the affine group of degree 1 over a field with n elements. More generally we show that if a finite group G has an abelian and core-free Hall subgroup Q, then either Q has a small order (2|Q|² < |G|) or G is a direct product of 2-transitive Frobenius groups.     

Locally Transitive Graphs Admitting a Group with Cyclic Sylow Subgroups

All graphs are finite simple undirected and of no isolated vertices in this paper. Using the theory of coset graphs and permutation groups, it is completed that a classification of locally transitive graphs admitting a non-Abelian group with cyclic Sylow subgroups. They are either the union of the family of arc-transitive graphs, or the union of the family of bipartite edge-transitive graphs.     

完全3-一致超图的圈分解

The problem of decomposing a complete 3-uniform hypergraph into Hamilton cycles was introduced by Bailey and Stevens using a generalization of Hamiltonian chain to uniform hypergraphs by Katona and Kierstead. Decomposing the complete 3-uniform hypergraphs K_n~(3) into k-cycles(3 ≤ k n) was then considered by Meszka and Rosa. This study investigates this problem using a difference pattern of combinatorics and shows that K_(n·5m)~(3) can be decomposed into 5-cycles for n ∈{5, 7, 10, 11, 16, 17, 20, 22, 26} using computer programming.     

3-一致超图的反馈数研究

超图H=(V,E)顶点集为V,边集为E.S■V是H的顶点子集,如果H/S不含有圈,则称S是H的点反馈数,记τc(H)是H的最小点反馈数.本文证明了:(i)如果H是线性3-一致超图,边数为m,则τc(H)≤m/3;(ii)如果H是3-一致超图,边数为m,则τc(H)≤m/2并且等式成立当且仅当H任何一个连通分支是孤立顶点或者长度为2的圈.A■V是H的边子集,如果H\A不含有圈,则称A是H的边反馈数,记τc′(H)是H的最小边反馈数.本文证明了如果H是含有p个连通分支的3-一致超图,则τc’(H)≤2m-n+p.     

Tiling 3‐Uniform Hypergraphs With

Let denote the hypergraph consisting of two triples on four points. For an integer n, let denote the smallest integer d so that every 3‐uniform hypergraph G of order n with minimum pair‐degree contains vertex‐disjoint copies of . Kühn and Osthus (J Combin Theory, Ser B 96(6) (2006), 767–821) proved that holds for large integers n. Here, we prove the exact counterpart, that for all sufficiently large integers n divisible by 4, A main ingredient in our proof is the recent “absorption technique” of Rödl, Ruciński, and Szemerédi (J. Combin. Theory Ser. A 116(3) (2009), 613–636).     

Transitive partially hyperbolic diffeomorphisms on 3-manifolds

The known examples of transitive partially hyperbolic diffeomorphisms on 3-manifolds belong to 3 basic classes: perturbations of skew products over an Anosov map of T², perturbations of the time one map of a transitive Anosov flow, and certain derived from Anosov diffeomorphisms of the torus T³. In this work we characterize the two first types by a local hypothesis associated to one closed periodic curve.     

超图中的着色问题

本文是近三十年来有关超图中涉及的着色问题的综述。它包含了有关超图着色中的基本结果,临界可着色性,２－可着色性,非２－可着色性以及在超图中与顶点着色、边着色和其它着色相关的极值问题。     

Rank 3 Transitive Decompositions of Complete Multipartite Graphs

A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. This paper deals with transitive decompositions of complete multipartite graphs preserved by an imprimitive rank 3 permutation group. We obtain a near-complete classification of these when the group in question has an almost simple component.     

Embedding Factorizations for 3‐Uniform Hypergraphs

In this article, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address the embedding of hypergraphs. The first result finds necessary and sufficient conditions for the embedding a hyperedge‐colored copy of the complete 3‐uniform hypergraph of order m, , into an r‐factorization of , providing that . The second result finds necessary and sufficient conditions for an embedding when not only are the colors of the hyperedges of given, but also the colors of all the “pieces” of hyperedges on these m vertices are prescribed (the “pieces” of hyperedges are eventually extended to hyperedges of size 3 in by adding new vertices to the hyperedges of size 1 and 2 during the embedding process). Both these results make progress toward settling an old question of Cameron on completing partial 1‐factorizations of hypergraphs. © 2012 Wiley Periodicals, Inc. J. Graph Theory 73: 216–224, 2013     

Betti Numbers of Hypergraphs

In this article, we study some algebraic properties of hypergraphs, in particular their Betti numbers. We define some different types of complete hypergraphs, which to the best of our knowledge are not previously considered in the literature. Also, in a natural way, we define a product on hypergraphs, which in a sense is dual to the join operation on simplicial complexes. For such product, we give a general formula for the Betti numbers, which specializes neatly in case of linear resolutions.     

Algebraic Properties of Edge Ideals of Some Vertex-Weighted Oriented Cyclic Graphs

We provide some exact formulas for the projective dimension and regularity of edge ideals associated to some vertex-weighted oriented cyclic graphs with a common vertex or edge.These formulas are functions in the weight of the vertices,and the numbers of edges and cycles.Some examples show that these formulas are related to direction selection and the assumption that w(x)≥2 for any vertex x cannot be dropped.     

Perfect Matching in k-partite k-graphs and 3-uniform HM-bipartite Hypergraphs

Acta Mathematicae Applicatae Sinica, English Series - Let H = (V, E) be an n-balanced k-partite k-graph with partition classes V1,…, Vk. Suppose for every legal (k − l)-tuple f...