-rozměrné konfigurace. II.
Radonpartitionen und konvexe Polyeder.
Random matrices, magic squares and matching polynomials.
Rank three geometries associated with .
Ranks of Incidence Matrices of Steiner Triple Systems.
Ranks of permutative matrices
A new type of matrix, termed permutative, is defined and motivated herein. The focus is upon identifying circumstances under which square permutative matrices are rank deficient. Two distinct ways, along with variants upon them are given. These are a special kind of grouping of rows and a type of partition in which the blocks are again permutative. Other, results are given, along with some questions and conjectures.
Rank-three matroids are Rayleigh.
Rational congruence for uniform multiplicative designs.
Rational model of the subspace complement on atomic complexes.
Real time asymptotic packing.
Recouvrements d'un rectangle de largeur 3 à l'aide de triminos
On établit une récurrence du 6-ième ordre pour le nombre de recouvrements d'un rectangle de largeur 3 et de longueur n à l'aide de «triminos». Des problèmes analogues peuvent se poser à propos de découpages électoraux.
Rectangular and trapezoidal arrangements.
Recursive constructions for skew resolutions in affine geometries.
Recursive Methods for Construction of Balanced N-ary Block Designs
2000 Mathematics Subject Classification: Primary 05B05; secondary 62K10.This paper presents a recursive method for the construction of balanced n-ary block designs. This method is based on the analogy between a balanced incomplete binary block design (B.I .E .B) and the set of all distinct linear sub-varieties of the same dimension extracted from a finite projective geometry. If V1 is the first B.I .E .B resulting from this projective geometry, then by regarding any block of V1 as a projective geometry,...
Reducing a set by subtracting squares.
Regular conditional linear spaces with two consecutive line degrees.
Regular elements of the semigroup of all binary relations.
Regular linear spaces.
Regularly Derived Planes.
Regulated buildups of 3-configurations
We deal with two types of buildups of 3-configurations: a generating buildup over a given edge set and a regulated one (according to maximal relative degrees of vertices over a penetrable set of vertices). Then we take account to minimal generating edge sets, i.e., to edge bases. We also deduce the fundamental relation between the numbers of all vertices, of all edges from edge basis and of all terminal elements. The topic is parallel to a certain part of Belousov' “Configurations in algebraic...