The generalized column incidence graph and a matroid base-listing algorithm

The generalized column incidence graph of a matroid base is defined, and it is shown that all elements on a minimal path in this graph lie in a common circuit. Also, an algorithm is provided which lists all bases of a matroid and calculates the Whitney and Tutte polynomials. The complexity of this algorithm is shown to be O(mN(n- m)(c(M) + m)), where Mis a matroid of rank mon a set of cardinality nNis the number of bases of M, and c(M) is the complexity of checking independence in M.     

最大匹配的路变换图

图G的最大匹配的路变换图NM(G)是这样一个图,它以G的最大匹配为顶点,如果两个最大匹配M_1与M_2的对称差导出的图是一条路(长度没有限制),那么M_1和M_2在NM(G)中相邻.研究了这个变换图的连通性,分别得到了这个变换图是一个完全图或一棵树或一个圈的充要条件.     

Algorithms for finding a Kth best valued assignment

We consider a new problem, the Kth best valued assignment problem. Given a bipartite graph G and a cost vector w on its edge set, this is the problem of finding a perfect matching M_k in G such that there exist perfect matchings M₁,…,M_K−1 satisfying w(M₁) < < w(M_K−1) < w(M_K), and w(M_K) < w(M) for all perfect matchings M with w(M) ≠ w(M₁),…,w(M_K). Here w(M) denotes the sum of costs of edges in M. In this paper, we propose two algorithms for solving this problem and verify the efficiency of our algorithms by our preliminary computational experiments.     

On size, circumference and circuit removal in 3-connected matroids

This paper proves several extremal results for 3-connected matroids. In particular, it is shown that, for such a matroid M, (i) if the rank r(M) of M is at least six, then the circumference c(M) of M is at least six and, provided |E(M)|4r(M)−5, there is a circuit whose deletion from M leaves a 3-connected matroid; (ii) if r(M)4 and M has a basis B such that Me is not 3-connected for all e in E(M)−B, then |E(M)|3r(M)−4; and (iii) if M is minimally 3-connected but not hamiltonian, then |E(M)|3r(M)−c(M).     

A matrix problem associated with computing Cohen-Macaulay type

Suppose A∈M_n×m(F), B∈M_n×t(F) for some field F. Define Г(AB) to be the set of n×n diagonal matrices D such that the column space of DA is contained in the column space of B. In this paper we determine dim Г(AB). For matrices AB of the same rank we provide an algorithm for computing dim Г(AB).     

A note on linear transformations over integral domains

It is an easy fact from linear algebra that if M is a finite-dimensional vector space over a field R, ϕM→M a diagonalizable linear transformation, and N a ϕ-invariant subspace of M, then ϕ∣N is diagonalizable. We show that an appropriate generalization of this holds for M a torsion-free module over an integral domain R.     

Triangles in 3-connected matroids

A collection F of 3-connected matroids is triangle-rounded if, whenever M is a 3-connected matroid having a minor in F, and T is a 3-element circuit of M, then M has a minor which uses T and is isomorphic to a member of F. An efficient theorem for testing a collection of matroids for this property is presented. This test is used to obtain several results including the following extension of a result of Asano, Nishizeki, and Seymour. Let T be a 3-element circuit of a 3-connected binary nonregular matroid M with at least eight elements. Then M has a minor using T that is isomorphic to S₈ or the generalized parallel connection across T of F₇ and M(K₄).     

On the structure of the group of equivariant diffeomorphisms of G-manifolds with codimension one orbit

It is known that the equivariant diffeomorphism group Diff_G^∞(M)₀ of a principal G-manifold M is perfect. If M has at least two orbit types, then it is not true. The purpose of this paper is to determine the first homology group of Diff_G^∞(M)₀ when M is a G-manifold with codimension one orbit.     

Reconstructing finite group actions and characters from subgroup information

A finite group G is said to be action reconstructible if, for any action of G on a finite set, the numbers of orbits under restriction to each subgroup always give enough information to reconstruct the action up to equivalence. G is character reconstructible if, given any matrix representation of G, the mean value of the character on each subgroup always gives enough information to reconstruct the character. The conjugacy matrix of G is the matrix whose (ij) entry is the number of elements of the jth conjugacy class belonging to a typical subgroup of the ith subgroup conjugacy class. It is shown that G is action reconstructible if and only if the rows of this matrix are linearly independent (which is in turn true if and only if G is cyclic), and is character reconstructible if and only if the columns are linearly independent (which is true if and only if any two elements of G which generate conjugate cyclic subgroups are themselves conjugate).     

A Hadamard product involving N-matrices

We show that for any pair M,N of n by n M-matrices, the Hadamard (entry-wise) product M°N_-1 is again an M-matrix. For a single M-matrix M, the matrix M°M^-1 is also considered.     

Zagreb indices of graphs

The first Zagreb index M₁(G) is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index M₂(G) is equal to the sum of the products of the degrees of pairs of adjacent vertices of the underlying molecular graph G. In this paper, we obtain lower and upper bounds on the first Zagreb index M₁(G) of G in terms of the number of vertices (n), number of edges (m), maximum vertex degree (Δ), and minimum vertex degree (δ). Using this result, we find lower and upper bounds on M₂(G). Also, we present lower and upper bounds on M₂(G) +M₂(G) in terms of n, m, Δ, and δ, where G denotes the complement of G. Moreover, we determine the bounds on first Zagreb coindex M₁(G) and second Zagreb coindex M₂(G). Finally, we give a relation between the first Zagreb index and the second Zagreb index of graph G.     

Reconstruction of infinite locally finite connected graphs

Let G be an infinite locally finite connected graph. We study the reconstructibility of G in relation to the structure of its end set . We prove that an infinite locally finite connected graph G is reconstructible if there exists a finite family (Ω_i)_0i (n2) of pairwise finitely separable subsets of such that, for all x,y,x′,y′V(G) and every isomorphism f of G−{x,y} onto G−{x′,y′} there is a permutation π of {0,…,n−1} such that for 0i<n. From this theorem we deduce, as particular consequences, that G is reconstructible if it satisfies one of the following properties: (i) G contains no end-respecting subdivision of the dyadic tree and has at least two ends of maximal order; (ii) the set of thick ends or the one of thin ends of G is finite and of cardinality greater than one. We also prove that if almost all vertices of G are cutvertices, then G is reconstructible if it contains a free end or if it has at least a vertex which is not a cutvertex.     

Wandering subspaces and quasi-wandering subspaces in the Hardy–Sobolev spaces

In this paper, we prove that for-1/2 ≤β≤0.suppose M is an invariant subspaces of the Hardy Sobolev spaces H_β~2(D) for T_z~β, then M() zM is a generating wandering subspace of M, that is,M=[MzM]_T_z~β Moreover, any non-trivial invariant subspace M of H_β~2(D) is also generated by the quasi-wandering subspace P_MT_z~βM~⊥ that is,M=[P_MT_z~βM~⊥]_(T_z~β).     

On modules with the Kulikov property and pure semisimple modules and rings

For an R-module M let σ[M] denote the category of submodules of M-generated modules. M has the Kulikov property if submodules of pure projective modules in σ[M] are pure projective. The following is proved: Assume M is a locally noetherian module with the Kulikov property and there are only finitely many simple modules in σ[M]. Then, for every n ε , there are only finitely many indecomposable modules of length n in σ[M].

With our techniques we provide simple proofs for some results on left pure semisimple rings obtained by Prest and Zimmermann-Huisgen and Zimmermann with different methods.     

An approach to deciding the observational equivalence of Algol-like languages

We prove that the observational equivalence of third-order finitary (i.e. recursion-free) Idealized Algol (IA) is decidable using Game Semantics. By modelling the state explicitly in our games, we show that the denotation of a term M of this fragment of IA is a compactly innocent strategy-with-state, i.e. the strategy is generated by a finite view function f_M. Given any such f_M, we construct a real-time deterministic pushdown automaton (DPDA) that recognizes the complete plays of the knowing-strategy denotation of M. Since such plays characterize observational equivalence, and there is an algorithm for deciding whether any two DPDAs recognize the same language, we obtain a procedure for deciding the observational equivalence of third-order finitary IA. Restricted to second-order terms, the DPDA representation cuts down to a deterministic finite automaton; thus our approach gives a new proof of Ghica and McCusker’s regular-expression characterization for this fragment. Our algorithmic representation of program meanings, which is compositional, provides a foundation for model-checking a wide range of behavioural properties of IA and other cognate programming languages. Another result concerns second-order IA with full recursion: we show that observational equivalence for this fragment is undecidable.     

π-Armendariz rings relative to a monoid

Let Mbe a monoid. A ring Ris called M-π-Armendariz if whenever α = a₁g₁+ a₂g₂+ · · · + a_ng_n, β = b₁h₁+ b₂h₂+ · · · + b_mh_m ∈ R[M] satisfy αβ ∈ nil(R[M]), then aibj ∈ nil(R) for all i, j. A ring R is called weakly 2-primal if the set of nilpotent elements in R coincides with its Levitzki radical. In this paper, we consider some extensions of M-π-Armendariz rings and further investigate their properties under the condition that R is weakly 2-primal. We prove that if R is an M-π-Armendariz ring then nil(R[M]) = nil(R)[M]. Moreover, we study the relationship between the weak zip-property (resp., weak APP-property, nilpotent p.p.-property, weak associated prime property) of a ring R and that of the monoid ring R[M] in case R is M-π-Armendariz.     

Topological collapsings and cylindrical neighborhoods in 3-manifolds

We introduce the concept of topological collapsing as a topological abstraction of polyhedral ones. Then we use this concept to characterize the cylindrical neighborhoods of a closed X in a locally compact separable metric space M such that M - X is a 3-manifold. We also prove the following criterion of existence: X has cylindrical neighborhoods in M iff there is a neighborhood N of X in M which is topologically collapsible onto X respecting Bd(M - X).     

Cellular Chain Complex of Small Covers with Integer Coefficients and Its Application

Let Pⁿ be a simple n-polytope with a Z²-characteristic function λ. And h is a Morse function over Pⁿ. Then the small cover Mⁿ(λ) corresponding to the pair (Pⁿ, λ) has a cell structure given by h. From this cell structure we can derive a cellular chain complex of Mⁿ(λ) with integer coefficients. In this paper, firstly, we discuss the highest dimensional boundary morphism ∂_n of this cellular chain complex and get that ∂_n=0 or 2 by a natural way. And then, from the well-known result that the submanifold corresponding to (F, λ_F) is naturally a small cover with dimension k, where F is any k-face of Pⁿ and λ_F is the restriction of λ on F, we get that ∂_k=0 or ±2 for 0 ≤ k < n. Finally, by using the definition of inherited characteristic function which is the restriction of λ on the faces of Pⁿ, we get a way to calculate the homology groups of Mⁿ(λ). Applying our result to a 3-small cover we have that the homology groups of any 3-small cover is torsion-free or has only 2-torsion.     

Incidence matrices, geometrical bases, combinatorial prebases and matroids

For a relation A (C × D), where C,D are two finite sets, and an ordering σ of C we construct a matroid M(σ) on the set D. For the relation A with the incidence matrix  we also define a geometrical basis with respect to F, where F is a subset of the set of all circuits of the column matroid on Â. Geometrical bases are certain bases of this column matroid. We establish connections between the bases of matroids M(σ) and the geometrical bases of A with respect to F. These connections give a combinatorial way of constructing bases of the column matroid on  using a subset F of its circuits.

We also consider a matroid M and the incidence relation between what we call the extended circuits of M and the bases of M. Applying the technique above we obtain the matroids M(σ) on the set of bases of the matroid M. In case of the incidence relation between vertices and edges of a graph this technique yields a unique matroid, the usual matroid of the graph.

Some particular relations are considered: a class of relations with a certain property (the T-property) and the relation of inclusion of chambers in simplices in an affine point configuration.