English
Related papers

Related papers: Constructive Relationships Between Algebraic Thick…

200 papers

We study the problem of finding the "smoothest'' local average of a function $f \in \ell^2(\mathbb{Z})$ when we consider its convolution with suitable kernels $u$. The measurement of smoothness is as follows: Given a positive integer $k$,…

Classical Analysis and ODEs · Mathematics 2026-04-29 José Gaitán , Carlos Garzón , José Madrid

We study the evolution of the fine-structure constant, $\alpha$, induced by non-linear density perturbations in the context of the simplest class of quintessence models with a non-minimal coupling to the electromagnetic field, in which the…

Astrophysics · Physics 2009-11-13 P. P. Avelino , C. J. A. P. Martins , J. Menezes , C. Santos

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 show the following result: Assume B is an infinite Boolean Algebra and lambda=d(B). Then s(B*B)$, i.e. s(uf(B)xuf(B))>= lambda$ (if lambda limit - obtained)

Logic · Mathematics 2007-08-16 Saharon Shelah

The thickness $\theta(G)$ of a graph $G$ is the minimum number of planar spanning subgraphs into which the graph $G$ can be decomposed. As a topological invariant of a graph, it is a measurement of the closeness to planarity of a graph, and…

Combinatorics · Mathematics 2012-02-01 Yan Yang , Xiangheng Kong

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

Newtonian spaces generalize first-order Sobolev spaces to abstract metric measure spaces. In this paper, we study regularity of Newtonian functions based on quasi-Banach function lattices. Their (weak) quasi-continuity is established,…

Functional Analysis · Mathematics 2016-09-23 Lukáš Malý

Let $f$ be a function on a bounded domain $\Omega \subseteq \mathbb{R}^n$ and $\delta$ be a positive function on $\Omega$ such that $B(x,\delta(x))\subseteq \Omega$. Let $\sigma(f)(x)$ be the average of $f$ over the ball $B(x,\delta(x))$.…

Analysis of PDEs · Mathematics 2007-09-24 Mohammad Javaheri

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

Data Structures and Algorithms · Computer Science 2011-01-28 Dana Ron , Ronitt Rubinfeld , Muli Safra , Omri Weinstein

A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…

Computational Complexity · Computer Science 2015-08-12 Parikshit Gopalan , Noam Nisan , Rocco A. Servedio , Kunal Talwar , Avi Wigderson

Let f_n denote a kernel density estimator of a continuous density f in d dimensions, bounded and positive. Let \Psi(t) be a positive continuous function such that \|\Psi f^{\beta}\|_{\infty}<\infty for some 0<\beta<1/2. Under natural…

Probability · Mathematics 2016-09-07 Evarist Gine , Vladimir Koltchinskii , Joel Zinn

An algorithm for computing the nonlinearity of a Boolean function from its algebraic normal form (ANF) is proposed. By generalizing the expression of the weight of a Boolean function in terms of its ANF coefficients, a formulation of the…

Information Theory · Computer Science 2013-05-07 Çağdaş Çalık

We consider a $\varphi$-rigidity property for divergence-free vector fields in the Euclidean $n$-space, where $\varphi(t)$ is a non-negative convex function vanishing only at $t=0$. We show that this property is always satisfied in…

Analysis of PDEs · Mathematics 2022-03-01 Gian Paolo Leonardi , Giorgio Saracco

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

Optimization and Control · Mathematics 2010-06-10 Adrian S. Lewis , C. H. Jeffrey Pang

We investigate the algebraic genericity of various families of continuous functions exhibiting extreme irregularity, focusing on fractal dimensions, H\"older regularity, and fractional differentiability. Our first main result shows that for…

Functional Analysis · Mathematics 2026-02-20 Céline Esser , Saeid Maghsoudi , Daniel L. Rodríguez-Vidanes , Juan. B. Seoane-Sepúlveda

The steepness property is a local geometric transversality condition on the gradient of a $C^2$-function which is fundamental in order to ensure the stability of sufficiently-regular nearly-integrable Hamiltonian systems over long…

Algebraic Geometry · Mathematics 2024-02-19 Santiago Barbieri

Any compact body in ${\mathbb R}^N$ with smooth boundary defines a two-valued function on the space of affine hyperplanes: the volumes of two parts into which these hyperplanes cut the body. This function is never algebraic if $N$ is even…

Classical Analysis and ODEs · Mathematics 2019-02-21 Victor A. Vassiliev

We characterize the model spaces $K_\Theta$ in which functions with smooth boundary extensions are dense. It is shown that such approximations are possible if and only if the singular measure associated to the singular inner factor of…

Functional Analysis · Mathematics 2021-06-18 Adem Limani , Bartosz Malman

The algebraic degree is an important parameter of Boolean functions used in cryptography. When a function in a large number of variables is not given explicitly in algebraic normal form, it might not be feasible to compute its degree.…

Cryptography and Security · Computer Science 2023-06-22 Ana Salagean , Percy Reyes-Paredes

Functionality ($\mathrm{fun}$) is a graph parameter that generalizes graph degeneracy defined by Alecu et al. [JCTB, 2021]. They research the relation of functionality to many other graphs parameters (tree-width, clique-width, VC-dimension,…

Combinatorics · Mathematics 2025-06-02 Pavel Dvořák , Lukáš Folwarczný , Michal Opler , Pavel Pudlák , Robert Šámal , Tung Anh Vu