Related papers: Dimension-counting bounds for equi-isoclinic subsp…
The aim of this paper is to give not only an explicit upper bound of the total Q-curvature but also an induced isoperimetric deficit formula for the complete conformal metrics on $\mathbb R^n$, $n\ge 3$ with scalar curvature being…
Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…
The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension $d>2$. By mapping feasible points of this infinite-dimensional linear program…
We demonstrate the equivalence of two classes of $D$-invariant polynomial subspaces introduced in [8] and [9], i.e., these two classes of subspaces are different representations of the breadth-one $D$-invariant subspace. Moreover, we solve…
We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…
We obtain strong upper bounds for the Betti numbers of compact complex-hyperbolic manifolds. We use the unitary holonomy to improve the results given by the most direct application of the techniques of [DS17]. We also provide effective…
The spline space $C_k^r(\Delta)$ attached to a subdivided domain $\Delta$ of $\R^{d} $ is the vector space of functions of class $C^{r}$ which are polynomials of degree $\le k$ on each piece of this subdivision. Classical splines on planar…
This paper determines the optimal upper bound for the simultaneous packing and covering constants of the two-dimensional centrally symmetric convex domains. It solved a problem opening for more than thirty years.
We find upper bounds on the essential dimension of the moduli stack of parabolic vector bundles over a curve. When there is no parabolic structure, we improve the known upper bound on the essential dimension of the usual moduli stack. Our…
We determine all restrictions on the dimension of the fixed locus of a diagonalizable group acting on a smooth projective variety that arise from the Chern numbers of the ambient variety. We reduce the problem to finding lower bounds for…
We give explicit linear bounds on the p-cohomological dimension of a field in terms of its Diophantine dimension. In particular, we show that for a field of Diophantine dimension at most 4, the 3-cohomological dimension is less than or…
A beautiful result of Br\"ocker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most…
An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
In this survey we give an overview of recent developments on the Quantitative Subspace Theorem. In particular, we discuss a new upper bound for the number of subspaces containing the "large" solutions, obtained jointly with Roberto…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
Let $d \geq 4$ be a natural number and let $A$ be a finite, non-empty subset of $\mathbb{R}^d$ such that $A$ is not contained in a translate of a hyperplane. In this setting, we show that \[ |A-A| \geq \bigg(2d - 2 + \frac{1}{d-1} \bigg)…
After the optimal parameters of additive quaternary codes of dimension $k\le 3$ have been determined there is some recent activity to settle the next case of dimension $k=3.5$. Here we complete dimension $k=3.5$ and $k=4$. We also solve the…
Let V be a vector space of dimension n over a field K and let Symm(V) denote the space of symmetric bilinear forms defined on V x V. Let M be a subspace of Symm(V). We investigate a variety of hypotheses concerning the rank of elements in M…