Related papers: Matrix Theory for Minimal Trellises

Motivated by Stanley's results in \cite{St02}, we generalize the rank of a partition $\lambda$ to the rank of a shifted partition $S(\lambda)$. We show that the number of bars required in a minimal bar tableau of $S(\lambda)$ is max$(o, e +…

We reconstruct a matrix product state (MPS) in reduced spaces using density matrix. This scheme applies to a MPS built on a blocked quantum lattice. Each block contains $N$ physical sites that have a local space of rank $R$. The simulation…

Anyone who has ever worked with a variety~$\boldsymbol{\mathscr{A}}$ of algebras with a reduct in the variety of bounded distributive lattices will know a restricted Priestley duality when they meet one---but until now there has been no…

We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a function to compute its matrix-vector product. The methods apply to…

Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…

Dualities are often supposed to be foundational, but they may come into conflict with background independence, because a hidden fixed structures is needed to define the duality transformation. This conflict can be eliminated by extending a…

We construct 1-parameter families of non-periodic embedded minimal surfaces of infinite genus in $T \times \mathbb{R}$, where $T$ denotes a flat 2-tori. Each of our families converges to a foliation of $T \times \mathbb{R}$ by $T$. These…

This is the first in a series of papers constructing geometric models of twisted differential K-theory. In this paper we construct a model of even twisted differential K-theory when the underlying topological twist represents a torsion…

Motivated by a concept studied in [1], we consider a property of matrices over finite fields that generalizes triangular totally nonsingular matrices to block matrices. We show that (1) matrices with this property suffice to construct good…

Let $C$ be an algebraic curve of genus $g$ and $L$ a line bundle over $C$. Let $\mathcal{MS}_C(n,L)$ and $\mathcal{MO}_C(n,L)$ be the moduli spaces of $L$-valued symplectic and orthogonal bundles respectively, over $C$ of rank $n$. We…

We consider some distinguished classes of elements of a multiplicative lattice endowed with coarse lower topologies, and call them lower spaces. The primary objective of this paper is to study the topological properties of these lower…

We study compactifications of Matrix theory on twisted tori and non-commutative versions of them. As a first step, we review the construction of multidimensional twisted tori realized as nilmanifolds based on certain nilpotent Lie algebras.…

We present explicit algorithms for computing structured matrix-vector products that are optimal in the sense of Strassen, i.e., using a provably minimum number of multiplications. These structures include Toeplitz/Hankel/circulant,…

Given a tiling $\mathcal{T}$ of the plane by straight edge polygons, which is invariant by two independent translations, we construct a family of embedded triply periodic minimal surfaces which desingularizes $\mathcal{T}\times\mathbb{R}$.…

We study monoidal categories that enjoy a certain weakening of the rigidity property, namely, the existence of a dualizing object in the sense of Grothendieck and Verdier. We call them Grothendieck-Verdier categories. Notable examples…

Convergence is a crucial issue in iterative algorithms. Damping is commonly employed to ensure the convergence of iterative algorithms. The conventional ways of damping are scalar-wise, and either heuristic or empirical. Recently, an…

We propose an infinitesimal counterpart to the notion of braided category. The corresponding infinitesimal braidings are natural transformations which are compatible with an underlying braided monoidal structure in the sense that they…

Matrix factorization is an important representation learning algorithm, e.g., recommender systems, where a large matrix can be factorized into the product of two low dimensional matrices termed as latent representations. This paper…

We provide a combinatorial study of split matroids, a class that was motivated by the study of matroid polytopes from a tropical geometry point of view. A nice feature of split matroids is that they generalize paving matroids, while being…

This paper proposes a set of piecewise Toeplitz matrices as the linear mapping/sensing operator $\mathcal{A}: \mathbf{R}^{n_1 \times n_2} \rightarrow \mathbf{R}^M$ for recovering low rank matrices from few measurements. We prove that such…