Local 3-cocycles of von Neumann algebras

We show that every local 3-cocycle of a von Neumann algebra R into an arbitrary unital dual R-bimodule S is a 3-cocycle.     

Notes on 2-parameter quantum groupsⅠ

A simpler definition for a class of 2-parameter quantum groups associated to semisimple Lie algebras is given in terms of Euler form.Their positive parts turn out to be 2-cocycle deformations of each other under some conditions.An operator realization of the positive part is given.     

三角矩阵上的Hochschild 2-循环广义若当导子

In this paper,we prove that every generalized Jordan derivation associate with a Hochschild 2-cocycle from the algebra of upper triangular matrices to its bimodule is the sum of a generalized derivation and an antiderivation.     

Twisted bounded-dilation group C*-algebras as C*-metric algebras

We construct a class of C~*-metric algebras. We prove that for a discrete group Γ with a 2-cocycle σ,the closure of the seminorm ||[M?, ·]|| on Cc(Γ, σ) is a Leibniz Lip-norm on the twisted reduced group C~*-algebra C*r(Γ, σ) for the pointwise multiplication operator M?on ?2(Γ), induced by a proper length function ? on Γ with the property of bounded θ-dilation. Moreover, the compact quantum metric space structures depend only on the cohomology class of 2-cocycles in the Lipschitz isometric sense.     

On Trees with Double Domination Number Equal to the 2-Outer-Independent Domination Number Plus One

A vertex of a graph is said to dominate itself and all of its neighbors.A double dominating set of a graph G is a set D of vertices of G,such that every vertex of G is dominated by at least two vertices of D.The double domination number of a graph G is the minimum cardinality of a double dominating set of G.For a graph G =(V,E),a subset D V(G) is a 2-dominating set if every vertex of V(G) \ D has at least two neighbors in D,while it is a 2-outer-independent dominating set of G if additionally the set V(G)\D is independent.The 2-outer-independent domination number of G is the minimum cardinality of a 2-outer-independent dominating set of G.This paper characterizes all trees with the double domination number equal to the 2-outer-independent domination number plus one.     

Geometry of 2×2 hermitian matrices

Let D be a division ring which possesses an involution a→ā. Assume that F = {a∈D|a=ā} is a proper subfield of D and is contained in the center of D. It is pointed out that if D is of characteristic not two, D is either a separable quadratic extension of F or a division ring of generalized quaternions over F and that if D is of characteristic two, D is a separable quadratic extension of F. Thus the trace map Tr: D→F,hermitian matrices over D when n≥3 and now can be deleted. When D is a field, the fundamental theorem of 2×2 hermitian matrices over D has already been proved. This paper proves the fundamental theorem of 2×2 hermitian matrices over any division ring of generalized quaternions of characteristic not two.     

The Order of Hypersubstitutions of Type （2, 2）

Hypersubstitutions are mappings which map operation symbols to terms of the corresponding arities. They were introduced as a way of making precise the concept of a hyperidentity and generalizations to M-hyperidentities. A variety in which every identity is satisfied as a hyperidentity is called solid. If every identity is an M-hyperidentity for a subset M of the set of all hypersubstitutions, the variety is called M-solid. There is a Galois connection between monoids of hypersubstitutions and sublattices of the lattice of all varieties of algebras of a given type. Therefore, it is interesting and useful to know how semigroup or monoid properties of monoids of hypersubstitutions transfer under this Galois connection to properties of the corresponding lattices of M-solid varieties. In this paper, we study the order of each hypersubstitution of type （2, 2）, i.e., the order of the cyclic subsemigroup generated by that hypersubstitution of the monoid of all hypersubstitutions of type （2, 2）. The main result is that the order is 1, 2, 3, 4 or infinite.     

Heavy cycles in 2-connected triangle-free weighted graphs

A weighted graph is one in which every edge e is assigned a nonnegative number, called the weight of e. The sum of the weights of the edges incident with a vertex v is called the weighted degree of v, denoted by dw(v). The weight of a cycle is defined as the sum of the weights of its edges. Fujisawa proved that if G is a 2-connected triangle-free weighted graph such that the minimum weighted degree of G is at least d, then G contains a cycle of weight at least 2d. In this paper, we proved that if G is a2-connected triangle-free weighted graph of even size such that dw(u) + dw(v) ≥ 2d holds for any pair of nonadjacent vertices u, v ∈ V(G), then G contains a cycle of weight at least 2d.     

H（2）-unknotting Number of a Knot

An H（2）-move is a local move of a knot which is performed by adding a half-twisted band. It is known an H（2）-move is an unknotting operation. We define the H（2）-unknotting number of a knot K to be the minimum number of H（2）-moves needed to transform K into a trivial knot. We give several methods to estimate the H（2）-unknotting number of a knot. Then we give tables of H（2）-unknotting numbers of knots with up to 9 crossings.     

On the Ratio Between 2-Domination and Total Outer-Independent Domination Numbers of Trees

A 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D.A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D,and the set V(G)\D is independent.The 2-domination(total outer-independent domination,respectively)number of a graph G is the minimum cardinality of a 2-dominating(total outer-independent dominating,respectively)set of G.We investigate the ratio between2-domination and total outer-independent domination numbers of trees.     

2- 上循环交叉积

利用 von Neumann 代数 M 和带有正规的2- 上循环 μ 的离散群 G, 定义了2- 上循环交叉积, 推广了经典的离散交叉积, 并证明了2- 上循环交叉积具有结合律.     

Effective lifting of 2-cocycles for Galois cohomology

We give explicit formulas for reducing the problem of determining whether a given 2-cocycle is a coboundary and if so finding a lifting 1-cochain to a system of norm equations.     

因子Von Neumann代数中套子代数上的局部3-上循环

证明了因子von Neumann代数中的套子代数到其单位对偶双模内的每个弱连续的局部3-上循环都是3-上循环.     

δ-Jordan李超代数的交换扩张

通过δ-Jordan李超代数T的表示和上同调理论,构造δ-Jordan李超代数T■V.证明了δ-Jordan李超代数的等价交换扩张给出相同的表示.通过δ-Jordan李超代数的表示和其交换扩张得到2-上圈.     

Sur une Question (Orale) de Michèle Vergne

Résumé

On donne une réponse explicite à la question suivante: étant donné un 3-cocycle Φ (sur le groupe G = ? ^N , à valeurs dans le G-module trivial ?) dont l'antisymétrisé est nul, construire une 2-cochaîne admettant Φ comme cobord.

Abstract

We give an explicit answer to the following question: given a 3-cocycle Φ (on the group G = ? ^N , with values in the trivial G-module ?) whose antisymmetric part is zero, construct a 2-cochain having Φ as coboundary.