相关论文: On a Class of Binary Matrices

The paper contains enumerative combinatorics for positive braids, square free braids, and simple braids, emphasizing connections with classical Fibonacci sequence. The simple subgraph of the Cayley graph of the braid group is analyzed in…

A $0,1$ matrix is said to be regular if all of its rows and columns have the same number of ones. We prove that for infinitely many integers $k$, there exists a square regular $0,1$ matrix with binary rank $k$, such that the Boolean rank of…

This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…

In order to study $\mathbf{M}(R,C)$, the set of binary matrices with fixed row and column sums $R$ and $C$, we consider sub-matrices of the form $\begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$ and $\begin{pmatrix} 0 & 1 \\ 1 & 0…

Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…

Two series of W-algebras with two generators are constructed from chiral vertex operators of a free field representation. If $c = 1 - 24k$, there exists a W(2,3k) algebra for k in $Z_{+}/2$ and a W(2,8k) algebra for k in $Z_{+}/4$. All…

In the first section of this paper we prove a theorem for the number of columns of a rectangular area that are identical to the given one. In the next section we apply this theorem to derive several combinatorial identities by counting…

We define a set of binary matrices where any two of them can not be placed one on the other in a way such that the corresponding entries coincide. The rows of the matrices are obtained by means of Dyck words. The cardinality of the set of…

We present a new proof of a theorem of Schur's determining the least common multiple of the orders of all finite groups of complex $n \times n$-matrices whose elements have traces in the field of rational numbers. The basic method of proof…

We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.

This monograph starts with an upper triangular matrix with integer entries and 1's on the diagonal. It develops from this a spectrum of structures, which appear in different contexts, in algebraic geometry, representation theory and the…

In this note, simple proofs of certain well-known results involving the positive square root of positive matrices are given.

In alternating sign matrices the first and last nonzero entry in each row and column is specified to be +1. Such matrices always exist. We investigate a generalization by specifying independently the sign of the first and last nonzero entry…

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

It is proven that a certain class of positive maps in the matrix algebra $M_n$ consists of optimal maps, i.e. maps from which one cannot subtract any completely positive map without loosing positivity. This class provides a generalization…

The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…

In this paper, we define the concepts of semi-canonical and canonical binary matrix. Strictly mathematical, we prove the correctness of these definitions. We describe and we implement an algorithm for finding all semi-canonical binary…

Let $G$ be one of the finite general linear, unitary, symplectic or orthogonal groups over finite fields of odd order. We find the cardinality of the fibers of the square map at a given generic element. Using this we find the number of real…

In this paper, a class of combinatorial identities is proved. A method is used which is based on the following rule: counting elements of a given set in two ways and making equal the obtained results. This rule is known as "counting in two…

The binary rank of a $0,1$ matrix is the smallest size of a partition of its ones into monochromatic combinatorial rectangles. A matrix $M$ is called $(k_1, \ldots, k_m ; n_1, \ldots, n_m)$ circulant block diagonal if it is a block matrix…