Nous étudions le nombre de cöıncidences des chiffres uns dans chaque paire de lignes différentes d’une matrice binaire et inversible dont toutes les lignes contiennent la même quantité d’unités. Nous présentons des bornes pour ce nombre, et nous démontrons que ces bornes peuvent être atteintes. Que la borne inférieure peut être réalisée est démontré par moyen des exemples. Quant à la borne supé...

As one can see, without several examples worked out with a pencil and paper, this formal definition is not very insightful. To understand where restricted patterns really originated from, we draw on visual imagery and replace “one-dimensional” permutations by “twodimensional” objects, matrices. In doing so, we shall violate the customary labeling of the top row as the “first” row of a matrix. I...

This paper is concerned with general analysis on the rank and row-redundancy of an array of circulants whose null space defines a QC-LDPC code. Based on the Fourier transform and the properties of conjugacy classes and Hadamard products of matrices, we derive tight upper bounds on rank and row-redundancy for general array of circulants, which make it possible to consider row-redundancy in const...

Specially structured Linear Complementarity Problems (LCP's) and their solution by the criss{ cross method are examined in this paper. The criss{cross method is known to be nite for LCP's with positive semide nite bisymmetric matrices and with P{matrices. It is also a simple nite algorithm for oriented matroid programming problems. Recently Cottle, Pang and Venkateswaran identi ed the class of ...

The class of H-matrices, also known as Generalized Diagonally Dominant (GDD) matrices, plays an important role in many areas applied linear algebra, well a wide range applications, such dynamical analysis complex networks that arise ecology, epidemiology, infectology, neurology, engineering, economy, opinion dynamics, and other fields. To conclude the particular system is (locally) stable, it s...