Related papers: Variable dimension non-overlapping matrices
We introduce geometric consideration into the theory of formal languages. We aim to shed light on our understanding of global patterns that occur on infinite strings. We utilise methods of geometric group theory. Our emphasis is on large…
The structural information in high-dimensional transposable data allows us to write the data recorded for each subject in a matrix such that both the rows and the columns correspond to variables of interest. One important problem is to test…
Both the supersymmetric $SO(32)$ and $E_8\times E_8$ heterotic strings in ten dimensions have known strong-coupling duals. However, it has not been known whether there also exist strong-coupling duals for the non-supersymmetric heterotic…
We reinterpret N=(2,1) strings as describing the continuum limit of matrix theory with all spatial dimensions compactified. Thus they may characterize the full set of degrees of freedom needed to formulate the theory.
A large class of new 4-D superstring vacua with non-trivial/singular geometries, spacetime supersymmetry and other background fields (axion, dilaton) are found. Killing symmetries are generic and are associated with non-trivial dilaton and…
A Gray code is a listing structure for a set of combinatorial objects such that some consistent (usually minimal) change property is maintained throughout adjacent elements in the list. While Gray codes for m-ary strings have been…
We give a precise definition of mutation of skew symmetrizable matrices over group rings and relate it to folding and mutation of quivers with symmetries. These matrices can have non-zero diagonal entries and we explain a mutation rule in…
In four decades of string theory research, only a handful of non-supersymmetric tachyon-free strings with only one neutral scalar at tree level were found. We construct new such non-supersymmetric tachyon-free string theories using…
A virtual string can be defined as an equivalence class of planar diagrams under certain kinds of diagrammatic moves. Virtual strings are related to virtual knots in that a simple operation on a virtual knot diagram produces a diagram for a…
We introduce a general framework to deterministically construct binary measurement matrices for compressed sensing. The proposed matrices are composed of (circulant) permutation submatrix blocks and zero submatrix blocks, thus making their…
This paper introduces a new family of reconstruction codes which is motivated by applications in DNA data storage and sequencing. In such applications, DNA strands are sequenced by reading some subset of their substrings. While previous…
High dimensional superposition models characterize observations using parameters which can be written as a sum of multiple component parameters, each with its own structure, e.g., sum of low rank and sparse matrices, sum of sparse and…
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum…
We study the origins of the five ten-dimensional ``matrix superstring'' theories, supplementing old results with new ones, and find that they all fit into a unified framework. In all cases the matrix definition of the string in the limit of…
Duality symmetries for strings moving in non-trivial spacetime backgrounds are analysed. It is shown that for backgrounds generated from WZW and coset CFT models such duality symmetries are exact to all orders in string perturbation theory.…
We investigate the rings of semi-invariants for tame string algebras A(n) of non-polynomial growth. We are interested in dimension vectors of band modules. We use geometric technique related to the description of coordinate rings on…
Recently sparse coding have been highly successful in image classification mainly due to its capability of incorporating the sparsity of image representation. In this paper, we propose an improved sparse coding model based on linear spatial…
In a metric space $M=(X,d)$, we say that $v$ is between $u$ and $w$ if $d(u,w)=d(u,v)+d(v,w)$. Taking all triples $\{u,v,w\}$ such that $v$ is between $u$ and $w$, one can associate a 3-uniform hypergraph with each finite metric space $M$.…
We propose an organizing principle for string theory moduli spaces in six dimensions with $\mathcal{N} = (1,1)$, based on a rank reduction map, into which all known constructions fit. In the case of cyclic orbifolds, which are the main…
We introduce new geometric and combinatorial criteria that preclude a neural code from being convex, and use them to tackle the classification problem for codes on six neurons. Along the way, we give the first example of a code that is…