Related papers: Lower Bounds in Real Schubert Calculus
The Grassmann convexity conjecture gives a conjectural formula for the maximal total number of real zeros of the consecutive Wronskians of an arbitrary fundamental solution to a disconjugate linear ordinary differential equation with real…
In this paper we apply a scaling invariance analysis to reduce a class of parabolic moving boundary problems to free boundary problems governed by ordinary differential equations. As well known free boundary problems are always non-linear…
In this paper, we initiate the study of constant dimension subspace codes restricted to Schubert varieties, which we call Schubert subspace codes. These codes have a very natural geometric description, as objects that we call intersecting…
We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…
In the framework of a real Hilbert space we consider the problem of approaching solutions to a class of hierarchical variational inequality problems, subsuming several other problem classes including certain mathematical programs under…
Fulton asked how many solutions to a problem of enumerative geometry can be real, when that problem is one of counting geometric figures of some kind having specified position with respect to some general fixed figures. For the problem of…
The Grassmann manifold of linear subspaces is important for the mathematical modelling of a multitude of applications, ranging from problems in machine learning, computer vision and image processing to low-rank matrix optimization problems,…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
We investigate a variant of Wirsing's problem on approximation to a real number by real algebraic numbers of degree exactly $n$. This has been studied by Bugeaud and Teulie. We improve their bounds for degrees up to $n=7$. Moreover, we…
Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…
We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…
We consider a number of linear and non-linear boundary value problems involving generalized Schr\"odinger equations. The model case is $-\Delta u=Vu$ for $u\in W_0^{1,2}(D)$ with $D$ a bounded domain in ${\bf R^n}$. We use the Sobolev…
We look for solutions to the Schr\"odinger equation \[ -\Delta u + \lambda u = g(u) \quad \text{in } \mathbb{R}^N \] coupled with the mass constraint $\int_{\mathbb{R}^N}|u|^2\,dx = \rho^2$, with $N\ge2$. The behaviour of $g$ at the origin…
In this paper, we mainly establish the existence of at least three non-trivial solutions for a class of nonhomogeneous quasilinear elliptic systems with Dirichlet boundary value or Neumann boundary value in a bounded domain…
In this paper we study the tradeoff between parallelism and communication cost in a map-reduce computation. For any problem that is not "embarrassingly parallel," the finer we partition the work of the reducers so that more parallelism can…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
We study the branch divisors on the boundary of the canonical toroidal compactification of ball quotients. We show a criterion, the low slope cusp form trick, for proving that ball quotients are of general type. Moreover, we classify when…
We study sharp frame bounds of Gabor systems over rectangular lattices for different windows and integer oversampling rate. In some cases we obtain optimality results for the square lattice, while in other cases the lattices optimizing the…
We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…