Related papers: Approximate Pythagoras Numbers on $*$-algebras ove…
We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…
Consider a sum of convex functions, where the only information known about each individual summand is the location of a minimizer. In this work, we give an exact characterization of the set of possible minimizers of the sum. Our results…
Persson's formula expresses the infimum of the essential spectrum of a suitable self-adjoint Schr\"odinger operator in $R^n$ in terms of the lower spectral points of a family of restrictions of the operator to complements of relatively…
There is a sizable literature on investigating the minimum and maximum numbers of cycles in a class of graphs. However, the answer is known only for special classes. This paper presents a result on the smallest number of cycles in…
This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in $\re^m$ defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares…
Pisot numbers are real algebraic integers bigger than 1, whose other conjugates have all modulus smaller than 1. In this paper we deal with the algorithmic problem of finding the smallest Pisot unit generating a given number field. We first…
A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…
The least squares solutions with the minimum norm of the matrix equations ${\rm {\bf A}}{\rm {\bf X}} = {\rm {\bf B}}$, ${\rm {\bf X}}{\rm {\bf A}} = {\rm {\bf B}}$ and ${\rm {\bf A}}{\rm {\bf X}}{\rm {\bf B}} ={\rm {\bf D}} $ are…
We introduce a $q$-deformation of the Pythagoras equation $a^2 + b^2 = c^2$, which is a polynomial version of it different from the standard one. We construct a polynomial analogue, or ``$q$-analogue'', of every primitive Pythagorean…
In this paper, we continue the study of small squares containing at least two points on a modular hyperbola $x y \equiv c \pmod{p}$. We deduce a lower bound for its side length. We also investigate what happens if the ``distances" between…
Consider an operator that takes the Fourier transform of a discrete measure supported in $\mathcal{X}\subset[-\frac 12,\frac 12)^d$ and restricts it to a compact $\Omega\subset\mathbb{R}^d$. We provide lower bounds for its smallest singular…
The method of ``Total Least Squares'' is proposed as a more natural way (than ordinary least squares) to approximate the data if both the matrix and and the right-hand side are contaminated by ``errors''. In this tutorial note, we give a…
We show that the distance from an element of a C*-algebra to the set of regular elements is the infimum of the $\delta>0$ for which the $\delta$-cut-down of the element admits a polar decomposition within the algebra. This parallels results…
The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. Minimum rank is a…
The problem of characterizing a real polynomial $f$ as a sum of squares of polynomials on a real algebraic variety $V$ dates back to the pioneering work of Hilbert in [Mathematische Annalen 32.3 (1888): 342-350]. In this paper, we…
The pentaquark width is calculated in QCD sum rules. The higher dimension operators contribution is accounted. It is shown, that $\Gamma_{\Theta}$ should be very small, less than $1Mev$.
We give a general method for proving quantum lower bounds for problems with small range. Namely, we show that, for any symmetric problem defined on functions $f:\{1, ..., N\}\to\{1, ..., M\}$, its polynomial degree is the same for all…
We show that the smallest $\alpha$ so that $\alpha D + (1-\alpha)A \succcurlyeq 0$ is at least $1/\vartheta(\overline{G})$, significantly improving upon a result due to Nikiforov and Rojo (2017). In fact, we display an even stronger…
This article proves a Pythagoras-type formula for the sides and diagonals of a polygon inscribed in a semicircle having one of the sides of the polygon as diameter.
We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…