Canadian Journal of Mathematics
SCOPUS (1994,1996-2025)SCIE-ISI
0008-414X
1496-4279
Canada
Cơ quản chủ quản: CAMBRIDGE UNIV PRESS , Canadian Mathematical Society
Lĩnh vực:
Mathematics (miscellaneous)
Các bài báo tiêu biểu
Maximal Flow Through a Network
Tập 8 - Trang 399-404 - 1956
Introduction. The problem discussed in this paper was formulated by T. Harris as
follows:“Consider a rail network connecting two cities by way of a number of
intermediate cities, where each link of the network has a number assigned to it
representing its capacity. Assuming a steady state condition, find a maximal
flow from one given city to the other.”
Paths, Trees, and Flowers
Tập 17 - Trang 449-467 - 1965
A graph G for purposes here is a finite set of elements called vertices and a
finite set of elements called edges such that each edge meets exactly two
vertices, called the end-points of the edge. An edge is said to join its
end-points.A matching in G is a subset of its edges such that no two meet the
same vertex. We describe an efficient algorithm for finding in a given graph a
matching of maximu...
A Characterization of Comparability Graphs and of Interval Graphs
Tập 16 - Trang 539-548 - 1964
Let < be a non-reflexive partial ordering defined on a set P. Let G(P, <) be the
undirected graph whose vertices are the elements of P, and whose edges (a, b)
connect vertices for which either a < b or b < a. A graph G with vertices P for
which there exists a partial ordering < such that G = G(P, <) is called a
comparability graph.In §2 we state and prove a characterization of those graphs,
finite...
The Relaxation Method for Linear Inequalities
Tập 6 - Trang 382-392 - 1954
In various numerical problems one is confronted with the task of solving a
system of linear inequalities:(1.1) (i = 1, … ,m)assuming, of course, that the
above system is consistent. Sometimes one has, in addition, to minimize a given
linear form l(x). Thus, in linear programming one obtains a problem of the
latter type.
The Relaxation Method for Linear Inequalities
Tập 6 - Trang 393-404 - 1954
Let A be a closed set of points in the n-dimensional euclidean space En. If p
and p1 are points of En such that1.1then p1 is said to be point-wise closer than
p to the set A. If p is such that there is no point p1 which is point-wise
closer than p to A, then p is called a closest point to the set A.
The Representation of a Graph by Set Intersections
Tập 18 - Trang 106-112 - 1966
Geometrically, a graph is a collection of points (or vertices) together with a
set of edges (or curves) each of which joins two distinct vertices of the graph,
and no two of which have points in common except possibly end points. Two given
vertices of the graph may be joined by no edge or one edge, but may not be
joined by more than one edge. From an abstract point of view, a graph G is a
collecti...
Canonical Extensions of Harish-Chandra Modules to Representations of G
Tập 41 Số 3 - Trang 385-438 - 1989
Let G be the group of R-rational points on a reductive, Zariskiconnected,
algebraic group defined over R, let K be a maximal compact subgroup, and let g
be the corresponding complexified Lie algebra of G. It is a curious fault of the
current representation theory of G that for technical reasons one very rarely
works with representations of G itself, but rather with a certain category of
simultaneo...
Comma-Free Codes
Tập 10 - Trang 202-209 - 1958
Let n be a fixed positive integer, and consider an alphabet consisting of the
numbers 1, 2, … , n. With this alphabet form all possible k-letter words (a 1 a
2 … a k ), where k is also fixed. There are evidently n k such words in all....
Some Results on v-Multiplication Rings
Tập 19 - Trang 710-722 - 1967
A family Ω of valuations of the field K is said to be of finite character if
only a finite number of valuations are non-zero at any non-zero element of K. If
w ∈ Ω has ring and maximal ideal , then A = ∩w∈Ω is said to be defined by Ω and
∩ A is a prime ideal called the centre of w on A and denoted by Z(w). If =
Az(w), then w is said to be an essential valuation for A. A domain defined by a
family ...
On the Decomposition of a Representation of SOn When Restricted to SOn-1
Tập 44 Số 5 - Trang 974-1002 - 1992
Let k be a local field, with char(k) ≠ 2. A quadratic space V over k is a finite
dimensional vector space together with a non-degenerate quadratic form Q: V →
k.The special orthogonal group SO(V) consists of all linear maps T: V → V which
satisfy:Q(Tv) = Q(v) for all ν and det T = 1.