Related papers: Matrix rigidity and the Croot-Lev-Pach lemma
The Chow ring of a matroid (or more generally, atomic latice) is an invariant whose importance was demonstrated by Adiprasito, Huh and Katz, who used it to resolve the long-standing Heron-Rota-Welsh conjecture. Here, we make a detailed…
We give a negative answer to the rigidity conjecture of He and Schramm by constructing a rigid circle domain $\Omega$ on the Riemann sphere with conformally non-removable boundary. Here rigidity means that every conformal map from $\Omega$…
Consider the Quadratic Assignment Problem (QAP): given two matrices A and D, minimize {trace AXDX^T: X is a permutation matrix}. New lower bounds were obtained recently (Mittelmann and peng [8]) for the QAP where D is either the Manhattan…
In this paper, we consider the problem of computing the nearest stable matrix to an unstable one. We propose new algorithms to solve this problem based on a reformulation using linear dissipative Hamiltonian systems: we show that a matrix…
Matrix configurations define noncommutative spaces endowed with extra structure including a generalized Laplace operator, and hence a metric structure. Made dynamical via matrix models, they describe rich physical systems including…
The measure contraction property, $\mathsf{MCP}$ for short, is a weak Ricci curvature lower bound conditions for metric measure spaces. The goal of this paper is to understand which structural properties such assumption (or even weaker…
We discuss various aspects of most general multisupport solutions to matrix models in the presence of hard walls, i.e., in the case where the eigenvalue support is confined to subdomains of the real axis. The structure of the solution at…
We establish the $\#P$-hardness of computing a broad class of immanants, even when restricted to specific categories of matrices. Concretely, we prove that computing $\lambda$-immanants of $0$-$1$ matrices is $\#P$-hard whenever the…
We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked…
We investigate extremal metrics at which various types of rigidity theorems involving scalar curvatures hold. The rigidity we discuss here is related to the rigidity theorems presented by Mario Listing in his previous preprint. More…
Let $\Gamma<\mathrm{PSL}_2(\mathbb{C})\simeq \mathrm{Isom}^+(\mathbb{H}^3)$ be a finitely generated non-Fuchsian Kleinian group whose ordinary set $\Omega=\mathbb{S}^2-\Lambda$ has at least two components. Let $\rho : \Gamma \to…
A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous motions of the vertices arise from…
The Hamiltonian constraint remains the major unsolved problem in Loop Quantum Gravity (LQG). Seven years ago a mathematically consistent candidate Hamiltonian constraint has been proposed but there are still several unsettled questions…
In this note we prove a lower bound for the rank of 2-dimensional generic rigidity matroid for regular graphs of degree four and five. Also, we give examples to show the order of the bound we give is sharp.
Valiant's famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related…
We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…
A theorem of Laman gives a combinatorial characterisation of the graphs that admit a realisation as a minimally rigid generic bar-joint framework in $\bR^2$. A more general theory is developed for frameworks in $\bR^3$ whose vertices are…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
A lower bound on the solution to the traveling salesman problem is provided, which is expressed in terms of eigenvalues related to the distance matrix for the problem. This bound has many interesting properties such as transforming…
We consider a $\varphi$-rigidity property for divergence-free vector fields in the Euclidean $n$-space, where $\varphi(t)$ is a non-negative convex function vanishing only at $t=0$. We show that this property is always satisfied in…