Cauchy’s residue theorem for a class of real valued functions

Let [a, b] be an interval in ℝ Rand let F be a real valued function defined at the endpoints of [a, b] and with a certain number of discontinuities within [a, b]. Assuming F to be differentiable on a set [a, b] | E to the derivative f, where E is a subset of [a, b] at whose points F can take values ±∞ or not be defined at all, we adopt the convention that F and f are equal to 0 at all points of E and show that KH-vt ∝ _a ^b f = F(b) − F(a), where KH-vt denotes the total value of the Kurzweil-Henstock integral. The paper ends with a few examples that illustrate the theory.     

Picard Groups of Rings of Coinvariants

Let k be a field, H a Hopf k-algebra with bijective antipode, A a right H-comodule algebra and C a Hopf algebra with bijective antipode which is also a right H-module coalgebra. Under some appropriate assumptions, and assuming that the set of grouplike elements G(A ⊗ C) of the coring A ⊗ C is a group, we show how to calculate, via an exact sequence, the Picard group of the subring of coinvariants in terms of the Picard group of A and various subgroups of G(A ⊗ C). Presented by: Claus Ringel.     

The structure of the 3-separations of 3-connected matroids

Tutte defined a k-separation of a matroid M to be a partition (A,B) of the ground set of M such that |A|,|B|k and r(A)+r(B)−r(M)<k. If, for all m<n, the matroid M has no m-separations, then M is n-connected. Earlier, Whitney showed that (A,B) is a 1-separation of M if and only if A is a union of 2-connected components of M. When M is 2-connected, Cunningham and Edmonds gave a tree decomposition of M that displays all of its 2-separations. When M is 3-connected, this paper describes a tree decomposition of M that displays, up to a certain natural equivalence, all non-trivial 3-separations of M.     

The Recognition of Double Euler Trails in Series-Parallel Networks

Given a series-parallel network (network, for short)N, its dual networkN′ is given by interchanging the series connection and the parallel connection of networkN. We usually use a series-parallel graph to represent a network. LetG[N] andG[N′] be graph representations ofNandN′, respectively. A sequence of edgese₁, e₂,…,e_kis said to form a common trail on (G[N], G[N′]) if it is a trail on bothG[N] andG[N′]. If a common trail covers all of the edges inG[N] andG[N′], it is called adouble Euler trail.However, there are many different graph representations for a network. We say that a networkNhas a double Euler trail (DET) if there is a common Euler trail for someG[N] and someG[N′]. Finding a DET in a network is essential for optimizing the layout area of a complementary CMOS functional cell. Maziasz and Hayes (IEEE Trans. Computer-Aided Design9(1990), 708–719) gave a linear time algorithm for solving the layout problem in fixedG[N] andG[N′] and an exponential algorithm for finding the optimal cover in a network without fixing graph representations. In this paper, we study properties of subnetworks of a DET network. According to these properties, we propose an algorithm that automatically generates the rules for composition of trail cover classes. On the basis of these rules, a linear time algorithm for recognizing DET networks is presented. Furthermore, we also give a necessary and sufficient condition for the existence of a double Euler circuit in a network.     

The spanning trees forced by the path and the star

A set S of trees of order n forces a tree T if every graph having each tree in S as a spanning tree must also have T as a spanning tree. A spanning tree forcing set for order n that forces every tree of order n. A spanning-tree forcing set S is a test set for panarboreal graphs, since a graph of order n is panarboreal if and only if it has all of the trees in S as spanning trees. For each positive integer n ≠ 1, the star belongs to every spanning tree forcing set for order n. The main results of this paper are a proof that the path belongs to every spanning-tree forcing set for each order n ∉ {1, 6, 7, 8} and a computationally tractable characterization of the trees of order n ≥ 15 forced by the path and the star. Corollaries of those results include a construction of many trees that do not belong to any minimal spanning tree forcing set for orders n ≥ 15 and a proof that the following related decision problem is NP-complete: an instance is a pair (G, T) consisting of a graph G of order n and maximum degree n - 1 with a hamiltonian path, and a tree T of order n; the problem is to determine whether T is a spanning tree of G. © 1996 John Wiley & Sons, Inc.     

G-Identities of Nilpotent Groups. I

The structure of a group V _n,red(G) of reduced G-identities of rank n is treated subject to the condition that G is a nilpotent group of class 1 or 2. The results obtained allow us to settle the question of whether a G-variety G-var(G) generated by a nilpotent group G of class 2 is finitely based. Moreover, we introduce the concepts of a d-commutator subgroup and of a main d-group, associated with G.     

On the chromatic spectrum of acyclic decompositions of graphs

If G is any graph, a G‐decomposition of a host graph H = (V, E) is a partition of the edge set of H into subgraphs of H which are isomorphic to G. The chromatic index of a G‐decomposition is the minimum number of colors required to color the parts of the decomposition so that two parts which share a node get different colors. The G‐spectrum of H is the set of all chromatic indices taken on by G‐decompositions of H. If both S and T are trees, then the S‐spectrum of T consists of a single value which can be computed in polynomial time. On the other hand, for any fixed tree S, not a single edge, there is a unicyclic host whose S‐spectrum has two values, and if the host is allowed to be arbitrary, the S‐spectrum can take on arbitrarily many values. Moreover, deciding if an integer k is in the S‐spectrum of a general bipartite graph is NP‐hard. We show that if G has c > 1 components, then there is a host H whose G‐spectrum contains both 3 and 2c + 1. If G is a forest, then there is a tree T whose G‐spectrum contains both 2 and 2c. Furthermore, we determine the complete spectra of both paths and cycles with respect to matchings. © 2007 Wiley Periodicals, Inc. J Graph Theory 56: 83–104, 2007     

Circular colorings of weighted graphs

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t. A t-circular coloring of (G, w) is a mapping Δ of the vertices of G to arcs of C such that Δ(x)∩Δ(y) = 0 if (x, y) ∈ E(G) and Δ(x) has length w(x). The circular-chromatic number of (G, w) is the least t for which there is a t-circular coloring of (G, w). This paper discusses basic properties of circular chromatic number of a weighted graph and relations between this parameter and other graph parameters. We are particularly interested in graphs G for which the circular-chromatic number of (G, w) is equal to the fractional clique weight of (G, w) for arbitrary weight function w. We call such graphs star-superperfect. We prove that odd cycles and their complements are star-superperfect. We then prove a theorem about the circular chromatic number of lexicographic product of graphs which provides a tool of constructing new star-superperfect graphs from old ones. © 1996 John Wiley & Sons, Inc.     

Class groups and Brauer groups

LetF be a global field,n a positive integer not divisible by the characteristic ofF. Then there exists a finite extensionE ofF whose class group has a cyclic direct summand of ordern. This theorem, in a slightly stronger form, is applied to determine completely, on the basis of the work of Fein and Schacher, the structure of the Brauer group Br(F()) of the rational function fieldF(t). As a consequence of this, an additional theorem of the above authors, together with a note at the end of the paper, imply that Br(F(t)) ≊ Br(F(t ₁, ···,t _n)), wheret ₁, ···,t _n are algebraically independent overF.     

Infinite families of surface symmetries

Consider a sequenceN _a,b :g ↦ag+b, g=2,3,… wherea, b are rational numbers anda≥0. We say thatN _a,b is admissible if for infinitely manyg’s there exists a finite groupG of orientation-preserving homeomorphisms of a compact orientable surface of genusg such that |G|=N _a,b (g). In this case we shall also say thatG belongs toN _a,b . The main result of the paper is that ifa+b≠0, then any group belonging toN _a,b contains a cyclic subgroup of bounded index, where the bound depends only ona,b. Moreovera+b is positive, and 2b/a is an integer. This implies, for instance, that there are only finitely many possibilities for perfect subgroups or quotient groups of groups belonging toN _a,b . Partially supported by an NFS grant, and a PSC-CUNY award. Dedicated to A. M. Macbeath with much respect     

Structure of relatively free dimonoids

Loday introduced the notion of a dimonoid and constructed the free dimonoid. The paper concerns the variety theory of dimonoids. We recall and summarize the results obtained by Loday, the author as well as others on the structure of some relatively free dimonoids. This part of the paper should be viewed as a survey, however we include some new ideas in the last sections. Namely, we construct a free (?z;rs)-dimonoid, a free (rs;rz)-dimonoid, a free rs-dimonoid, a free (rb;rs)-dimonoid, a free (rs;rb)-dimonoid and characterize the least (?z;rs)-congruence, the least (rs;rz)-congruence, the least rs-congruence, the least (rb;rs)-congruence and the least (rs;rb)-congruence on the free dimonoid. We also establish that the automorphism groups of constructed free algebras are isomorphic to the symmetric group and the semigroups of the free rs-dimonoid are anti-isomorphic.     

Derivations with algebraic values of bounded degree

Let Rbe a prime algebra over a field .F, d a nonzero derivation of Rand ρ a nonzero right ideal of R. Suppose that for every x∈ ρ,d(x) is algebraic over Fof bounded degree. Then Ris a primitive ring with a minimal right ideal eR, where e=e² ∈Rand eReis a finite-dimensional central division algebra, except when dis an inner derivation induced by an element a in the two-sided Martindale quotient ring of Rsuch that aρp = 0. An analogous result is also proved for the Lie ideal case.     

On a class of groups of prime-power order

LetG be a finitep-group,d(G)=dimH ¹ (G, Z _p) andr(G)=dimH ²(G, Z_p). Thend(G) is the minimal number of generators ofG, and we say thatG is a member of a classG _p of finitep-groups ifG has a presentation withd(G) generators andr(G) relations. We show that ifG is any finitep-group, thenG is the direct factor of a member ofG _p by a member ofG _p .     

Unions of three starshaped sets in R2

LetS be a compact, simply connected set inR ². If every boundary point ofS is clearly visible viaS from at least one of the three pointsa, b, c, thenS is a union of three starshaped sets whose kernels containa, b, c, respectively. The result fails when the number three is replaced by four.As a partial converse, ifS is a union of three starshaped sets whose kernels containa, b, c, respectively, then the set of points in the boundary ofS clearly visible from at least one ofa, b, orc is dense in the boundary ofS.Supported in part by NSF grant DMS-8705336.     

On JB -Rings

A ring R is a QB-ring provided that aR + bR = R with a, b ∈ R implies that there exists a y ∈ R such that It is said that a ring R is a JB-ring provided that R/J(R) is a QB-ring, where J(R) is the Jacobson radical of R. In this paper, various necessary and sufficient conditions, under which a ring is a JB-ring, are established. It is proved that JB-rings can be characterized by pseudo-similarity. Furthermore, the author proves that R is a JB-ring iff so is R/J(R)².     

Lifting Modules with Indecomposable Decompositions

A module M is called a “lifting module” if, any submodule A of M contains a direct summand B of M such that A/B is small in M/B. This is a generalization of projective modules over perfect rings as well as the dual of extending modules. It is well known that an extending module with ascending chain condition (a.c.c.) on the annihilators of its elements is a direct sum of indecomposable modules. If and when a lifting module has such a decomposition is not known in general. In this article, among other results, we prove that a lifting module M is a direct sum of indecomposable modules if (i) rad(M ^(I)) is small in M ^(I) for every index set I, or, (ii) M has a.c.c. on the annihilators of (certain) elements, and rad(M) is small in M.     

Basic Sequences in the Dual of a Fréchet Space

In this paper we study some properties of basic sequences in the dual of a Fréechet space. As a consequence we obtain that if E is a Fréechet space with the property that for each closed subspace F of E and each bounded subset B of E/F there is a bounded subset A of E with φ(A) = B, where φ denotes the canonical surjection of E onto E/F, then one of the following conditions is at least satisfied: 1. E is a Banach space, 2. E is a Schwartz space, 3. E is the product of a Banach space by ω. Finally, we also obtain some results concerning totally reflexive spaces.     

Some connected ramsey numbers

A graph G is co-connected if both G and its complement ? are connected and nontrivial. For two graphs A and B, the connected Ramsey number r_c(A, B) is the smallest integer n such that there exists a co-connected graph of order n, and if G is a co-connected graph on at least n vertices, then A ? G or B ? ?. If neither A or B contains a bridge, then it is known that r_c(A, B) = r(A, B), where r(A, B) denotes the usual Ramsey number of A and B. In this paper r_c(A, B) is calculated for some pairs (A, B) when r(A, B) is known and at least one of the graphs A or B has a bridge. In particular, r_c(A, B) is calculated for A a path and B either a cycle, star, or complete graph, and for A a star and B a complete graph.