Related papers: Explicit SoS lower bounds from high-dimensional ex…
The aim of this article is to understand the geometry of limit sets in pseudo-Riemannian hyperbolic geometry. We focus on a class of subgroups of $\mathrm{PO}(p,q+1)$ introduced by Danciger, Gu\'eritaud and Kassel, called…
This paper investigates a recently introduced notion of strong variational sufficiency in optimization problems whose importance has been highly recognized in optimization theory, numerical methods, and applications. We address a general…
Strong variational sufficiency is a newly proposed property, which turns out to be of great use in the convergence analysis of multiplier methods. However, what this property implies for non-polyhedral problems remains a puzzle. In this…
Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted setting, the dependency of the complexity of the distributed Lov\'asz Local Lemma (LLL) on the chosen LLL criterion exhibits a sharp threshold phenomenon: They proved…
We introduce a new method for constructing solenoidal extensions of fairly general boundary data in (2d or 3d) cubes that contain an obstacle. This method allows us to provide explicit bounds for the Dirichlet norm of the extensions. It…
We consider complex-valued solutions of the three-dimensional Navier-Stokes system without external forcing on $R^3$. We show that there exists an open set in the space of 10-parameter families of initial conditions such that for each…
This is an expository paper aiming to introduce Zilber's Exponential Closedness conjecture to a general audience. Exponential Closedness predicts when (systems of) equations involving addition, multiplication, and exponentiation have…
We show that various methods for explicitly building resolutions of unbounded complexes in fact fail when applied to a rather simple and explicit complex. We show that one way to rescue these methods is to assume Roos (Ab.4$^*$)-$k$ axiom,…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
In this paper we will study certain models of irreducible admissible representations of the split special orthogonal group $SO(2n+1)$ over a nonarchimedean local field. If $n=1$, these models were considered by Waldspurger. If $n=2$, they…
We prove lower bounds for higher-order methods in smooth non-convex finite-sum optimization. Our contribution is threefold: We first show that a deterministic algorithm cannot profit from the finite-sum structure of the objective, and that…
We show, among other things, that for each integer $n \ge 3$, there is a smooth complex projective rational variety of dimension $n$, with discrete non-finitely generated automorphism group and with infinitely many mutually non-isomorphic…
While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is…
This article aims to study the class of strongly self-dual polytopes (ssd-polytopes for short), defined in a paper by Lov\'asz \cite{lovasz}. He described a series of such polytopes (called $L$-type polytopes), which he used to solve a…
In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…
It has often been claimed in recent papers that one can find a degree d Sum-of-Squares proof if one exists via the Ellipsoid algorithm. In [O17], Ryan O'Donnell notes this widely quoted claim is not necessarily true. He presents an example…
We develop a unified construction of matrix-valued orthogonal polynomials associated with discrete weights, yielding bispectral sequences as eigenfunctions of second-order difference operators. This general framework extends the discrete…
We establish new non-uniqueness results for the Euler equations with external force on $\mathbb{T}^{d}$ $(d\geq3)$. By introducing a novel alternating convex integration scheme, we construct non-unique, almost-everywhere smooth,…
The Strong Exponential Time Hypothesis and the OV-conjecture are two popular hardness assumptions used to prove a plethora of lower bounds, especially in the realm of polynomial-time algorithms. The OV-conjecture in moderate dimension…
We present two explicit expressions for generic singular vectors of type $(r,s)$ of the Virasoro algebra. These results follow from the paper of Bauer et al which presented recursive methods to construct the vectors. The expressions…