Related papers: Small Chvatal rank
Representations of nonnegative polynomials as sums of squares are central to real algebraic geometry and the subject of active research. The sum-of-squares representations of a given polynomial are parametrized by the convex body of…
In the first part of this paper, we survey results that are associated with three types of Laplacian matrices:difference, normalized, and signless. We derive eigenvalue and eigenvector formulaes for paths and cycles using circulant matrices…
In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…
We present a fully pseudo-spectral scheme to solve axisymmetric hyperbolic equations of second order. With the Chebyshev polynomials as basis functions, the numerical grid is based on the Lobbato (for two spatial directions) and Radau (for…
Simplicial arrangements are classical objects in discrete geometry. Their classification remains an open problem but there is a list conjectured to be complete at least for rank three. A further important class in the theory of hyperplane…
The present work investigates regular, semiregular, and chiral polytopes of any rank $d\geq 3$, whose automorphism groups are 2-groups. There is a large variety of rather small finite regular or alternating semiregular polytopes with…
In this paper, we prove that any closed minimal hypersurface $M^4$ in the $5$-dimensional unit sphere $\mathbb{S}^5$ with constant scalar curvature and constant $3$-th mean curvature must be isoparametric. To be precise, $M^4$ is either an…
The work reported in this article presents a high-order, stable, and efficient Gegenbauer pseudospectral method to solve numerically a wide variety of mathematical models. The proposed numerical scheme exploits the stability and the…
We prove that low-rank matrices can be recovered efficiently from a small number of measurements that are sampled from orbits of a certain matrix group. As a special case, our theory makes statements about the phase retrieval problem. Here,…
Block Gram-Schmidt algorithms serve as essential kernels in many scientific computing applications, but for many commonly used variants, a rigorous treatment of their stability properties remains open. This work provides a comprehensive…
In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial…
Suppose that the set ${\mathcal{T}}= \{T_1, T_2,...,T_q \} $ of real $n\times n$ matrices has joint spectral radius less than $1$. Then for any digit set $ D= \{d_1, \cdots, d_q\} \subset {\Bbb R}^n$, there exists a unique nonempty compact…
Given an action of a monoid $T$ on a ring $A$ by ring endomorphisms, and an Ore subset $S$ of $T$, a general construction of a fractional skew monoid ring $S^{\rm op} * A * T$ is given, extending the usual constructions of skew group rings…
Let F be the fundamental group of S, where S is a compact, connected, oriented surface with negative Euler characteristic and nonempty boundary. (1) The projective class of the chain \partial S in B_1(F) intersects the interior of a…
A "spectral convex set" is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal-Sottile-Sturmfels (2011). We study this class…
We investigate the Sherali-Adams lift & project hierarchy applied to a graph isomorphism polytope whose integer points encode the isomorphisms between two graphs. In particular, the Sherali-Adams relaxations characterize a new vertex…
Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of finding a nearest…
This paper addresses the real structured controllability, stabilizability, and stability radii (RSCR, RSSZR, and RSSR, respectively) of linear systems, which involve determining the distance (in terms of matrix norms) between a (possibly…
Random order online contention resolution schemes (ROCRS) are structured online rounding algorithms with numerous applications and links to other well-known online selection problems, like the matroid secretary conjecture. We are interested…
Little groups are enumerated for the irreps and their components in any basis of O(3) and SO(3) up to rank 9, and for all irreps of C$_{\infty}$, C$_{\infty h}$, C$_{\infty v}$, D$_{\infty}$ and D$_{\infty h}$. The results are obtained by a…