Ideal extensions of graph algebras

Let A and B be graph algebras. In this paper we present the notion of an ideal in a graph algebra and prove that an ideal extension of A by B always exists. We describe (up to isomorphism) all such extensions.     

Minimal prime ideals in enveloping algebras of Lie superalgebras

Let be a finite dimensional Lie superalgebra over a field of characteristic zero. Let be the enveloping algebra of . We show that when , then is not semiprime, but it has a unique minimal prime ideal; it follows then that when is classically simple, has a unique minimal prime ideal. We further show that when is a finite dimensional nilpotent Lie superalgebra, then has a unique minimal prime ideal.

     

Contractors and connectors of graph algebras

We study generalizations of the “contraction‐deletion” relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman at al [Reflection positivity, rank connectivity, and homomorphisms of graphs, J. Amer. Math. Soc. 20 (2007), 37–51.] Graph algebras are defined by a graph parameter, and they were introduced in order to study and characterize homomorphism functions. We prove that for homomorphism functions, these graph algebras have special elements called “contractors” and “connectors”. This gives a new characterization of homomorphism functions. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 11–30, 2009     

Connectivity of the uniform random intersection graph

A uniform random intersection graphG(n,m,k) is a random graph constructed as follows. Label each of n nodes by a randomly chosen set of k distinct colours taken from some finite set of possible colours of size m. Nodes are joined by an edge if and only if some colour appears in both their labels. These graphs arise in the study of the security of wireless sensor networks, in particular when modelling the network graph of the well-known key predistribution technique due to Eschenauer and Gligor.The paper determines the threshold for connectivity of the graph G(n,m,k) when n→∞ in many situations. For example, when k is a function of n such that k≥2 and m=⌊n^α⌋ for some fixed positive real number α then G(n,m,k) is almost surely connected when

lim infk²n/mlogn>1,     

On the total variation distance between the binomial random graph and the random intersection graph

When each vertex is assigned a set, the intersection graph generated by the sets is the graph in which two distinct vertices are joined by an edge if and only if their assigned sets have a nonempty intersection. An interval graph is an intersection graph generated by intervals in the real line. A chordal graph can be considered as an intersection graph generated by subtrees of a tree. In 1999, Karoński, Scheinerman, and Singer‐Cohen introduced a random intersection graph by taking randomly assigned sets. The random intersection graph has n vertices and sets assigned to the vertices are chosen to be i.i.d. random subsets of a fixed set M of size m where each element of M belongs to each random subset with probability p, independently of all other elements in M. In 2000, Fill, Scheinerman, and Singer‐Cohen showed that the total variation distance between the random graph and the Erdös‐Rényi graph tends to 0 for any if , where is chosen so that the expected numbers of edges in the two graphs are the same. In this paper, it is proved that the total variation distance still tends to 0 for any whenever .     

Lattice orders on matrix algebras

We construct all the lattice orders (up to isomorphism) on a full matrix algebra over a subfield of the field of real numbers so that it becomes a lattice-ordered algebra. Received June 26, 2001; accepted in final form February 9, 2002.     

On the scarcity of lattice-ordered matrix algebras II

We correct and complete Weinberg's classification of the lattice-orders of the matrix ring and show that this classification holds for the matrix algebra where is any totally ordered field. In particular, the lattice-order of obtained by stipulating that a matrix is positive precisely when each of its entries is positive is, up to isomorphism, the only lattice-order of with . It is also shown, assuming a certain maximum condition, that is essentially the only lattice-order of the algebra in which the identity element is positive.

     

Degree distribution of a typical vertex in a general random intersection graph

For a general random intersection graph, we show an approximation of the vertex degree distribution by a Poisson mixture. Research supported by Lithuanian State Science and Studies Foundation Grant T-07149.     

A proof of Weinberg's conjecture on lattice-ordered matrix algebras

Let be a subfield of the field of real numbers and let () be the matrix algebra over . It is shown that if is a lattice-ordered algebra over in which the identity matrix 1 is positive, then is isomorphic to the lattice-ordered algebra with the usual lattice order. In particular, Weinberg's conjecture is true.

     

The arithmetical rank of the edge ideals of cactus graphs

We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases, it can be improved. Moreover, we show that the edge ideal of a Cohen–Macaulay graph that contains exactly one cycle or is chordal or has no cycles of length 4 and 5 is a set-theoretic complete intersection.     

On ideals in the bidual of the Fourier algebra and related algebras

Let G be a compact nonmetrizable topological group whose local weight b(G) has uncountable cofinality. Let H be an amenable locally compact group, A(G×H) the Fourier algebra of G×H, and UC₂(G×H) the space of uniformly continuous functionals in VN(G×H)=A^∗(G×H). We use weak factorization of operators in the group von Neumann algebra VN(G×H) to prove that there exist at least ²b(G)² left ideals of dimensions at least ²b(G)² in A(G×H)^∗∗ and in UC₂^∗(G×H). We show that every nontrivial right ideal in A(G×H)^∗∗ and in UC₂^∗(G×H) has dimension at least ²b(G)².     

紧图的两个结果及其应用

双随机矩阵有许多重要的应用, 紧图族可以看作是组合矩阵论中关于双随机矩阵的著名的Birkhoff定理的拓广,具有重要的研究价值． 确定一个图是否紧图是个困难的问题,目前已知的紧图族尚且不多.给出了两个重要结果：任意紧图与任意多个孤立点的不交并是紧图;任意紧图的每一个顶点上各增加一条悬挂边的图是紧图． 利用这两个结果,从已知紧图可构造出无穷多个紧图族．