The notion of coloring number of a graph was introduced by P. Erdo s and A. Hajnal in [2] in order to investigate the chromatic number of infinite graphs. For a graph G its coloring number, Col(G) is defined to be the least cardinal } for which there is a well ordering of the vertex set in which eve
Two Remarks on Indecomposable Number Sets
β Scribed by T. G. McLaughlin
- Publisher
- John Wiley and Sons
- Year
- 1966
- Tongue
- English
- Weight
- 272 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For every natural number m, there exists a noncommutative valuation ring R with a completely prime ideal P so that there are exactly m nonisomorphic indecomposable injective right R-modules with P as associated prime ideal.
A conjecture of Kac states that the constant coefficient of the polynomial counting the number of absolutely indecomposable representations of a quiver over a finite field is equal to the multiplicity of the corresponding root in the associated KacαMoody Lie algebra. In this paper we give a combinat
DEDICATED TO THE MEMORY OF NORMAN LEVINSON 1. The definition of W(P), g iven by Stein, uses n-dimensional analogs of conjugate functions. This generalization of the classical Hardy space is of course only one of several possible ones. It has however proved to be of intrinsic importance through its r