Contraction–Deletion Invariants for Graphs

We consider generalizations of the Tutte polynomial on multigraphs obtained by keeping the main recurrence relation T(G)=T(G/e)+T(G−e) for eE(G) neither a bridge nor a loop and dropping the relations for bridges and loops. Our first aim is to find the universal invariant satisfying these conditions, from which all others may be obtained. Surprisingly, this turns out to be the universal V-function Z of Tutte (1947, Proc. Cambridge Philos. Soc.43, 26–40) defined to obey the same relation for bridges as well. We also obtain a corresponding result for graphs with colours on the edges and describe the universal coloured V-function, which is more complicated than Z. Extending results of Tutte (1974, J. Combin. Theory Ser. B16, 168–174) and Brylawski (1981, J. Combin. Theory Ser. B30, 233–246), we give a simple proof that there are non-isomorphic graphs of arbitrarily high connectivity with the same Tutte polynomial and the same value of Z. We conjecture that almost all graphs are determined by their chromatic or Tutte polynomials and provide mild evidence to support this.     

Deformation of Leibniz Algebra Morphisms Over Commutative Local Algebra Base

We study deformations of Leibniz algebra morphisms over a commutative local algebra base with 1. We construct the associated deformation cohomology that controls deformations using the cochain complex defining the Leibniz cohomology.     

系数在基本Harish—Chandra模中的Virasoro代数的上同调群

设ｇ为特征为０的二次闭域上的Ｖｉｒａｓｏｒｏ代数。本文决定了Ｈ＾１（ｇ，Ｍ（４，１）），Ｈ＾２（ｇ，Ｍ（４，２））及Ｈ＾２（ｇ，ＭＬ）的结构，其中Ｍ（４，１），Ｍ（４，２）为两类基本Ｈａｒｉｓｈ－Ｃｈａｎｄｒａ模，ＭＬ为无常数项单变量Ｌａｕｒｅｎｔ多项式。     

Snarks and Flow-Critical Graphs

It is well-known that a 2-edge-connected cubic graph has a 3-edge-colouring if and only if it has a 4-flow. Snarks are usually regarded to be, in some sense, the minimal cubic graphs without a 3-edge-colouring. We defined the notion of 4-flow-critical graphs as an alternative concept towards minimal graphs. It turns out that every snark has a 4-flow-critical snark as a minor. We verify, surprisingly, that less than 5% of the snarks with up to 28 vertices are 4-flow-critical. On the other hand, there are infinitely many 4-flow-critical snarks, as every flower-snark is 4-flow-critical. These observations give some insight into a new research approach regarding Tutteʼs Flow Conjectures.     

两类递归图的Tutte多项式

本文用转移矩阵给出了C2×Pn和N2∨Pn的Tutte多项式的公式,根据公式设计了M ap le程序,该程序对每个固定的整数n 2都能计算出C2×Pn和N2∨Pn的Tutte多项式.     

On the Fundamental Theorem of Algebra

In the paper, it is shown how, by using the minimal means and without introducing complex numbers, one can prove the fundamental theorem of algebra for real polynomials. The fundamental theorem for polynomials with complex coefficients is an immediate corollary of the theorem mentioned.     

图的字典积的非零整数流(英文)

充分利用图的字典积的结构证明了以下结论:如果图G_1的每连通分支都非平凡,图G_2的阶数大于3,那么它们的字典积G_1[G_2]具有非零3-流.     

关于图与圈之并图的圈唯一性

Farrell[1]引进图 G 的圈多项式 c(G;■).文[6]猜测:轮形图 W_8是圈唯一的.本文中我们证明上述猜测为真且讨论了某些图与圈之并图的圈唯一性.     

Flows and Bisections in Cubic Graphs

A k‐weak bisection of a cubic graph G is a partition of the vertex‐set of G into two parts V₁ and V₂ of equal size, such that each connected component of the subgraph of G induced by () is a tree of at most vertices. This notion can be viewed as a relaxed version of nowhere‐zero flows, as it directly follows from old results of Jaeger that every cubic graph G with a circular nowhere‐zero r‐flow has a ‐weak bisection. In this article, we study problems related to the existence of k‐weak bisections. We believe that every cubic graph that has a perfect matching, other than the Petersen graph, admits a 4‐weak bisection and we present a family of cubic graphs with no perfect matching that do not admit such a bisection. The main result of this article is that every cubic graph admits a 5‐weak bisection. When restricted to bridgeless graphs, that result would be a consequence of the assertion of the 5‐flow Conjecture and as such it can be considered a (very small) step toward proving that assertion. However, the harder part of our proof focuses on graphs that do contain bridges.     

Orlik-Solomon Algebras and Tutte Polynomials

The OS algebra A of a matroid M is a graded algebra related to the Whitney homology of the lattice of flats of M. In case M is the underlying matroid of a hyperplane arrangement A in ^r , A is isomorphic to the cohomology algebra of the complement ^r A. Few examples are known of pairs of arrangements with non-isomorphic matroids but isomorphic OS algebras. In all known examples, the Tutte polynomials are identical, and the complements are homotopy equivalent but not homeomorphic.We construct, for any given simple matroid M ₀, a pair of infinite families of matroids M _n and M _n , n 1, each containing M ₀ as a submatroid, in which corresponding pairs have isomorphic OS algebras. If the seed matroid M ₀ is connected, then M _n and M _n have different Tutte polynomials. As a consequence of the construction, we obtain, for any m, m different matroids with isomorphic OS algebras. Suppose one is given a pair of central complex hyperplane arrangements A ₀ and A ₁ . Let S denote the arrangement consisting of the hyperplane {0} in ₁ . We define the parallel connection P(A ₀, A ₁), an arrangement realizing the parallel connection of the underlying matroids, and show that the direct sums A ₀ A ₁ and S P (A ₀, A ₁) have diffeomorphic complements.     

On Hochschild Cohomology of a Self-injective Special Biserial Algebra Obtained by a Circular Quiver with Double Arrows

We calculate the dimensions of the Hochschild cohomology groups of a self-injective special biserial algebra Λ _s obtained by a circular quiver with double arrows. Moreover, we give a presentation of the Hochschild cohomology ring modulo nilpotence of Λ _s by generators and relations. This result shows that the Hochschild cohomology ring modulo nilpotence of Λ _s is finitely generated as an algebra.     

Invariants of Composite Networks Arising as a Tensor Product

We generalize Brylawski’s formula of the Tutte polynomial of a tensor product of matroids to colored connected graphs, matroids, and disconnected graphs. Unlike the non-colored tensor product where all edges have to be replaced by the same graph, our colored generalization of the tensor product operation allows individual edge replacement. The colored Tutte polynomials we compute exists by the results of Bollobás and Riordan. The proof depends on finding the correct generalization of the two components of the pointed Tutte polynomial, first studied by Brylawski and Oxley, and on careful enumeration of the connected components in a tensor product. Our results make the calculation of certain invariants of many composite networks easier, provided that the invariants are obtained from the colored Tutte polynomials via substitution and the composite networks are represented as tensor products of colored graphs. In particular, our method can be used to calculate (with relative ease) the expected number of connected components after an accident hits a composite network in which some major links are identical subnetworks in themselves.      

S~(GS*)类图簇的伴随多项式的因式分解及其色性

通过研究SGS*类图簇的伴随多项式的因式分解,证明了这类图簇的补图的色等价图的结构特征.     

单圈图的伴随多项式的极小根（英文）

引入伴随多项式是为了从补图的角度研究色多形式,图的伴随多项式的极小根可用于判定色等价图.β（G）表示图G的伴随多项式的极小根.n表示n个顶点的单圈图的集合.分别确定了具有max{β（G）｜G∈Ωn}和min{β（G）｜G∈Ωn}的所有单圈图.     

Hopf Algebra Equivariant Cyclic Cohomology, K-theory and Index Formulas

For an algebra with an action of a Hopf algebra we establish the pairing between equivariant cyclic cohomology and equivariant K-theory for . We then extend this formalism to compact quantum group actions and show that equivariant cyclic cohomology is a target space for the equivariant Chern character of equivariant summable Fredholm modules. We prove an analogue of Julg's theorem relating equivariant K-theory to ordinary K-theory of the C^*-algebra crossed product, and characterize equivariant vector bundles on quantum homogeneous spaces.     

超Schrödinger代数J(1/1)的上同调

本文具体计算了系数在超Schrödinger代数J（1/1）的平凡模和有限维不可约模中的第一阶上同调群与第二阶上同调群,并给出了系数在通用包络代数U（J（1/1））中J（1/1）的第一阶与第二阶上同调群的维数是无限维的.     

S~s一类图簇的伴随多项式的因式分解及色性分析

通过研究图的伴随多项式的因式分解 ,给出了证明非色唯一图的一种新方法 ,并且得到了色等价图的一些结构特性 .