Related papers: On polynomial approximations over $\mathbb{Z}/2^k\…

We provide the existence of new degree growths in the context of polynomial automorphisms of $\mathbb{C}^k$: if $k$ is an integer $\geq 3$, then for any $\ell\leq \left[\frac{k-1}{2}\right]$ there exist polynomial automorphisms $f$ of…

Let $F$ be a quadratic APN function of $n$ variables. The associated Boolean function $\gamma_F$ in $2n$ variables ($\gamma_F(a,b)=1$ if $a\neq{\bf 0}$ and equation $F(x)+F(x+a)=b$ has solutions) has the form $\gamma_F(a,b) = \Phi_F(a)…

For $f$ analytic and close to convex in $D=\{z: |z|< 1\}$, we give sharp estimates for the logarithmic coefficients $\gamma_{n}$ of $f$ defined by $\log \dfrac{f(z)}{z}=2\sum_{n=1}^{\infty} \gamma_{n}z^{n}$ when $n=1, 2,3$.

Let $2^{[n]}$ denote the power set of $[n]:=\{1,2,..., n\}$. A collection $\B\subset 2^{[n]}$ forms a $d$-dimensional {\em Boolean algebra} if there exist pairwise disjoint sets $X_0, X_1,..., X_d \subseteq [n]$, all non-empty with perhaps…

Consider the model where we can access a parity function through random uniform labeled examples in the presence of random classification noise. In this paper, we show that approximating the number of relevant variables in the parity…

The vector space of all polynomial functions of degree $k$ on a box of dimension $n$ is of dimension ${n \choose k}$. A consequence of this fact is that a function can be approximated on vertices of the box using other vertices to higher…

We provide examples of multiplicative functions $f$ supported on the $k$-free integers such that at primes $f(p)=\pm 1$ and such that the partial sums of $f$ up to $x$ are $o(x^{1/k})$. Further, if we assume the Generalized Riemann…

Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

About twenty years ago we wrote a paper, "Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels", \cite{FKN}. In it we offered several proofs of the statement that Boolean functions $f(x_1,x_2,\dots,x_n)$, whose…

We prove a structural result for degree-$d$ polynomials. In particular, we show that any degree-$d$ polynomial, $p$ can be approximated by another polynomial, $p_0$, which can be decomposed as some function of polynomials $q_1,...,q_m$ with…

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…

In a private communication, K. Ono conjectured that any mock theta function of weight 1/2 or 3/2 can be congruent modulo a prime $p$ to a weakly holomorphic modular form for just a few values of $p$. In this paper we describe when such a…

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

We study $\mathbb{R}_{\textrm{an},\exp}$-definable functions $f:\mathbb{R}\to \mathbb{R}$ that take integer values at all sufficiently large positive integers. If $|f(x)|= O\big(2^{(1+10^{-5})x}\big)$, then we find polynomials $P_1, P_2$…

We prove that there is a constant $C\leq 6.614$ such that every Boolean function of degree at most $d$ (as a polynomial over $\mathbb{R}$) is a $C\cdot 2^d$-junta, i.e. it depends on at most $C\cdot 2^d$ variables. This improves the $d\cdot…

A Boolean function f over n variables is said to be q-locally correctable if, given a black-box access to a function g which is "close" to an isomorphism f_sigma of f, we can compute f_sigma(x) for any x in Z_2^n with good probability using…

We consider Boolean functions f:{-1,1}^n->{-1,1} that are close to a sum of independent functions on mutually exclusive subsets of the variables. We prove that any such function is close to just a single function on a single subset. We also…

An algebraic approximation, of order $K$, of a polyhedron correlation function (CF) can be obtained from $\gamma\pp(r)$, its chord-length distribution (CLD), considering first, within the subinterval $[D_{i-1},\, D_i]$ of the full range of…