Related papers: Explicit Lower Bounds via Geometric Complexity The…
Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…
We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…
Tensors decompositions are a class of tools for analysing datasets of high dimensionality and variety in a natural manner, with the Canonical Polyadic Decomposition (CPD) being a main pillar. While the notion of CPD is closely intertwined…
We write down an explicit sequence of tensors in $C^m\otimes C^m\otimes C^m$, for all $m$ sufficiently large, having border rank at least $2.02m$, overcoming a longstanding barrier. We obtain our lower bounds via the border substitution…
We study a generalized boundary rigidity problem, which investigates whether the areas of embedded minimal surfaces can uniquely determine a Riemannian manifold with boundary. We prove that for a conformal perturbation of an analytic metric…
Computing the number of realizations of a minimally rigid graph is a notoriously difficult problem. Towards this goal, for graphs that are minimally rigid in the plane, we take advantage of a recently published algorithm, which is the…
We prove that for $d\geq 3$, the 1-skeleton of any $(d-1)$-dimensional doubly Cohen Macaulay (abbreviated 2-CM) complex is generically $d$-rigid. This implies the following two corollaries (by Kalai and Lee respectively): Barnette's lower…
In this paper, we investigate the complexity of the central path of semidefinite optimization through the lens of real algebraic geometry. To that end, we propose an algorithm to compute real univariate representations describing the…
We give upper and lower bounds on the leading coefficients of the $L^2$-Alexander torsions of a $3$-manifold $M$ in terms of hyperbolic volumes and of relative $L^2$-torsions of sutured manifolds obtained by cutting $M$ along certain…
We develop a new technique for constructing sparse graphs that allow us to prove near-linear lower bounds on the round complexity of computing distances in the CONGEST model. Specifically, we show an $\widetilde{\Omega}(n)$ lower bound for…
Treewidth (tw) is an important parameter that, when bounded, yields tractability for many problems. For example, graph problems expressible in Monadic Second Order (MSO) logic and QUANTIFIED SAT or, more generally, QUANTIFIED CSP, are FPT…
The maximal coding rate reduction (MCR$^2$) objective for learning structured and compact deep representations is drawing increasing attention, especially after its recent usage in the derivation of fully explainable and highly effective…
We resolve a conjecture of Kalai relating approximation theory of convex bodies by simplicial polytopes to the face numbers and primitive Betti numbers of these polytopes and their toric varieties. The proof uses higher notions of…
Many load balancing problems that arise in scientific computing applications ask to partition a graph with weights on the vertices and costs on the edges into a given number of almost equally-weighted parts such that the maximum boundary…
For many computational problems involving randomness, intricate geometric features of the solution space have been used to rigorously rule out powerful classes of algorithms. This is often accomplished through the lens of the multi Overlap…
We prove the first nontrivial worst-case lower bounds for two closely related problems. First, $\Omega(n^{3/2})$ degree-1 reductions, series-parallel reductions, and $\Delta$Y transformations are required in the worst case to reduce an…
The Bounded Negativity Conjecture predicts that for any smooth complex surface $X$ there exists a lower bound for the selfintersection of reduced divisors on $X$. This conjecture is open. It is also not known if the existence of such a…
We give new polynomial lower bounds for a number of dynamic measure problems in computational geometry. These lower bounds hold in the Word-RAM model, conditioned on the hardness of either 3SUM, APSP, or the Online Matrix-Vector…
A recent analysis of real general relativity based on multisymplectic techniques has shown that boundary terms may occur in the constraint equations, unless some boundary conditions are imposed. This paper studies the corresponding form of…
We make an in-depth study of the known border rank (i.e. approximate) algorithms for the matrix multiplication tensor encoding the multiplication of an n x 2 matrix by a 2 x 2 matrix.