Related papers: A Norm Compression Inequality for Block Partitione…

We establish several mathematical and computational properties of the nuclear norm for higher-order tensors. We show that like tensor rank, tensor nuclear norm is dependent on the choice of base field --- the value of the nuclear norm of a…

Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of…

We consider optimization problems containing nonconvex quadratic functions for which semidefinite programming (SDP) relaxations often yield strong bounds. We investigate linear inequalities that outer approximate the positive semidefinite…

We analyze the convergence rate of the randomized Newton-like method introduced by Qu et. al. (2016) for smooth and convex objectives, which uses random coordinate blocks of a Hessian-over-approximation matrix $\bM$ instead of the true…

Efficient measures to determine similarity of quantum states, such as the fidelity metric, have been widely studied. In this paper, we address the problem of defining a similarity measure for quantum operations that can be…

For a symmetric positive semidefinite linear system of equations $\mathcal{Q} {\bf x} = {\bf b}$, where ${\bf x} = (x_1,\ldots,x_s)$ is partitioned into $s$ blocks, with $s \geq 2$, we show that each cycle of the classical block symmetric…

We show for $A,B\subset\mathbb{R}^d$ of equal volume and $t\in (0,1/2]$ that if $|tA+(1-t)B|< (1+t^d)|A|$, then (up to translation) $|\text{co}(A\cup B)|/|A|$ is bounded. This establishes the sharp threshold for Figalli and Jerison's…

This paper communicates recent results in theory of complex symmetric operators and shows, through two non-trivial examples, their potential usefulness in the study of Schr\"odinger operators. In particular, we propose a formula for…

In this paper, we consider the problem of partitioning a small data sample of size $n$ drawn from a mixture of 2 sub-gaussian distributions in $\R^p$. We consider semidefinite programming relaxations of an integer quadratic program that is…

Let $A_1, ... A_n$ be operators acting on a separable complex Hilbert space such that $\sum_{i=1}^n A_i=0$. It is shown that if $A_1, ... A_n$ belong to a Schatten $p$-class, for some $p>0$, then 2^{p/2}n^{p-1} \sum_{i=1}^n \|A_i\|^p_p \leq…

For the problem of reconstructing a low-rank matrix from a few linear measurements, two classes of algorithms have been widely studied in the literature: convex approaches based on nuclear norm minimization, and non-convex approaches that…

Let $V$ be a smooth quasi-projective complex surface with compactification $(X,D)$ and set $\overline P_1(V):=h^0(X,K_X+D)$, $\overline q(V):=h^0(X,\Omega^1_X(\log D))$. We prove that $\overline P_1(V)\ge \overline q(V)-1$ if $V$ has…

We give a spectral algorithm for decomposing overcomplete order-4 tensors, so long as their components satisfy an algebraic non-degeneracy condition that holds for nearly all (all but an algebraic set of measure $0$) tensors over…

We use an injection method to prove a new class of partition inequalities involving certain $q$-products with two to four finitization parameters. Our new theorems are a substantial generalization of work by Andrews and of previous work by…

It is easily checkable if a given tensor is a B tensor, or a B$_0$ tensor or not. In this paper, we show that a symmetric B tensor can always be decomposed to the sum of a strictly diagonally dominated symmetric M tensor and several…

We estimate the size of the spectral gap at zero for some Hermitian block matrices. Included are quasi-definite matrices, quasi-semidefinite matrices (the closure of the set of the quasi-definite matrices) and some related block matrices…

We prove a new inequality which improves on the classical Hardy inequality in the sense that a nonlinear integral quantity with super-quadratic growth, which is computed with respect to an inverse square weight, is controlled by the energy.…

We construct a Convolution Quadrature (CQ) scheme for the quasilinear subdiffusion equation of order $\alpha$ and supply it with the fast and oblivious implementation. In particular, we find a condition for the CQ to be admissible and…

Normalized-cut graph partitioning aims to divide the set of nodes in a graph into $k$ disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters. In this paper, we consider a fair variant of the…

We describe a second-order accurate approach to sparsifying the off-diagonal blocks in the hierarchical approximate factorizations of sparse symmetric positive definite matrices. The norm of the error made by the new approach depends…