相关论文: Rank Selection and Depth Conditions for Balanced S…

The completion of matrices with missing values under the rank constraint is a non-convex optimization problem. A popular convex relaxation is based on minimization of the nuclear norm (sum of singular values) of the matrix. For this…

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

We investigate questions related to the set $\mathcal{SEP}_d$ consisting of the linear maps $\rho$ acting on $\mathbb{C}^d\otimes \mathbb{C}^d$ that can be written as a convex combination of rank one matrices of the form $xx^*\otimes yy^*$.…

Standard sweep algorithms require an order of discrete points in Euclidean space, and rely on the property that, at a given point, all points in the halfspace below come earlier in this order. We are motivated by the problem of…

We associate a real distribution to any complex Lie algebroid that we call distribution of real elements and a new invariant that we call real rank, given by the pointwise rank of this distribution. When the real rank is constant, we obtain…

This paper investigates defining equations for secant varieties of the variety of reducible polynomials, which geometrically encode the notions of strength and slice rank of homogeneous polynomials. We present three main results. First, we…

We derive simplified formulas for analyzing the stability of stochastic parametrically forced linear systems. This extends the results in [T. Blass and L.A. Romero, SIAM J. Control Optim. 51(2):1099--1127, 2013] where, assuming the…

We show that for proving the Stanley conjecture, it is sufficient to consider a very special class of monomial ideals. These ideals (or rather their lcm lattices) are in bijection with the simplicial spanning trees of skeletons of a…

Let $K$ be a finite simplicial complex. We prove that the normalized expected Betti numbers of a random subcomplex in its $d$-th barycentric subdivision $\text{Sd}^d (K)$ converge to universal limits as $d$ grows to $+ \infty$. In…

We show that the ample degree of a stable theory with trivial forking is preserved when we consider the corresponding theory of belles paires, if it exists. This result also applies to the theory of $H$-structures of a trivial theory of…

Let $E\supseteq F$ be a field extension and $M$ a graded Lie algebra of maximal class over $E$. We investigate the $F$-subalgebras $L$ of $M$, generated by elements of degree $1$. We provide conditions for $L$ being either ideally…

We give a description of a weakly continuous rank preserving map on a reflexive algebra on complex Hilbert space with commutative completely distributive subspace lattice. We show that the implementation of a rank preserving map can be…

Let $R$ be a ring, $\sigma:R\to R$ a ring endomorphism, and $\delta:R\to R$ a $\sigma$-derivation. We establish that the Ore extension $R[x;\sigma,\delta]$ satisfies the rank condition if and only if $R$ does. In addition, we prove…

In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. We show that a gradient descent algorithm with initial value obtained from a spectral method can,…

In subset selection we search for the best linear predictor that involves a small subset of variables. From a computational complexity viewpoint, subset selection is NP-hard and few classes are known to be solvable in polynomial time. Using…

We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…

M. Goresky and R. MacPherson intersection homology is also defined from the singular chain complex of a filtered space by H. King, with a key formula to make selections among singular simplexes. This formula needs a notion of dimension for…

In 1987, Stanley conjectured that if a centrally symmetric Cohen--Macaulay simplicial complex $\Delta$ of dimension $d-1$ satisfies $h_i(\Delta)=\binom{d}{i}$ for some $i\geq 1$, then $h_j(\Delta)=\binom{d}{j}$ for all $j\geq i$. Much more…

In this paper we generalize [3] and prove that the class of accessible and saddle-conservative cocycles (a wide class which includes cocycles evolving in GL(d,R), SL(d,R) and Sp(d,R) Lp-densely have a simple spectrum. We also generalize [3,…