Related papers: Variable dimension non-overlapping matrices
The goal of co-clustering is to simultaneously identify a clustering of rows as well as columns of a two dimensional data matrix. A number of co-clustering techniques have been proposed including information-theoretic co-clustering and the…
Inspired by the intimate relationship between Voiculescu's noncommutative probability theory (of type A) and large-N matrix models in physics, we look for physical models related to noncommutative probability theory of type B. These turn…
There exists a proper holomorphic mapping between balls of different dimensions such that it does not extend continuously to the boundary. The aim of this paper is to show the same phenomenon occurs for pseudoconvex domains of different…
We present a novel way to encode compositional information in high-dimensional (HD) vectors. Inspired by chromosomal crossover, random HD vectors are recursively interwoven, with a fraction of one vector's components masked out and replaced…
We examine the structure of winding toroidal and open cylindrical membranes, especially in cases where they are stretched between boundaries. Non-zero winding or stretching means that there are linear terms in the mode expansion of the…
We propose a nonperturbative definition of heterotic string theory on arbitrary multidimensional tori.
We introduce a novel framework consisting of a class of algebraic structures that generalize one-dimensional monoidal systems into higher dimensions by defining per-axis composition operators subject to non-commutativity and a global…
Given a set of points in the plane, we are interested in matching them with straight line segments. We focus on perfect (all points are matched) non-crossing (no two edges intersect) matchings. Apart from the well known MinMax variation,…
The nonperturbative aspects of string theory are explored for non-critical string in two distinct formulations: loop equations and matrix models. The effects corresponding to D-brane in these formulations are especially investigated in…
We provide combinatorial and numerical criteria to characterize affine type A bow diagrams giving rise to a non-empty bow variety. The key idea is to prove that such diagrams correspond to supersymmetric brane systems in type IIB string…
We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows, pairs of columns and pairs of a row and a column. Near…
We study how the dimensional regularization works in the light-cone gauge string field theory. We show that it is not necessary to add a contact term to the string field theory action as a counter term in this regularization at least at the…
We address the problem of converting large-scale high-dimensional image data into binary codes so that approximate nearest-neighbor search over them can be efficiently performed. Different from most of the existing unsupervised approaches…
The purpose of this paper is twofold. First, we define the new spaces and investigate some topological and structural properties. Also, we compute dual spaces of new spaces which are help us in the characterization of matrix mappings.…
We place ourselves in the setting of high-dimensional statistical inference where the number of variables $p$ in a dataset of interest is of the same order of magnitude as the number of observations $n$. We consider the spectrum of certain…
Binary jumbled pattern matching asks to preprocess a binary string $S$ in order to answer queries $(i,j)$ which ask for a substring of $S$ that is of length $i$ and has exactly $j$ 1-bits. This problem naturally generalizes to…
We study the non-overlapping indexing problem: Given a text T, preprocess it so that you can answer queries of the form: given a pattern P, report the maximal set of non-overlapping occurrences of P in T. A generalization of this problem is…
A presentation of numerical range for rectangular matrices is undertaken in this paper, introducing two different definitions and elaborating basic properties. Then we are extended to the treatment of rank-k numerical range.
Superregular matrices are a class of lower triangular Toeplitz matrices that arise in the context of constructing convolutional codes having a maximum distance profile. These matrices are characterized by the property that no submatrix has…
We develop a systematic framework for understanding symmetries in topological phases in 2+1 dimensions using the string-net model, encompassing both gauge symmetries that preserve anyon species and global symmetries permuting anyon species,…