English
Related papers

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

200 papers

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Combinatorics · Mathematics 2025-10-06 Michael Kiermaier , Jonathan Mannaert , Alfred Wassermann

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

Algebraic Geometry · Mathematics 2024-09-04 Boulos El Hilany , Sébastien Tavenas

In [GW09a] we conjectured that uniformity of degree $k-1$ is sufficient to control an average over a family of linear forms if and only if the $k$th powers of these linear forms are linearly independent. In this paper we prove this…

Number Theory · Mathematics 2019-06-14 W. T. Gowers , J. Wolf

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

Numerical Analysis · Mathematics 2022-03-08 Ben Adcock , Alexei Shadrin

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…

Numerical Analysis · Mathematics 2025-06-27 Kingsley Yeon , Steven B. Damelin

The notion of a descent polynomial, a function in enumerative combinatorics that counts permutations with specific properties, enjoys a revived recent research interest due to its connection with other important notions in combinatorics,…

Combinatorics · Mathematics 2021-09-13 Angel Raychev

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

Combinatorics · Mathematics 2016-10-18 Jacob Sprittulla

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high…

Computational Complexity · Computer Science 2019-10-08 Srikanth Srinivasan , Utkarsh Tripathi , S. Venkitesh

It is shown that if a function defined on the segment [-1,1] has sufficiently good approximation by partial sums of the Legendre polynomial expansion, then, given the function's Fourier coefficients $c_n$ for some subset of $n\in[n_1,n_2]$,…

Number Theory · Mathematics 2010-08-31 Sergei N. Preobrazhenskii

We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…

We derive and showcase a novel approach to approximating Fourier transforms in higher dimensions, focusing specifically on the case of 2D radially concentrated ('ring-like') functions. We first reduce the problem to that of evaluating the…

High Energy Astrophysical Phenomena · Physics 2026-04-08 Filip Niewiński , Michael D. Johnson

Let $f: \{0,1\}^n \to \{0, 1\}$ be a boolean function, and let $f_\land (x, y) = f(x \land y)$ denote the AND-function of $f$, where $x \land y$ denotes bit-wise AND. We study the deterministic communication complexity of $f_\land$ and show…

Computational Complexity · Computer Science 2020-10-23 Alexander Knop , Shachar Lovett , Sam McGuire , Weiqiang Yuan

Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…

Computational Complexity · Computer Science 2013-07-05 Yi Ming Zou

Let $\mathcal{H}$ denote the class of harmonic functions $f$ in $\mathbb{D}:= \{z\in \mathbb{C}:|z| < 1\}$ normalized by $f(0) = 0 = f_z(0) -1$. For $\alpha \geq 0$, we consider the following class $$\mathcal{W}^0_{\mathcal{H}}(\alpha):=…

Complex Variables · Mathematics 2016-06-28 Nirupam Ghosh , A. Vasudevarao

We obtain closed expressions for weighted orthogonal polynomials and optimal approximants associated with the function $f(z)=1-\frac{1}{\sqrt{2}}(z_1+z_2)$ and a scale of Hilbert function spaces in the unit $2$-ball having reproducing…

Complex Variables · Mathematics 2021-10-28 Meredith Sargent , Alan A. Sola

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Numerical Analysis · Mathematics 2023-02-06 Markus Bachmayr , Geneviève Dusson , Christoph Ortner , Jack Thomas

Polynomial reproduction plays a relevant role in deriving error estimates for various approximation schemes. Local reproduction in a quasi-uniform setting is a significant factor in the estimation of error and the assessment of stability…

Numerical Analysis · Mathematics 2024-11-25 Stefano De Marchi , Giacomo Cappellazzo

The spectrum of a complex-valued function $f$ on $\mathbb{Z}_{q}^n$ is the set $\{|u|:u\in \mathbb{Z}_q^n~\mathrm{and}~\widehat{f}(u)\neq 0\}$, where $|u|$ is the Hamming weight of $u$ and $\widehat{f}$ is the Fourier transform of $f$. Let…

Combinatorics · Mathematics 2024-04-17 Alexandr Valyuzhenich

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Number Theory · Mathematics 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

We show that the there exists an infinite family of APN functions of the form $F(x)=x^{2^{s}+1} + x^{2^{k+s}+2^k} + cx^{2^{k+s}+1} + c^{2^k}x^{2^k + 2^s} + \delta x^{2^{k}+1}$, over $\gf_{2^{2k}}$, where $k$ is an even integer and…

Information Theory · Computer Science 2011-10-17 Carl Bracken , Chik How Tan , Tan Yin
‹ Prev 1 3 4 5 6 7 10 Next ›