Characterizations of connected orthogonality graphs of projections of Rickart ∗-rings

In this paper, we study the orthogonality graphs (see Definition 1.2) of ortholattices. We provide a graph theoretic condition for an ortholattice to be orthomodular. We prove that, the orthogonality graphs of two orthomodular lattices are isomorphic if and only if the lattices are isomorphic. As an application, it is proved that the zero-divisor graph of a Rickart ?-ring is obtained by successively duplicating the vertices of the orthogonality graph of the lattice of projections in the ring. We characterize the finite Rickart ?-rings for which the orthogonality graph of projections is connected.     

Symplectic Spaces And Ear-Decomposition Of Matroids

Matroids admitting an odd ear-decomposition can be viewed as natural generalizations of factor-critical graphs. We prove that a matroid representable over a field of characteristic 2 admits an odd ear-decomposition if and only if it can be represented by some space on which the induced scalar product is a non-degenerate symplectic form. We also show that, for a matroid representable over a field of characteristic 2, the independent sets whose contraction admits an odd ear-decomposition form the family of feasible sets of a representable Δ-matroid.     

A NOTE ON TEE ACHIEVMYT GEODETIC GAMES

Abstract

In the article “Geodetic games for graphs” by F. Buckley and F. Harary the geodetic game on a generalized wheel W_m,n is stated to be won by the first player iff m + n is odd. This is incorrect; in this paper we show that the necessary and sufficient condition for the first player is that (1) n ? 4 and m + n is odd or m = 1 and n is even, (2) m = 2 and n = 5, (3) n < 5 and m ≥ 2 and either m or n is odd.     

Enumeration of k-poles

Ak-pole in this paper is a regular planar map withk vertices. Poles with even degrees were first enumerated by Tutte [9] in 1962 where he obtained a very simple and elegant expression. Using Brown's quadratic method, Bender and Canfield [2] derived two algebraic equations for the generating function of the poles. But the equations seem to be quite complicated for the odd degree case, and so far no progress has been seen in utilizing these equations to derive any result for the number of poles with odd degree. In this paper, we use hypergeometric functions to enumerate poles. We will show that the odd degree case is indeed very different from, and much more complicated than, the even degree case. Research supported by NSERC.     

The integral graphs with index 3 and exactly two main eigenvalues

A graph is called integral if the spectrum of its adjacency matrix has only integral eigenvalues. An eigenvalue of a graph is called main eigenvalue if it has an eigenvector such that the sum of whose entries is not equal to zero. In this paper, we show that there are exactly 25 connected integral graphs with exactly two main eigenvalues and index 3.     

Note on a conjecture of toft

A conjecture of Toft [17] asserts that any 4-critical graph (or equivalently, every 4-chromatic graph) contains a fully odd subdivision ofK ₄. We show that if a graphG has a degree three nodev such thatG-v is 3-colourable, then eitherG is 3-colourable or it contains a fully oddK ₄. This resolves Toft's conjecture in the special case where a 4-critical graph has a degree three node, which is in turn used to prove the conjecture for line-graphs. The proof is constructive and yields a polynomial algorithm which given a 3-degenerate graph either finds a 3-colouring or exhibits a subgraph that is a fully odd subdivision ofK ₄. (A graph is 3-degenerate if every subgraph has some node of degree at most three.)     

The tangential end fibration of an aspherical Poincaré complex

We construct a sphere fibration over a finite aspherical Poincaré complex X, which we call the tangential end fibration, under the condition that the universal cover of X is forward tame and simply connected at infinity. We show that it is tangent to X if the formal dimension of X is even or, when the formal dimension is odd, if the diagonal X→X×X admits a Poincaré embedding structure.     

On coloring graphs with locally small chromatic number

In 1973, P. Erdös conjectured that for eachkε2, there exists a constantc _k so that ifG is a graph onn vertices andG has no odd cycle with length less thanc _k n ^1/k , then the chromatic number ofG is at mostk+1. Constructions due to Lovász and Schriver show thatc _k , if it exists, must be at least 1. In this paper we settle Erdös’ conjecture in the affirmative. We actually prove a stronger result which provides an upper bound on the chromatic number of a graph in which we have a bound on the chromatic number of subgraphs with small diameter.     

Some remarks on the odd hadwiger’s conjecture

We say that H has an odd complete minor of order at least l if there are l vertex disjoint trees in H such that every two of them are joined by an edge, and in addition, all the vertices of trees are two-colored in such a way that the edges within the trees are bichromatic, but the edges between trees are monochromatic. Gerards and Seymour conjectured that if a graph has no odd complete minor of order l, then it is (l ? 1)-colorable. This is substantially stronger than the well-known conjecture of Hadwiger. Recently, Geelen et al. proved that there exists a constant c such that any graph with no odd K _k -minor is ck√logk-colorable. However, it is not known if there exists an absolute constant c such that any graph with no odd K _k -minor is ck-colorable. Motivated by these facts, in this paper, we shall first prove that, for any k, there exists a constant f(k) such that every (496k + 13)-connected graph with at least f(k) vertices has either an odd complete minor of size at least k or a vertex set X of order at most 8k such that G–X is bipartite. Since any bipartite graph does not contain an odd complete minor of size at least three, the second condition is necessary. This is an analogous result of Böhme et al. We also prove that every graph G on n vertices has an odd complete minor of size at least n/2α(G) ? 1, where α(G) denotes the independence number of G. This is an analogous result of Duchet and Meyniel. We obtain a better result for the case α(G)= 3.     

Non-isochronicity of the center in polynomial Hamiltonian systems

In 2002 Jarque and Villadelprat proved that planar polynomial Hamiltonian systems of degree 4 have no isochronous centers and raised an open question for general planar polynomial Hamiltonian systems of even degree. Recently, it was proved that a planar polynomial Hamiltonian system is non-isochronous if a quantity, denoted by M_2m−2, can be computed such that M_2m−2≤0. As a corollary of this criterion, the open question was answered for those systems with only even degree nonlinearities. In this paper we consider the case of M_2m−2>0 and give a new criterion for non-isochronicity. Applying the new criterion, we also answer the open question for some cases in which some terms of odd degree are included.     

Perfect Matchings in Balanced Hypergraphs – A Combinatorial Approach

Our topic is an extension of the following classical result of Hall to hypergraphs: A bipartite graph G contains a perfect matching if and only if for each independent set X of vertices, at least |X| vertices of G are adjacent to some vertex of X. Berge generalized the concept of bipartite graphs to hypergraphs by defining a hypergraph G to be balanced if each odd cycle in G has an edge containing at least three vertices of the cycle. Based on this concept, Conforti, Cornuéjols, Kapoor, and Vušković extended Hall's result by proving that a balanced hypergraph G contains a perfect matching if and only if for any disjoint sets A and B of vertices with |A| > |B|, there is an edge in G containing more vertices in A than in B (for graphs, the latter condition is equivalent to the latter one in Hall's result). Their proof is non-combinatorial and highly based on the theory of linear programming. In the present paper, we give an elementary combinatorial proof. Received April 29, 1997     

Two criteria to check whether ideals are direct sums of cyclically presented modules

A famous theorem of commutative algebra due to I. M. Isaacs states that “if every prime ideal of R is principal, then every ideal of R is principal”. Therefore, a natural question of this sort is “whether the same is true if one weakens this condition and studies rings in which ideals are direct sums of cyclically presented modules?” The goal of this paper is to answer this question in the case R is a commutative local ring. We obtain an analogue of Isaacs's theorem. In fact, we give two criteria to check whether every ideal of a commutative local ring R is a direct sum of cyclically presented modules, it suffices to test only the prime ideals or structure of the maximal ideal of R. As a consequence, we obtain: if R is a commutative local ring such that every prime ideal of R is a direct sum of cyclically presented R-modules, then R is a Noetherian ring. Finally, we describe the ideal structure of commutative local rings in which every ideal of R is a direct sum of cyclically presented R-modules.     

Self-dual modules over local rings of curve singularities

Let C be a reduced curve singularity. C is called of finite self-dual type if there exist only finitely many isomorphism classes of indecomposable, self-dual, torsion-free modules over the local ring of C. In this paper it is shown that the singularities of finite self-dual type are those which dominate a simple plane singularity.     

Dirac type condition and Hamiltonian-connected graphs

Abstract

In 1952 Dirac introduced the Dirac type condition and proved that if G is a connected graph of order n ≥ 3 such that δ(G) ≥ n/2, then G is Hamiltonian. In this paper we consider Hamiltonian-connectedness, which extends the Hamiltonian graphs and prove that if G is a connected graph of order n ≥ 3 such that δ(G) ≥ (n ?1)/2, then G is Hamiltonian-connected or G belongs to five families of well-structured graphs. Thus, the condition and the result generalize the above condition and results of Dirac, respectively.     

Galois actions on Q-curves and winding quotients

We prove two ``large images' results for the Galois representations attached to a degree d Q-curve E over a quadratic field K: if K is arbitrary, we prove maximality of the image for every prime p>13 not dividing d, provided that d is divisible by q (but d≠q) with q=2 or 3 or 5 or 7 or 13. If K is real we prove maximality of the image for every odd prime p not dividing d D, where D= disc(K), provided that E is a semistable Q-curve. In both cases we make the (standard) assumptions that E does not have potentially good reduction at all primes p∤6 and that d is square free. The first author is supported by BFM2003-06092.     

Weakly central-vertex complete graphs with applications to commutative rings

The zero-divisor graph of a commutative ring R is the graph whose vertices consist of the nonzero zero-divisors of R such that distinct vertices x and y are adjacent if and only if xy=0. In this paper, a decomposition theorem is provided to describe weakly central-vertex complete graphs of radius 1. This characterization is then applied to the class of zero-divisor graphs of commutative rings. For finite commutative rings whose zero-divisor graphs are not isomorphic to that of Z₄[X]/(X²), it is shown that weak central-vertex completeness is equivalent to the annihilator condition. Furthermore, a schema for describing zero-divisor graphs of radius 1 is provided.     

STRONGLY PRIME GROUP RINGS

Abstract

A ring R is (right) strongly prime (SP) if every nonzero two sided ideal contains a finite set whose right annihilator is zero, SP rings have been studied by Handelman and Lawrence who raised the problem of characterizing SP group algebras. They showed that if R is SP and G is torsion free Abelian, then the group ring RG is SP. The aim of this note is to determine some more group rings which are SP.

For a ring R we also define the strongly prime radical s(R). We then show that s(R)G = s(W) for certain classes of groups.     

Varieties with minimal secant degree and linear systems of maximal dimension on surfaces

In this paper we prove, using a refinement of Terracini's Lemma, a sharp lower bound for the degree of (higher) secant varieties to a given projective variety, which extends the well known lower bound for the degree of a variety in terms of its dimension and codimension in projective space. Moreover we study varieties for which the bound is attained proving some general properties related to tangential projections, e.g. these varieties are rational. In particular we completely classify surfaces (and curves) for which the bound is attained. It turns out that these surfaces enjoy some maximality properties for their embedding dimension in terms of their degree or sectional genus. This is related to classical beautiful results of Castelnuovo and Enriques that we revise here in terms of adjunction theory.     

The Erdős–Pósa Property for Odd Cycles in Graphs of Large Connectivity

Dedicated to the memory of Paul Erdős A graph G is k-linked if G has at least 2k vertices, and, for any vertices , , ..., , , , ..., , G contains k pairwise disjoint paths such that joins for i = 1, 2, ..., k. We say that G is k-parity-linked if G is k-linked and, in addition, the paths can be chosen such that the parities of their lengths are prescribed. We prove the existence of a function g(k) such that every g(k)-connected graph is k-parity-linked if the deletion of any set of less than 4k-3 vertices leaves a nonbipartite graph. As a consequence, we obtain a result of Erdős–Pósa type for odd cycles in graphs of large connectivity. Also, every -connected graph contains a totally odd -subdivision, that is, a subdivision of in which each edge of corresponds to an odd path, if and only if the deletion of any vertex leaves a nonbipartite graph. Received May 13, 1999/Revised June 19, 2000     

A note on locally nilpotent rings with chain conditions

It is shown that a locally nilpotent ring with maximality condition for two-sided ideals is nilpotent. The restriction on the characteristic in one of the author's previously published theorems is lifted. A one-sided nil-ideal of an alternative ring, satisfying the maximality condition for right ideals, is a nilpotent ring. An example is constructed of a commutative locally nilpotent ring A with maximality condition for ideals which is idempotent: A = A².The article was prepared for print by the author and submitted after his death which took place on February 24, 1972.Translated from Matematicheskie Zametki, Vol. 12, No. 2, pp. 121–126, August, 1972.