Related papers: Variable dimension non-overlapping matrices
We identify a new and important global (or non-binary) constraint. This constraint ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This constraint is useful for a number of different…
We report on progress towards evaluation of stringy non-perturbative effects, using a two dimensional effective field theory for matrix models. We briefly discuss the relevance of such effects to models of dynamical supersymmetry breaking.
While machine-learning models are flourishing and transforming many aspects of everyday life, the inability of humans to understand complex models poses difficulties for these models to be fully trusted and embraced. Thus, interpretability…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
Cross-bifix-free sets are sets of words such that no prefix of any word is a sufix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free q-ary words of fixed length. It enables us to…
The central theme of this thesis is noncommutativity in string theory. We explore in detail how noncommutative structures can emerge in case of the interacting bosonic string and even in the fermionic sector of superstring theory. We have…
In this talk, based on work done in collaboration with G. Landi and R.J Szabo, I will review how string theory can be considered as a noncommutative geometry based on an algebra of vertex operators. The spectral triple of strings is…
Two examples of spectral triples with non-integer dimension spectrum are considered. These triples involve commutative C*-algebras. The first example has complex dimension spectrum and trivial differential algebra. The other is a parameter…
I suggest the possibility of a new string in ten dimensions. Evidence for this string is presented both from orientifold physics and from K-theory, along with a mystery concerning the M-theory description. Motivated by this possibility,…
We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…
The commuting variety of matrices over a given field is a well-studied object in linear algebra and algebraic geometry. As a set, it consists of all pairs of square matrices with entries in that field that commute with one another. In this…
In this paper, we introduce code distances, a new family of invariants for linear codes. We establish some properties and prove bounds on the code distances, and show that they are not invariants of the matroid (for a linear block code) or…
We introduce strings in metric spaces and define string complexes of metric spaces. We describe the class of 2-dimensional topological spaces which arise in this way from finite metric spaces.
Superstring theories in the critical dimension D=10 are connected to one another by a well-explored web of dualities. In this paper we use closed-string tachyon condensation to connect the supersymmetric moduli space of the critical…
A new mathematical structure, called the cross-dimensional mathematics (CDM), is proposed. The CDM considered in this paper consists of three parts: hyper algebra, hyper geometry, and hyper Lie group/Lie algebra. Hyper algebra proposes some…
We study words that barely avoid repetitions, for several senses of "barely". A squarefree (respectively, overlap-free, cubefree) word is irreducible if removing any one of its interior letters creates a square (respectively, overlap,…
One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…
This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…