English
Related papers

Related papers: On $(2n/3-1)$-resilient $(n,2)$-functions

200 papers

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 modularity of the functions of the form $r(\tau)^ar(2\tau)^b$, where $a$ and $b$ are integers with $(a,b)\neq (0,0)$ and $r(\tau)$ is the Rogers-Ramanujan continued fraction, which may be considered as companions to the…

Number Theory · Mathematics 2025-09-17 Russelle Guadalupe

A subset $S$ of $\{0,1,...,2t-1\}^n$ is called a $t$-fold MDS code if every line in each of $n$ base directions contains exactly $t$ elements of $S$. The adjacency graph of a $t$-fold MDS code is not connected if and only if the…

Combinatorics · Mathematics 2008-05-14 Denis Krotov

A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean…

Machine Learning · Computer Science 2014-07-10 Dana Dachman-Soled , Vitaly Feldman , Li-Yang Tan , Andrew Wan , Karl Wimmer

In the literature on slice analysis in the hypercomplex setting, there are two main approaches to define slice regular functions in one variable: one consists in requiring that the restriction to any complex plane is holomorphic (with the…

Complex Variables · Mathematics 2024-06-28 Xinyuan Dou , Guangbin Ren , Irene Sabadini , Ting Yang

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

Logic · Mathematics 2015-03-19 Arno Pauly , Martin Ziegler

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Computational Complexity · Computer Science 2021-02-24 Guoliang Xu , Daowen Qiu

Let f:{-1,1}^n -> R be a real function on the hypercube, given by its discrete Fourier expansion, or, equivalently, represented as a multilinear polynomial. We say that it is Boolean if its image is in {-1,1}. We show that every function on…

Discrete Mathematics · Computer Science 2013-11-13 Tom Gur , Omer Tamuz

We study the 2-adic behavior of the number of domino tilings of a 2n-by-2n square as nvaries. It was previously known that this number was of the form 2^n f(n)^2, where f(n) is an odd, positive integer. We show that the function f is…

Combinatorics · Mathematics 2007-05-23 Henry Cohn

We present effective algorithms for uniform approximation of multivariate functions satisfying some prescribed inner structure. We extend in several directions the analysis of recovery of ridge functions $f(x)=g(\langle a,x\rangle)$ as…

Functional Analysis · Mathematics 2014-06-09 Anton Kolleck , Jan Vybiral

We analyze certain compositions of rational inner functions in the unit polydisk $\mathbb{D}^{d}$ with polydegree $(n,1)$, $n\in \mathbb{N}^{d-1}$, and isolated singularities in $\mathbb{T}^d$. Provided an irreducibility condition is met,…

Complex Variables · Mathematics 2023-02-02 Alan Sola

The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound

Information Theory · Computer Science 2023-03-30 Vladimir N. Potapov

For $2\leq s<t$, the Erd\H{o}s-Rogers function $f_{s,t}(n)$ measures how large a $K_s$-free induced subgraph there must be in a $K_t$-free graph on $n$ vertices. There has been an extensive amount of work towards estimating this function,…

Combinatorics · Mathematics 2024-02-06 Oliver Janzer , Benny Sudakov

This paper aims to pursue some classes of normalized analytic functions $f$ with fixed second coefficient defined on open unit disk, such that ${(1+z)^2f(z)}/{z}$ and ${(1+z)f(z)}/{z}$ are functions having positive real part. The radius of…

Complex Variables · Mathematics 2022-03-17 Sushil Kumar , Swati Anand , Naveen Kumar Jain

We prove a weak-type (1,1) inequality for square functions of non-commutative martingales that are simultaneously bounded in $L^2$ and $L^1$. More precisely, the following non-commutative analogue of a classical result of Burkholder holds:…

Functional Analysis · Mathematics 2007-05-23 Narcisse Randrianantoanina

We consider special flows over two-dimensional rotations by $(\alpha,\beta)$ on $\T^2$ and under piecewise $C^2$ roof functions $f$ satisfying von Neumann's condition $\int_{\T^2}f_x(x,y)\,dx\,dy\neq 0\neq \int_{\T^2}f_y(x,y)\,dx\,dy.$ Such…

Dynamical Systems · Mathematics 2010-12-16 K. Fraczek , M. Lemanczyk

The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…

Number Theory · Mathematics 2023-08-15 Qi-Yang Zheng

In this note we prove the following good-$\lambda$ inequality, for $r>2$, all $\lambda > 0$, $\delta \in \big(0, \frac{1}{2} \big)$ \[ \nu\big\{ V_r(f) > 3 \lambda ; \mathcal{M}(f) \leq \delta \lambda\big\} \leq 4 \nu\{s(f) > \delta…

Classical Analysis and ODEs · Mathematics 2015-09-22 Kevin Hughes , Ben Krause , Bartosz Trojan

The main goal in this manuscript is to present a class of functions satisfying a certain orthogonality property for which there also exists a three term recurrence formula. This class of functions, which can be considered as an extension to…

Numerical Analysis · Mathematics 2016-06-28 Cleonice F. Bracciali , John H. McCabe , Teresa E. Pérez , A. Sri Ranga

Let A be a set of integers and let h \geq 2. For every integer n, let r_{A, h}(n) denote the number of representations of n in the form n=a_1+...+a_h, where a_1,...,a_h belong to the set A, and a_1\leq ... \leq a_h. The function r_{A,h}…

Number Theory · Mathematics 2021-01-06 Javier Cilleruelo , Melvyn B. Nathanson