Related papers: Non-overlapping Dyck matrices
A positroid is the matroid of a matrix whose maximal minors are all nonnegative. Given a permutation $w$ in $S_n$, the matroid of a generic $n \times n$ matrix whose non-zero entries in row $i$ lie in columns $w(i)$ through $n+i$ is an…
Let $M$ be a non-zero binary matrix with distinct rows where the rows are closed under certain logical operators. In this article, we investigate the existence of columns containing an equal or greater number of ones than zeros.…
Biclustering is a class of techniques that simultaneously clusters the rows and columns of a matrix to sort heterogeneous data into homogeneous blocks. Although many algorithms have been proposed to find biclusters, existing methods suffer…
We propose and investigate a bi-infinite matrix approach to the multiplication and composition of formal Laurent series. We generalize the concept of Riordan matrix to this bi-infinite context, obtaining matrices that are not necessarily…
A bound resembling Pascal's identity is presented for binary necklaces with fixed density using Lyndon words with fixed density. The result is generalized to k-ary necklaces and Lyndon words with fixed content. The bound arises in the study…
Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…
The set of finite binary matrices of a given size is known to carry a finite type A bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and…
An algorithm for obtaining all n\times n binary matrices having exactly 2 units in every row and every column is described in the paper. After analysing the work of the algorithm a formula for calculating the number of these matrices has…
Differentiable conjugacies link dynamical systems that share properties such as the stability multipliers of corresponding orbits. It provides a stronger classification than topological conjugacy, which only requires qualitative similarity.…
We describe combinatorial approaches to the question of whether families of real matrices admit pairs of nonreal eigenvalues passing through the imaginary axis. When the matrices arise as Jacobian matrices in the study of dynamical systems,…
We define an odometer in the Baire space. That is the non-compact space of one sided sequences of natural numbers. We go on to prove that it is topologically conjugated to the dyadic odometer restricted to an appropriate non-compact subset…
An analytical method for getting new complex Hadamard matrices by using mutually unbiased bases and a nonlinear doubling formula is provided. The method is illustrated with the n=4 case that leads to a rich family of eight-dimensional…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
A binary word is symmetric if it is a palindrome or an antipalindrome. We define a new measure of asymmetry of a binary word equal to the minimal number of letters of the word whose deleting from the word yields a symmetric word and obtain…
The classic Dyck triangle, the Catalan triangle, and the Catalan convolution matrix are plane projections of the multidimensional Dyck triangle. In the Dyck path, each node is uniquely determined by two of four interrelated parameters: (i)…
We introduce a family of order $N\in \mathbb{N}$ Lax matrices that is indexed by the natural number $k\in \{1,\ldots,N-1\}.$ For each value of $k$ they serve as strong Lax matrices of a hierarchy of integrable difference systems in edge…
Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are at most nine such pairs amongst all ten line arrangements…
This is a survey of the recent progress and open questions on the structure of the sets of 0-1 and non-negative integer matrices with prescribed row and column sums. We discuss cardinality estimates, the structure of a random matrix from…
The Catalan number $C_n$ enumerates parenthesizations of $x_0*\dotsb*x_n$ where $*$ is a binary operation. We introduce the modular Catalan number $C_{k,n}$ to count equivalence classes of parenthesizations of $x_0*\dotsb*x_n$ when $*$…