Related papers: Lifting with Inner Functions of Polynomial Discrep…
We significantly strengthen and generalize the theorem lifting Nullstellensatz degree to monotone span program size by Pitassi and Robere (2018) so that it works for any gadget with high enough rank, in particular, for useful gadgets such…
A loss function measures the discrepancy between the true values and their estimated fits, for a given instance of data. In classification problems, a loss function is said to be proper if a minimizer of the expected loss is the true…
We formulate and prove a dimension-theoretic generalization of the Lebesgue Covering Theorem. A generalized $n$-dimensional version of the Steinhaus Chessboard Theorem, recently proved by Turza\'nski and Ziajor, is a simple consequence of…
Universal approximation theorem suggests that a shallow neural network can approximate any function. The input to neurons at each layer is a weighted sum of previous layer neurons and then an activation is applied. These activation…
The product of any number of Legendre functions, under a restricted domain, can be expanded by the corresponding Legendre polynomials, with the coefficient being the sinc function. While an analogous expansion can be made for any number of…
Addition theorems are principal tools that express a function $f (\bm{r} \pm \bm{r}')$ in terms of products of other functions that only depend on either $\bm{r}$ or $\bm{r}'$. The best known example of such an addition theorem is the…
Index theorem is formulated in noncommutative geometry with finite degrees of freedom by using Ginsparg-Wilson relation. It is extended to the case where the gauge symmetry is spontaneously broken. Dynamical analysis about topological…
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in $Z[x]$ from information modulo a prime number $p\ne 2$ to a power $p^k$ for any $k$, and…
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…
A powerful statistical interpolating concept, which we call \emph{fully lifted} (fl), is introduced and presented while establishing a connection between bilinearly indexed random processes and their corresponding fully decoupled (linearly…
There are now many theoretical explanations for why Benford's law of digit bias surfaces in so many diverse fields and data sets. After briefly reviewing some of these, we discuss in depth recurrence relations. As these are discrete…
Provided a special function of one variable and some of its derivatives can be accurately computed over a finite range, a method is presented to build a series of polynomial approximations of the function with a defined relative error over…
In this paper we introduce a collection of powerful statistical comparison results. We first present the results that we obtained while developing a general comparison concept. After that we introduce a separate lifting procedure that is a…
Several integrals involving powers and ordinary hypergeometric functions are rederived by means of a generalized hypergeometric function of two variables (Appell's function) recovering some well-known expressions as particular cases. Simple…
We consider the problem of interpolating functions partially defined over a distributive lattice, by means of lattice polynomial functions. Goodstein's theorem solves a particular instance of this interpolation problem on a distributive…
We consider a special case of Dickson's lemma: for any two functions $f,g$ on the natural numbers there are two numbers $i<j$ such that both $f$ and $g$ weakly increase on them, i.e., $f_i\le f_j$ and $g_i \le g_j$. By a combinatorial…
We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows: 1. We show that the classical adversary bound lifts to a lower bound on randomized communication…
For given $p\in\lbrack1,\infty]$ and $g\in L^{p}\mathbb{(R)}$, we establish the existence and uniqueness of solutions $f\in L^{p}(\mathbb{R)}$, to the equation \[ f(x)-af(bx)=g(x), \] where $a\in\mathbb{R}$, $b\in\mathbb{R} \setminus…
It is known that the dynamics of $f$ and $g$ vary to a large extent from that of its composite entire functions. Using Approximation theory of entire functions, we have shown the existence of entire functions $f$ and $g$ having infinite…
A strong direct product theorem states that if we want to compute $k$ independent instances of a function, using less than $k$ times the resources needed for one instance, then the overall success probability will be exponentially small in…