Related papers: Matrix Theory for Minimal Trellises
We apply symmetric function theory to study random processes formed by singular values of products of truncations of Haar distributed symplectic and orthogonal matrices. These product matrix processes are degenerations of Macdonald…
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
An ordered structure is called o-minimalistic if it has all the first-order features of an o-minimal structure. We propose a theory, DCTC (Definable Completeness/Type Completeness), that describes many properties of o-minimalistic…
In a recent paper, an algorithm has been presented for determining implications between a particular kind of category theoretic property represented by matrices -- the so called `matrix properties'. In this paper we extend this algorithm to…
Reasoning with minimal models has always been at the core of many knowledge representation techniques, but we still have only a limited understanding of this problem in Description Logics (DLs). Minimization of some selected predicates,…
Motivated by applications to perverse sheaves, we study combinatorics of two cell decompositions of the symmetric product of the complex line, refining the complex stratification by multiplicities. Contingency matrices, appearing in…
In this paper, we propose three approaches for the estimation of the Tucker decomposition of multi-way arrays (tensors) from partial observations. All approaches are formulated as convex minimization problems. Therefore, the minimum is…
Characters of $E_8\otimes E_8$ and SO(32) heterotic strings involving the full internal symmetry Cartan subalgebra generators are defined after circle compactification so that they are T dual. The novel point, as compared with an earlier…
We define and study exact, efficient representations of realization spaces Euclidean Distance Constraint Systems (EDCS), which includes Linkages and Frameworks. Each representation corresponds to a choice of Cayley parameters and yields a…
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with applications in collaborative filtering, computer vision and…
The problem of finding the minimum rank of a matrix with a given zero-nonzero pattern has been generalized to a class of matroids associated to the pattern. The fundamental lower bound known as the triangle number still holds in this…
This paper presents a new method for estimating high dimensional covariance matrices. The method, permuted rank-penalized least-squares (PRLS), is based on a Kronecker product series expansion of the true covariance matrix. Assuming an…
Natural slender structures, such as plant leaves, petals, and tendrils, often exhibit complex three-dimensional (3D) morphologies-including twisting, helical coiling, and saddle-bending-driven by differential growth. The resulting internal…
We give a presentation of the cohomology ring of spatial polygon spaces $M(r)$ with fixed side lengths $r \in \mathbb R^n_+$. These spaces can be described as the symplectic reduction of the Grassmaniann of 2-planes in $\mathbb C^n$ by the…
We study the class structure of finite-alphabet Markov chains with arbitrary memory length. To capture the structural constraints induced by prohibited transitions, we introduce the skeleton of a higher-order transition kernel, defined as a…
A matrix $A$ is said to have $X$-simple image eigenspace if any eigenvector $x$ belonging to the interval $X=\{x\colon \underline{x}\leq x\leq\overline{x}\}$ is the unique solution of the system $A\otimes y=x$ in $X$. The main result of…
In the framework of tensor spaces, we consider orthogonalization kernels to generate an orthogonal basis of a tensor subspace from a set of linearly independent tensors. In particular, we experimentally study the loss of orthogonality of…
We prove that the permutations of $\{1,\dots, n\}$ having an increasing (resp., decreasing) subsequence of length $n-r$ index a subset of the set of all $r$th Kronecker powers of $n \times n$ permutation matrices which is a basis for the…
In the first part we recall two famous sources of solutions to the Yang-Baxter equation -- R-matrices and Yetter-Drinfel$'$d (=YD) modules -- and an interpretation of the former as a particular case of the latter. We show that this result…
This survey paper introduces to a technique called Torsion Subcomplex Reduction (TSR) for computing torsion in the cohomology of discrete groups acting on suitable cell complexes. TSR enables one to skip machine computations on cell…