Related papers: Variable dimension non-overlapping matrices
The manuscript studies configurations of non-overlapping non-bonding dominoes on finite rectangular boards of unit squares characterized by row and column number. The non-bonding dominoes are defined here by the requirement that any domino…
The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in…
Motivated by DNA storage in living organisms, and by known biological mutation processes, we study the reverse-complement string-duplication system. We fully classify the conditions under which the system has full expressiveness, for all…
Data sets in the form of binary matrices are ubiquitous across scientific domains, and researchers are often interested in identifying and quantifying noteworthy structure. One approach is to compare the observed data to that which might be…
Overlap coincidence is an equivalent criterion to pure discrete spectrum of the dynamics of self affine tilings. In the case of one dimension, strong coincidence on m letter irreducible substitution has been introduced in Dekking (1978) and…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
We discuss the generalization of recently discovered BPS configurations, corresponding to the planar string networks, to non-planar ones by considering the U-duality symmetry of type II string theory in various dimensions. As an explicit…
Neural codes are collections of binary strings motivated by patterns of neural activity. In this paper, we study algorithmic and enumerative aspects of convex neural codes in dimension 1 (i.e. on a line or a circle). We use the theory of…
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of…
Some mutually quasi-unbiased weighing matrices are constructed from binary codes satisfying certain conditions. Motivated by this, in this note, we study binary codes satisfying the conditions. The weight distributions of binary codes…
We describe some recent progress in understanding and formulating string theory which is based on extensive studies of strings in lower (D=2) dimension. At the center is a large $W_{\infty}$ symmetry that appears most simply in the matrix…
In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…
We show that the set of binary words containing overlaps is not unambiguously context-free and that the set of ternary words containing overlaps is not context-free. We also show that the set of binary words that are not subwords of the…
Given a matrix over a skew field fixing the column (1,...,1)^t, we give formulas for a row vector fixed by this matrix. The same techniques are applied to give noncommutative extensions of probabilistic properties of codes.
Free bosonic strings in noncommutative spacetime are investigated. The string spectrum is obtained in terms of light-cone quantization. We construct two different models. In the first model the critical dimension is still required to be 26…
We present a new class of matrix models which are manifestly symmetric under the T-duality transformation of the target space. The models may serve as a nonperturbative regularization for the T-duality symmetry in continuum string theory.…
We develop the theory of frames and Parseval frames for finite-dimensional vector spaces over the binary numbers. This includes characterizations which are similar to frames and Parseval frames for real or complex Hilbert spaces, and the…
In this paper, we study binary and ternary matrices that are used for CDMA applications that are injective on binary or ternary user vectors. In other words, in the absence of additive noise, the interference of overloaded CDMA can be…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…
A random matrix model definition of a family of ${\cal N}{=}1$ supersymmetric extensions of the Virasoro minimal string of Collier, Eberhardt, M\"{u}hlmann, and Rodriguez is presented. An analysis of the defining string equations shows that…