Related papers: Grothendieck inequalities characterize converses t…
We present an elementary, self-contained proof of Grothendieck's inequality that unifies the real and complex cases and yields both the Krivine and Haagerup bounds, the current best-known explicit bounds for the real and complex…
A general explicit form for generating functions for approximating fractional derivatives is derived. To achieve this, an equivalent characterisation for consistency and order of approximations established on a general generating function…
It follows from Grothendieck's little inequality that to any complex (m x n) matrix X of column norm at most 1, and an 0 <e <1, there exist a natural number q, an (m x q) matrix C with $(1-e)^2 \leq CC^* \leq (4/\pi) (1 + e)^2$ and an (q x…
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real or the complex coefficients. For a given pair of polynomials and a degree, our algorithm finds a pair of…
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0,1}^N in the black-box model. We show that, in the black-box model, the exponential quantum speed-up obtained for partial functions…
Grothendieck's inequalities for operators and bilinear forms imply some factorization results for complex m x n matrices. Based on the theory of operator spaces and completely bounded mappings we present norm optimal versions of these…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…
In this paper we introduce a new family of Bernstein-type exponential polynomials on the hypercube $[0, 1]^d$ and study their approximation properties. Such operators fix a multidimensional version of the exponential function and its…
Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…
The Grothendieck--Serre conjecture predicts that every generically trivial torsor under a reductive group scheme $G$ over a regular local ring $R$ is trivial. We settle it in the case when $G$ is quasi-split and $R$ is unramified. Some of…
We study the problem of approximating the mixed volume $V(P_1^{(\alpha_1)}, \dots, P_k^{(\alpha_k)})$ of an $k$-tuple of convex polytopes $(P_1, \dots, P_k)$, each of which is defined as the convex hull of at most $m_0$ points in…
We use generating functions to relate the expected values of polynomial factorization statistics over $\mathbb{F}_q$ to the cohomology of ordered configurations in $\mathbb{R}^3$ as a representation of the symmetric group. Our methods lead…
We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…
Polytopes in R^n with integral vertices form a monoid under the Minkowski sum, and the Grothendieck construction gives rise to a group. We show that every symmetric polytope is a norm in this group for every n.
In this note, we describe a simple approach to obtain a differentially private algorithm for k-clustering with nearly the same multiplicative factor as any non-private counterpart at the cost of a large polynomial additive error. The…
We give an algebraic proof of the determinant formulas for factorial Grothendieck polynomials obtained by Hudson--Ikeda--Matsumura--Naruse and by Hudson--Matsumura.
Two models were recently proposed to explore the robust hardness of Gr\"obner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for…
Given a multi-variant polynomial inequality with a parameter, how to find the best possible value of this parameter that satisfies the inequality? For instance, find the greatest number $k$ that satisfies $ a^3+b^3+c^3+…
We prove that non-hyperbolic non-renormalizable quadratic polynomials are expansion inducing. For renormalizable polynomials a counterpart of this statement is that in the case of unbounded combinatorics renormalized mappings become almost…