Search

The main problem that is solved in this paper has the following simple formulation (which is not used in its solution). The group K = Op(C) × Oq(C) acts on the space Mp, q of p × q complex matrices by (a; b) · x = axb–1, and so does its identity component K0 = SOp(C)×SOq(C). A K-orbit (or K0-orbit) in Mp,q is said to be nilpotent if its closure contains the zero matrix. The closure, , of a nilpotent K-orbit (resp. K0-orbit) in Mp,q is a union of and some nilpotent K-orbits (resp. K0-orbits) of smaller dimensions. The description of the closure of nilpotent K-orbits has been known for some time, but not so for the nilpotent K0-orbits. A conjecture describing the closure of nilpotent K0-orbits was proposed in [11] and verièd when min(p, q) ≤ 7. In this paper we prove the conjecture. The proof is based on a study of two prehomogeneous vector spaces attached to and determination of the basic relative invariants of these spaces.The above problem is equivalent to the problem of describing the closure of nilpotent orbits in the real Lie algebra so(p, q) under the adjoint action of the identity component of the real orthogonal group O(p, q).

In an earlier paper [10], we studied a generalized Rao bound for ordered orthogonal arrays and (T, M, S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We include some tables which compare this bound against two previously known bounds for ordered orthogonal arrays. Finally we show that, for even strength, the LP bound is always at least as strong as the generalized Rao bound.

Let G be a connected graph with vertex set V(G).The degree Kirchhoò index of G is defined as S'(G) = Σ{u,v}⊆V(G) d(u)d(v)R(u, v), where d(u) is the degree of vertex u, and R(u, v) denotes the resistance distance between vertices u and v. In this paper, we characterize the graphs having maximum and minimum degree Kirchhoò index among all n-vertex bicyclic graphs with exactly two cycles.

1. Introduction. In this paper we give several general constructions for lattice packings of spheres in real n-dimensional space Rn and complex space Cn. These lead to denser lattice packings than any previously known in R36, R64, R80, …, R128, …. A sequence of lattices is constructed in Rn for n = 24m ≦ 98328 (where m is an integer) for which the density Δ satisfies log2 Δ ≈ – (1.25 …)n, and another sequence in Rn for n = 2m (m any integer) withThe latter appear to be the densest lattices known in very high dimensional space. (See, however, the Remark at the end of this paper.) In dimensions around 216 the best lattices found are about 2131000 times as dense as any previously known.Minkowski proved in 1905 (see [20] and Eq. (23) below) that lattices exist with log2 Δ > –n as n → ∞, but no infinite family of lattices with this density has yet been constructed.

In an earlier paper [6] we considered the application of Lagrangian methods to the enumeration of plane rooted trees with given colour partition. We obtained an expression which generalised Tutte’s result [9], and a correspondence, which, when specialised, gives the de Bruijn-van Aardenne Ehrenfest-Smith-Tutte Theorem [1]. A corollary of these results is a one-to-one correspondence [4], between trees and generalised derangements, for which no combinatorial description has yet been found.In this paper we extend these methods to the enumeration of rooted labelled trees to demonstrate how another pair of well-known and apparently unrelated theorems may be obtained as the result of a single enumerative approach. In particular, we show that a generalisation of Good's result [3], also considered by Knuth [7], and the matrix tree theorem [8] have a common origin in a single system of functional equations, and that they correspond to different coefficients in the power series solution.

In this paper we consider a method for enumerating trees with respect to colour and degree information. The method makes use of elementary decompositions of trees, and the functional equations which are induced. A number of new results are obtained by this means. More specifically, we consider (Section 3) the enumeration of rooted plane X-coloured trees with given colour and edge partitions. Remarkably, the number of such trees which are planted is a multiple of the number of spanning arbores­ cences on a graph with the edge partition as its adjacency matrix. This result is used (Section 4) to obtain the number of rooted plane i£-chromatic trees with fixed chromatic partition, a number given by Tutte [5] for planted trees in the case K = 2. Finally, a new combinatorial correspon­ dence between two sets of trees is given (Section 5) which yields the de Bruijn-van Aardenne Ehrenfest-Smith-Tutte (BEST) theorem as a special case. We use a familiar decomposition of rooted trees. Associated with this is a system of functional equations which may be solved by a specialisa­ tion, given in Section 2, of the Lagrange theorem in many variables. The specialisation accounts for the persistence, in combinatorial enumeration, of determinants of matrices with row and column constraints (see, for example, [6]). Throughout this paper we use the notation: the number of non-root vertices of colour i is nt = ]C^i/

Several years ago, C. Long wrote two papers ([3], [4]) that related to F(n) the number of ordered factorizations of n. The second of these papers [4] was devoted entirely to a discussion of conjectured formula for F(n).

In this paper, we investigate the common approximate fixed point sequences of nonexpansive semigroups of nonlinear mappings {T1}t≥0, i.e., a family such that T0(x) = x, Ts+t = Ts(Tt(x)), where the domain is a metric space (M; d). In particular, we prove that under suitable conditions the common approximate fixed point sequences set is the same as the common approximate fixed point sequences set of two mappings from the family. Then we use the Ishikawa iteration to construct a common approximate fixed point sequence of nonexpansive semigroups of nonlinear mappings.

Let q be an algebraic integer of degree d ≥ 2. Consider the rank of the multiplicative subgroup of ℂ* generated by the conjugates of q. We say q is of full rank if either the rank is d − 1 and q has norm ±1, or the rank is d. In this paper we study some properties of ℤ[q] where q is an algebraic integer of full rank. The special cases of when q is a Pisot number and when q is a Pisot-cyclotomic number are also studied. There are four main results.(1)If q is an algebraic integer of full rank and n is a fixed positive integer, then there are only finitely many m such that disc `ℤ[qm]´ = disc `ℤ[qn]´.(2)If q and r are algebraic integers of degree d of full rank and ℤ[qn] = ℤ[rn] for infinitely many n, then either q = ωr′ or q = Norm(r)2/dω/r′ , where r ′ is some conjugate of r and ω is some root of unity.(3)Let r be an algebraic integer of degree at most 3. Then there are at most 40 Pisot numbers q such that ℤ[q] = ℤ[r].(4)There are only finitely many Pisot-cyclotomic numbers of any fixed order.

Let v ≥ k ≥ 1 and λ ≥ 0 be integers. A block design BD(v, k, λ) is a collection of k-subsets of a v-set X in which every unordered pair of elements from X is contained in exactly λ elements of . More generally, for a fixed simple graph G, a graph design GD(v, G, λ) is a collection of graphs isomorphic to G with vertices in X such that every unordered pair of elements from X is an edge of exactly λ elements of . A famous result of Wilson says that for a fixed G and λ, there exists a GD(v, G, λ) for all sufficiently large v satisfying certain necessary conditions. A block (graph) design as above is resolvable if can be partitioned into partitions of (graphs whose vertex sets partition) X. Lu has shown asymptotic existence in v of resolvable BD(v, k, λ), yet for over twenty years the analogous problem for resolvable GD(v, G, λ) has remained open. In this paper, we settle asymptotic existence of resolvable graph designs.

In previous papers, Barr and Raphael investigated the situation of a topological space Y and a subspace X such that the induced map C(Y ) → C(X) is an epimorphism in the category ᘓℛ of commutative rings (with units). We call such an embedding a ᘓℛ-epic embedding and we say that X is absolute ᘓℛ-epic if every embedding of X is ᘓℛ-epic. We continue this investigation. Our most notable result shows that a Lindelöf space X is absolute ᘓℛ-epic if a countable intersection of βX-neighbourhoods of X is a βX-neighbourhood of X. This condition is stable under countable sums, the formation of closed subspaces, cozero-subspaces, and being the domain or codomain of a perfect map. A strengthening of the Lindelöf property leads to a new class with the same closure properties that is also closed under finite products. Moreover, all σ-compact spaces and all Lindelöf P-spaces satisfy this stronger condition. We get some results in the non-Lindelöf case that are sufficient to show that the Dieudonné plank and some closely related spaces are absolute ᘓℛ-epic.

In this paper, we find a lower bound on the number of cyclic function fields of prime degreelwhose class numbers are divisible by a given integern. This generalizes a previous result of D. Cardon and R. Murty which gives a lower bound on the number of quadratic function fields with class numbers divisible byn.

In the paper we formulate a Covering Property Axiom, CPAprism, which holds in the iterated perfect set model, and show that it implies the following facts, of which (a) and (b) are the generalizations of results of J. Steprāns.(a) There exists a family ℱ of less than continuummany functions from ℝ to ℝ such that ℝ2 is covered by functions from ℱ, in the sense that for every 〈x, y〉 ∈ ℝ2 there exists an f ∈ ℱ such that either f (x) = y or f (y) = x.(b) For every Borel function f : ℝ → ℝ there exists a family ℱ of less than continuum many “” functions (i.e., differentiable functions with continuous derivatives, where derivative can be infinite) whose graphs cover the graph of f.(c) For every n > 0 and a Dn function f: ℝ → ℝ there exists a family ℱ of less than continuum many Cn functions whose graphs cover the graph of f.We also provide the examples showing that in the above properties the smoothness conditions are the best possible. Parts (b), (c), and the examples are closely related to work of A. Olevskiĭ.

This paper deals with generalizations of the notion of a polytope to infinite dimensions. The most general definition is the following: a bounded closed convex subset of a Banach space is called a polytope if each of its finite-dimensional affine sections is a (standard) polytope.We study the relationships between eight known definitions of infinite-dimensional polyhedrality. We provide a complete isometric classification of them, which gives solutions to several open problems. An almost complete isomorphic classification is given as well (only one implication remains open).

Let P be a transitive permutation group of order pm, p an odd prime, containing a regular cyclic subgroup. The main result of this paper is a determination of the suborbits of P. The main result is used to give a simple proof of a recent result by J. Morris on Cayley digraph isomorphisms. Received by the editors August 15, 2002; revised March 18, 2003. The first author was partially supported by the Natural Sciences and Engineering Research Council of Canada under Grant A-4792. The second author was partially supported by the NSFC(19901022), BNSF(19920003), SRF for ROCS SEM, DPFIHE(97000141) and SYSF(19981002). AMS subject classification: 20B25, 05C60. c ©Canadian Mathematical Society 2004. 161

In this paper, we prove a general result computing the number of rational points of bounded height on a projective variety $V$ which is covered by lines. The main technical result used to achieve this is an upper bound on the number of rational points of bounded height on a line. This upper bound is such that it can be easily controlled as the line varies, and hence is used to sum the counting functions of the lines which cover the original variety $V$., Comment: LaTeX, 9 pages, no figures

This paper characterizes when a Delone set X in is an ideal crystal in terms of restrictions on the number of its local patches of a given size or on the heterogeneity of their distribution. For a Delone set X, let NX(T) count the number of translation-inequivalent patches of radius T in X and let MX(T) be the minimum radius such that every closed ball of radius MX(T) contains the center of a patch of every one of these kinds. We show that for each of these functions there is a “gap in the spectrum” of possible growth rates between being bounded and having linear growth, and that having sufficiently slow linear growth is equivalent to X being an ideal crystal.Explicitly, for NX(T), if R is the covering radius of X then either NX(T) is bounded or NX(T) ≥ T/2R for all T > 0. The constant 1/2R in this bound is best possible in all dimensions.For MX(T), either MX(T) is bounded or MX(T) ≥ T/3 for all T > 0. Examples show that the constant 1/3 in this bound cannot be replaced by any number exceeding 1/2. We also show that every aperiodic Delone set X has MX(T) ≥ c(n)T for all T > 0, for a certain constant c(n) which depends on the dimension n of X and is > 1/3 when n > 1.

This paper is concernedwith the structure of the arithmetic sum of a finite number of central Cantor sets. The technique used to study this consists of a duality between central Cantor sets and sets of subsums of certain infinite series. One consequence is that the sum of a finite number of central Cantor sets is one of the following: a finite union of closed intervals, homeomorphic to the Cantor ternary set or an M-Cantorval.

In this paper, we consider the (essential) spectrum of the discrete Laplacian of an infinite graph. We introduce a new quantity for an infinite graph, in terms of which we give new lower bound estimates of the (essential) spectrum and give also upper bound estimates when the infinite graph is bipartite. We give sharp estimates of the (essential) spectrum for several examples of infinite graphs.

Let denote the set of integers representable as a sum of two squares. Since can be described as the unsifted elements of a sieving process of positive dimension, it is to be expected that hasmany properties in common with the set of prime numbers. In this paper we exhibit “unexpected irregularities” in the distribution of sums of two squares in short intervals, a phenomenon analogous to that discovered by Maier, over a decade ago, in the distribution of prime numbers. To be precise, we show that there are infinitely many short intervals containing considerably more elements of than expected, and infinitely many intervals containing considerably fewer than expected.

IfGis a closed subgroup of a commutative hypergroupK, then the coset spaceK/Gcarries a quotient hypergroup structure. In this paper, we study related convolution structures onK/Gcoming fromdeformations of the quotient hypergroup structure by certain functions onKwhich we call partial characters with respect toG. They are usually not probability-preserving, but lead to so-called signed hypergroups onK/G. A first example is provided by the Laguerre convolution on [0, ∞[, which is interpreted as a signed quotient hypergroup convolution derived from the Heisenberg group. Moreover, signed hypergroups associated with the Gelfand pair (U(n, 1),U(n)) are discussed.

In this paper, we solve the isomorphism problem for metacirculant graphs of order pq that are not circulant. To solve this problem, we first extend Babai’s characterization of the CI-property to non-Cayley vertex-transitive hypergraphs. Additionally, we find a simple characterization of metacirculant Cayley graphs of order pq, and exactly determine the full isomorphism classes of circulant graphs of order pq.

The Modular Group M is PSL2(Z) the group of linear fractional transformations with integral entries and determinant one. M has been of great interest in many diverse fields of Mathematics, including Number Theory, Automorphic Function Theory and Group Theory. In this paper we give an effective algorithm to determine, for each integer d, a complete set of representatives for the trace classes in trace d. This algorithm depends on the combinatorial group theoretic structure of M. It has been subsequently extended by Sheingorn to the general Hecke groups. The number h(d) of trace classes in trace d is equal to the ideal class number of the field The algorithm mentioned above then provides a new straightforward computational procedure for determining h(d). Finally as an outgrowth of the algorithm we present a wide generalization of the Fermat Two-Square theorem. This last result can also be derived from classical work of Gauss.

In this paper we prove an inequality that involves the minimal crossing number and the braid index of links by estimating Murasugi and Przytycki’s index for a planar bipartite graph.

This paper is a continuation of [3] which initiated a systematic study of sufficient conditions for the weighted interpolation inequality of sum form, 1.1 to hold. Here ϕ, θ are non-negative functions of m, j, p, q, r, Ω is a bounded or unbounded domain in Rn, ∊ belongs to an interval Γ=(0, ∊0), u is in a certain Banach space E(Ω), and N, W, P are measurable real functions satisfying N≧ 0, W, P > 0, as well as additional conditions stated below. Finally the constant K does not depend on u although it may depend on the other parameters.

Recently, M. Hofmeister [4] counted all nonisomorphic double coverings of a graph by using its Ζ2 cohomology groups, and J. Kwak and J. Lee [5] did the same work for some finite-fold coverings. In this paper, we give an algebraic characterization of isomorphic graph bundles, from which we get a formula to count all nonisomorphic graph-bundles. Some applications to wheels are also discussed.

Let X be an infinite topological space, let 𝔫 be an infinite cardinal number with 𝔫 ≦ |X|. The basic problem in this paper is to find the number of closed sets in X of cardinality 𝔫. A complete answer to this question for the class of metrizable spaces has been given by A. H. Stone in [31], where he proves the following result. Let X be an infinite metrizable space of weight 𝔪, let 𝔫 ≦ |X|.

Introduction. In this paper, we study the following question: How long a cycle must there be in a 3-connected 3-regular graph on n vertices? For planar graphs this question goes back to Tait [6], who conjectured that any planar 3-connected 3-regular graph is hamiltonian. Tutte [7] disproved this conjecture by finding a counterexample on 46 vertices. Using Tutte's example, Grunbaum and Motzkin [3] constructed an infinite family of 3-connected 3-regular planar graphs such that the length of a longest cycle in each member of the family is at most nc, where c = 1 — 2~17 and n is the number of vertices. The exponent c was sub­ sequently reduced by Walther [8, 9] and by Grunbaum and Walther [4]. It is natural to ask what one can say when the planarity condition is dropped. For 2-connected 3-regular graphs, Bondy and Entringer [2] proved that the length of a longest cycle is at least 4 log 2?z — 4 log 2log2w — 20, and an example due to Lang and Walther [5] shows that this result is essentially best possible. Let f(n) denote the largest integer k such that every 3-connected 3-regular graph on n vertices contains a cycle of length at least k. For planar graphs, Barnette [1] proved that

The de Bruijn—van Aardenne Ehrenfest— Smith—Tutte theorem [1] is a theorem which connects the number of Eulerian dicircuits in a directed graph with the number of rooted spanning arborescences. In this paper we obtain a proof of this theorem by considering sequences over a finite alphabet, and we show that the theorem emerges from the generating function for a certain type of sequence. The generating function for the set of sequences is obtained as the solution of a linear system of equations in Section 2. The power series expansion for the solution of this system is obtained by means of the multivariate form of the Lagrange theorem for implicit functions, and is given in Section 3, together with a restatement of the theorem as a matrix identity.

In this paper we introduce a new class of mappings and apply it to study some local propertiecontinuas of .solutio A n is obtained to a problem raised in [14] by the first author (see 4.4 below). By a mapping we always mean a continuous function. 1. Definitions and preliminaries. Recall that, given three subsets A, B, C of a topological space, the set C is said to be connected between A and B provided A,B C CandCVW M N, wherA Ce M, B C iVanC\d N M = 0M = C\ N. The set C is connected provided C is connected betwee {%} and {y}n for each pair of points x,y CC. Let/: X —F>be a mapping of a topological space X onto a topological space Y. The mapping/ is said to be confluent (see [10, p. 223]), pseudo-confluent, or weakly confluent provided, for each connected closed non­empty setC C Y,th e following conditions are satisfied, respectively: (c) for each pair of pointx £ f~

In this paper we derive a generation procedure for the simple (3-valent) 3-polytopes with cyclically 5-connected graphs. (A graph is called cyclically n-connected if it cannot be broken into two components, each containing a cycle, by the removal of fewer than n edges.) We define three new types of face splitting and we show, in Theorems 16 and 17, that the simple 3-polytopes with cyclically 5-connected graphs are exactly the polytopes obtained from the dodecahedron by these face splittings.

In [4], a subgroup theorem for HNN groups was established. The theorem was proved by embedding the given HNN group in a free product with amalgamated subgroup and then applying the subgroup theorem of [3]. In this paper we obtain a sharper form of the subgroup theorem of [4] by applying the Reidemeister-Schreier method directly, using an appropriate Schreier system of coset representatives. Specifically, we prove (in Theorem 1) that if H is a subgroup of the HNN group1

Let G be a compact connected Lie group with H a connected subgroup of maximal rank. Suppose there exists a compact connected Lie subgroup K with H ⊂ K ⊂ G. Then there exists a smooth fiber bundle G/H → G/K with K/H as the fiber. (See for example [13].) This can be incorporated into a diagram involving the classifying spaces as follows: (1) Here π, ϕ, ϕ 1 and ϕ 2 denote fibrations. We also know that the homogeneous spaces and the Lie groups, which are homotopy equivalent to the loop spaces of their respective classifying spaces, are homotopy equivalent to connected finite complexes. Now suppose H is a maximal subgroup. Can there still exist spaces, which we will call BK, K/H, and G/K, and fibrations so that diagram (1) is still valid? This paper will show that in many cases either G/K or K/H will be homo topically trivial.

The central result is the existence and uniqueness for an arbitrary /-group G of two hulls, G and Gut which in the representable case coincide with the orthocompletion and strongly protectable hull of G. This is done by introducing two notions of extension, written ^ and ^ w, and proving that each G has a maximal extension G and a maximal ^ w extension Gœ. Two constructions of G and Gœ are-given: an /-permutation construc­ tion leads to descriptive structural information, and a construction by ''consistent maps" leads to a strong universal mapping property. The notion of a strongly projectable hull has a lengthy history. The concept of an orthocompletion, together with the first proof of its exist­ ence and uniqueness, is due to Bernau [4]. Conrad summarized and extended all these results in an important paper [10]. The chief novelty of the present work is that the ideas apply to non-represent able as well as to representable /-groups. When specialized to the representable case, the construction of Section 2 is related to the nice constructions of Bleier in [6] and [7]. The notation, which is multiplicativ e even for the representable case, is standard. G is understood to be an /-group whose complete Boolean algebra of polars will be designated & G or simply 8P. The symbols V, A, -L, 0^, and 1& refer respectively to supremum, infimum, complemen­ tation, least element and greatest element in £P. The symbols V and A also refer to supremum and infimum of elements of G\ the reader must be prepared to distinguish the two meanings from context. 1. Extensions. The crucial concept is the following. For /-groups G and H define G ^ H to mean that G is an /-subgroup of H in which the polars of G and H are in one-to-one correspondence by intersection, and such that V {(hr1)^ g E G\ = l& for all h £ H. Similarly, for K a fixed infinite cardinal number, define G ^ K H to mean that G is an /-subgroup of H in which the polars of G and H are in one-toone correspondence by intersection, and such that for ev^ry h £ H there

We begin by briefly summarizing the contents of this paper; details, and some definitions of terminology, appear in subsequent sections. All hypothesized topological spaces are assumed to be Hausdorff. The reader is referred to [13] for undefined notation and terminology.A perfect irreducible continuous surjection is called a covering map. Let X be a space, let f and g be two such functions with domain X, and let Rf denote the range of (i.e., the set f [Z]). Then f and g are said to be equivalent (denoted f≈ g) if there is a homeomorphism h : Rf —” Rg such that h of = g. We identify equivalent covering maps with domain X, and then denote by IP(X) the set of such covering maps.

Any term or symbol undefined in this paper is defined in [5]. For graphs F and G, G > F means G contains a subgraph isomorphic to F and E(G) denotes the edge set of G. If E ⊆ E(G), 〈E〉 is the subgraph of G whose edge set is E and whose vertex set is that subset of vertices of G which are incident with edges in E.

It is a classical conjecture of E. Artin that any integer a > 1 which is not a perfect square generates the co-prime residue classes (mod p) for infinitely many primes p. Let E be the set of a > 1, a not a perfect square, for which Artin's conjecture is false. Set E(x) = card(? E E: e 1, which is not a perfect square, is a primitive root (mod p) for infinitely many primes p. We shall abbreviate this conjecture of Artin as AC. Artin's conjecture was proved to be correct by Hooley (5) provided one assumes the generalized Riemann hypothesis for certain Dedekind zeta functions. The first unconditional result was obtained by Gupta and Ram Murty in (2), where it was shown that there is a finite set S, consisting of thirteen elements, such that for some a E S, AC is true for a. Subsequently, S was replaced by another finite set of seven elements in (3). In this paper, we consider the exceptional set for Artin's conjecture. More precisely, let

In this paper we are going to use a result of H. Harada and Y. Sai concerning composition of nonisomorphisms between indecomposable modules and the theory of almost split sequences introduced in the representation theory of Artin algebras by M. Auslander and I. Reiten to obtain the inductive step in the second Brauer-Thrall conjecture.Section 1 is devoted to giving the necessary background in the theory of almost split sequences.As an application we get the first Brauer-Thrall conjecture for Artin algebras. This conjecture says that there is no bound on the length of the finitely generated indecomposable modules over an Artin algebra of infinite type, i.e., an Artin algebra such that there are infinitely many nonisomorphic indecomposable finitely generated modules. This result was first proved by A. V. Roiter [8] and later in general for Artin rings by M. Auslander [2] using categorical methods.

In his paper (3) on finite H-planes, Kleinfeld has defined invariants s and t for an H-plane π as follows: let P and k be any point and line of π such that P is incident with k, then let s be the number of non-neighbour points to P on k and let t be the number of neighbour points to P on k. He has shown that s and t are independent of the choice of P and k, t divides s, π has s2 + st + t2 points (lines), π* has order s/t, and, if t ≠ 1, s ≤ t2. In the case s = t2, π is called uniform and has the property that each pair of neighbour lines (points) has exactly t points (lines) in common.

The results of the present paper can be interpreted (a) in terms of the theory of the representations of the symmetric group, or (b) in terms of the corresponding theory of the full linear group. In the latter connection they give a solution to the problem of the expression of an invariant matrix of an invariant matrix as a sum of invariant matrices, in the sense of Schur's Dissertation. D. E. Littlewood has pointed out the significance of this problem for invariant theory and has attacked it via Schur functions, i.e. characters of the irreducible representations of the full linear group. We shall confine our attention here to the interpretation (a).

Let D be an integrally closed domain with identity having quotient field L. If {Vα} is the set of valuation overrings of D and if A is an ideal of D, then à = ∪ αAVα is an ideal of D called the completion of A. If X is an indeterminate over D and f ∈ D[X], then we denote by Af the ideal of D generated by the coefficients of f. The Kronecker function ring DK of D is defined by DK = {f/g| f, g ∈ D[X], Ãf ⊆ Ag} (4, p. 558); and the domain D(X) is defined by D(X) = {f/g| f, g ∈ D[X], Ag = D} (5, p. 17). In this paper we wish to relate the ideal theory of D to that of DK and D(X) for the case in which D is a Prüfer domain, a Dedekind domain, or an almost Dedekind domain.

In this paper we prove a sharpening and generalization of the following Theorem of Khintchine (4):Let ψ1(q), …, ψnq) be n non-negative junctions of the positive integer q and assumeis monotonically decreasing. Then the set of inequalities1has an infinity of integer solutions q > 0 and p1, … , pn for almost all or no sets of numbers θ1, … , θ2, according as Σψ(q) diverges or converges.

Several concepts in discrete mathematics such as block designs, Latin squares, Hadamard matrices, tactical configurations, errorcorrecting codes, geometric configurations, finite groups, and graphs are by no means independent. Combinations of these notions may serve the development of any one of them, and sometimes reveal hidden interrelations. In the present paper a central role in this respect is played by the notion of strongly regular graph, the definition of which is recalled below.In § 2, a fibre-type construction for graphs is given which, applied to block designs withλ= 1 and Hadamard matrices, yields strongly regular graphs. The method, although still limited in its applications, may serve further developments. In § 3 we deal with block designs, first considered by Shrikhande[22],in which the number of points in the intersection of any pair of blocks attains only two values.

We define below a notion for modules which is dual to that of faithful, and a notion of “fully divisible” which generalizes that of injectivity. We show that the bicommutator of a cofaithful, fully divisible left R-module is isomorphic to a subring of Qmax(R), the complete ring of left quotients of R.In recent papers, Goldman [2] and Lambek [3] investigated rings of left quotients of a ring R constructed with respect to torsion radicals. It is known that every ring of left quotients of R is isomorphic to the bicommutator of an appropriate injective left R-module. We investigate below subrings of rings of quotients which are determined by radicals rather than torsion radicals, and show that any such ring can be constructed as the bicommutator of a fully divisible left R-module.

In this paper we consider finite graphs without loops and multiple edges. A graph is considered to be an ordered pair 〈G, *〉 where G is a finite set the elements of which are called the vertices of while * is a subset of [G]2 (where [G]2 is the set of all subsets of two elements of G). The elements of * are called the edges of . If {P, Q} ∊ *, we say that Q is adjacent to P. The degree of a vertex is the number of vertices adjacent to it. Let k be an integer. We say that is the complete k-graph if G has k elements and * = [G]2.

In this paper finite groups with the property M, that every maximal subgroup has prime or prime square index, are investigated. A short but ingenious argument was given by P. Hall which showed that such groups are solvable.B. Huppert showed that a finite group with the property M, that every maximal subgroup has prime index, is supersolvable, i.e. the chief factors are of prime order. We prove here, as a corollary of a more precise result, that if G has property M and is of odd order, then the chief factors of G are of prime or prime square order. The even-order case is different. For every odd prime p and positive integer m we shall construct a group of order 2apb with property M which has a chief factor of order larger than m.

The word matrix will, in this paper, always connote a matrix with non-negative elements, having in general m rows and n columns. In conformity with the definition in (4), two matrices will be said to have the same pattern if the entry in any row or column is zero or not according as the corresponding entry of the other is zero or not. The symbols ρi and σj will stand for the respective phrases “ith row-sum” and “jth column-sum” of the matrix under consideration. r1 … , rm; c1, … , cn is a set of positive numbers. It will be said to be consistent for the pattern of an m × n matrix, if there exists a matrix of that pattern for which ρi = ri and σj = cj for all i and j.

The α-width ∊A(α) of a (0, 1)-matrix A is the minimal number of columns that can be selected from A in such a way that all row sums of the resulting submatrix of A are at least α. This notion was introduced in (2) and further studied in (3). In these papers the major emphasis was on the minimal α-width sequence for the class of (0, 1)-matrices generated from an arbitrary A by interchanges

A ray in Euclidean n-dimensional space Rn is a set of the form {a + λb: λ≥ 0 } where a and b are fixed points in Rn and b≠0.The subject of this paper is a Helly type theorem for convex sets in Rn.If is a finite family of at least 2n convex sets in Rn and if theintersection of any 2n members of contains a ray then containsa ray.