Related papers: Pattern Recognition on Oriented Matroids: Halfspac…
Iterative projection methods may become trapped at non-solutions when the constraint sets are nonconvex. Two kinds of parameters are available to help avoid this behavior and this study gives examples of both. The first kind of parameter,…
By a tensor we mean an element of a tensor product of vector spaces over a field. Up to a choice of bases in factors of tensor products, every tensor may be coordinatized, that is, represented as an array consisting of numbers. This note is…
Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…
In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…
Two bases of states are presented for modules of the graded parafermionic conformal field theory associated to the coset $\osp(1,2)_k/\uh(1)$. The first one is formulated in terms of the two fundamental (i.e., lowest dimensional)…
We study structural and topological properties of nested set complexes of matroids with arbitrary building sets, proving that these complexes are vertex decomposable and admit convex ear decompositions. These results unify and generalize…
This paper deals with the problem of robust matrix completion -- retrieving a low-rank matrix and a sparse matrix from the compressed counterpart of their superposition. Though seemingly not an unresolved issue, we point out that the…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
A matrix-compression algorithm is derived from a novel isogenic block decomposition for square matrices. The resulting compression and inflation operations possess strong functorial and spectral-permanence properties. The basic observation…
Adapting Mourre's commutator method to the dissipative setting, we prove a limiting absorption principle for a class of abstract dissipative operators. A consequence is the resolvent estimates for the high frequency Helmholtz equation when…
In this note, we propose a framework for proving computational lower bounds in norm approximation by leveraging a reverse detection--estimation gap. The starting point is a testing problem together with an estimator whose error is…
Motivated by an application in computational biology, we consider low-rank matrix factorization with $\{0,1\}$-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared…
A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
The ground spaces of a vector space of hermitian matrices, partially ordered by inclusion, form a lattice constructible from top to bottom in terms of intersections of maximal ground spaces. In this paper we characterize the lattice…
To locate all eigenvalues of a matrix more precisely, we exclude some sets which do not include any eigenvalue of the matrix from the well-known Brauer set to give two new Brauer-type eigenvalue inclusion sets. And it is also shown that the…
A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…
This paper concerns the characterisation of second order marginals for random sets in a discrete setting. Under the instance of unit covariances, this problem possesses a combinatorial symmetry, exploited jointly in the companion paper to…
There is a one-to-one correspondence between geometric lattices and the intersection lattices of arrangements of homotopy spheres. When the arrangements are essential and fully partitioned, Zaslavsky's enumeration of the cells of the…
In this lecture note, we discuss a fundamental concept, referred to as the {\it characteristic rank}, which suggests a general framework for characterizing the basic properties of various low-dimensional models used in signal processing.…