Related papers: Lower Bounds in Real Schubert Calculus
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
We develop new tools leading, for each integer $n\ge 4$, to a significantly improved upper bound for the uniform exponent of rational approximation $\widehat{\lambda}_n(\xi)$ to successive powers $1,\xi,\dots,\xi^n$ of a given real…
We prove Gaussian upper and lower bounds for the fundamental solutions of a class of degenerate parabolic equations satisfying a weak Hormander condition. The bound is independent of the smoothness of the coefficients and generalizes…
The Schubert vanishing problem is a central decision problem in algebraic combinatorics and Schubert calculus, with applications to representation theory and enumerative algebraic geometry. The problem has been studied for over 50 years in…
In this paper a lower bound for solutions to the secular equation of the Schr\"odinger equation with basis functions discontinuous on boundaries of divided regions is given. If the functions do not have the discontinuity, the bound reduces…
The classical branch-and-bound algorithm for the integer feasibility problem has exponential worst case complexity. We prove that it is surprisingly efficient on reformulated problems, in which the columns of the constraint matrix are…
We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
In this paper, we first prove the existence of solutions to Dirichlet problems involving the fractional $g$-Laplacian operator and lower order terms by appealing to sub- and supersolution methods. Moreover, we also state the existence of…
In this paper, we study the existence, nonexistence and multiplicity of positive solutions to the problem given by \begin{equation*} \label{1} \left\{\begin{split} \mathcal{L}u\: &= \lambda u^{q} + u^{p}, \quad u>0 ~~ \text{in} ~\Omega,…
This paper focuses on greedy expansions, one possible representation of numbers, and on arithmetical operations with them. Performing addition or multiplication some additional digits can appear. We study bounds on the number of such digits…
One hundred years ago, Hilbert gave a list of important open problems in mathematics. His 15th problem asked for the development of a rigorous calculus explaining Schubert's enumerative results for intersecting varieties defined by rank…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics with branching types beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the coalgebraic $\mu$-calculus…
An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…
Multiplication is one of the most fundamental computational problems, yet its true complexity remains elusive. The best known upper bound, by F\"{u}rer, shows that two $n$-bit numbers can be multiplied via a boolean circuit of size $O(n \lg…
Optimal Transport (OT) is a fundamental tool for comparing probability distributions, but its exact computation remains prohibitive for large datasets. In this work, we introduce novel families of upper and lower bounds for the OT problem…
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality…
In this paper we prove lower bounds for sizes of refutations of unsatisfiable vector Subset Sum instances $\overrightarrow{a}_1 x_1 + \dots + \overrightarrow{a}_n x_n = \overrightarrow{b}$ in the proof system Res(lin$_{\mathbb{F}_q}$) where…
Let $P$ be a collection of $n$ points moving along pseudo-algebraic trajectories in the plane. One of the hardest open problems in combinatorial and computational geometry is to obtain a nearly quadratic upper bound, or at least a subcubic…
For a given curve X and divisor class C, we give lower bounds on the degree of a divisor A such that A and A-C belong to specified semigroups of divisors. For suitable choices of the semigroups we obtain (1) lower bounds for the size of a…