English
Related papers

Related papers: On Block Sensitivity and Fractional Block Sensitiv…

200 papers

This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $\epsilon$ that the distortion exceeds a given level $d$. Tight general achievability and converse bounds are derived that hold at…

Information Theory · Computer Science 2016-11-15 Victoria Kostina , Sergio Verdú

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

Computational Complexity · Computer Science 2018-01-16 Alexander A. Sherstov

We prove a new lower bound on the parity decision tree complexity $\mathsf{D}_{\oplus}(f)$ of a Boolean function $f$. Namely, granularity of the Boolean function $f$ is the smallest $k$ such that all Fourier coefficients of $f$ are integer…

Computational Complexity · Computer Science 2018-10-29 Anastasiya Chistopolskaya , Vladimir V. Podolskii

Approximation methods are widely used in many fields and many techniques have been published already. This comparative study presents a comparison of LOWESS (Locally weighted scatterplot smoothing) and RBF (Radial Basis Functions)…

Graphics · Computer Science 2018-01-03 Michal Smolik , Vaclav Skala , Ondrej Nedved

We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…

Computational Complexity · Computer Science 2026-02-03 Sourav Chakraborty , Swarnalipa Datta , Pranjal Dutta , Arijit Ghosh , Swagato Sanyal

In this paper, we employ fixed point theory and semidefinite programming to compute the performance bounds on convex block-sparsity recovery algorithms. As a prerequisite for optimal sensing matrix design, a computable performance bound…

Information Theory · Computer Science 2011-10-06 Gongguo Tang , Arye Nehorai

Understanding physical mechanisms relies on the accurate determination of fundamental constants, although inherent limitations in experimental techniques introduce uncertainties into these measurements. This paper explores the uncertainties…

General Relativity and Quantum Cosmology · Physics 2024-07-11 Surajit Kalita

We study a gas of hard rods on a ring, driven by an external thermostat, with either elastic or inelastic collisions, which exhibits sub-diffusive behavior $<x^2 > \sim t^{1/2}$. We show the validity of the usual Fluctuation-Dissipation…

Statistical Mechanics · Physics 2008-10-10 D. Villamaina , A. Puglisi , A. Vulpiani

This book intends to deepen the study of the fractional calculus, giving special emphasis to variable-order operators. It is organized in two parts, as follows. In the first part, we review the basic concepts of fractional calculus (Chapter…

Optimization and Control · Mathematics 2018-06-19 Ricardo Almeida , Dina Tavares , Delfim F. M. Torres

In this paper we develop a new method for numerically approximating sensitivities in parameter-dependent ordinary differential equations (ODEs). Our approach, intended for situations where the standard forward and adjoint sensitivity…

Numerical Analysis · Mathematics 2024-07-12 Olivia Eriksson , Andrei Kramer , Federica Milinanni , Pierre Nyquist

Let $f: T\to \{ 0,1 \}$ be a Boolean function on the Boolean half-slice, $T$, \ie elements of $\{0,1\}^n$ with Hamming weight $n/2$. We show that if $f(x)+f(y)=f(x+y)$ holds with probability $\frac{1+\delta}{2}$ over a uniform pair $(x,y)$…

Computational Complexity · Computer Science 2026-05-27 Haakon Larsen , Tushant Mittal , Silas Richelson , Sourya Roy

We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…

Combinatorics · Mathematics 2007-05-23 Alex Samorodnitsky

We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity decision tree complexity. Let f be a Boolean function with…

Computational Complexity · Computer Science 2020-08-04 Nikhil S. Mande , Swagato Sanyal

Binary Decision Diagrams (BDDs) are widely used for the representation of Boolean functions. Context-Free-Language Ordered Decision Diagrams (CFLOBDDs) are a plug-compatible replacement for BDDs -- roughly, they are BDDs augmented with a…

Symbolic Computation · Computer Science 2024-11-25 Xusheng Zhi , Thomas Reps

In this paper we study the regularity properties of fractional maximal operators acting on $BV$-functions. We establish new bounds for the derivative of the fractional maximal function, both in the continuous and in the discrete settings.

Classical Analysis and ODEs · Mathematics 2021-09-30 Emanuel Carneiro , José Madrid

Boolean functions are important primitives in different domains of cryptology, complexity and coding theory. In this paper, we connect the tools from cryptology and complexity theory in the domain of Boolean functions with low polynomial…

Computational Complexity · Computer Science 2021-07-26 Subhamoy Maitra , Chandra Sekhar Mukherjee , Pantelimon Stanica , Deng Tang

Optical clocks with unprecedented accuracy of 10^(-18) will lead to innovations in many research areas. All the applications of optical clocks rely on the ability of precisely converting the frequency from one optical clock to another, or…

Optics · Physics 2016-10-20 Yuan Yao , Yanyi Jiang , Hongfu Yu , Zhiyi Bi , Longsheng Ma

We derive the exact beyond-linear fluctuation dissipation relation, connecting the response of a generic observable to the appropriate correlation functions, for Markov systems. The relation, which takes a similar form for systems governed…

Statistical Mechanics · Physics 2008-07-03 E. Lippiello , F. Corberi , A. Sarracino , M. Zannetti

Fast radio bursts (FRBs) are short-duration radio transients of unknown origin. Thus far, they have been blindly detected at millisecond timescales with dispersion measures (DMs) between 110--2600\,pc\,cm$^{-3}$. However, the observed pulse…

High Energy Astrophysical Phenomena · Physics 2019-07-10 Liam Connor

Strong difference families of special types are introduced to produce new relative difference families from the point of view of both asymptotic existences and concrete examples. As applications, group divisible designs of type $30^u$ with…

Combinatorics · Mathematics 2019-08-27 Yanxun Chang , Simone Costa , Tao Feng , Xiaomiao Wang