English
Related papers

Related papers: Block Sensitivity of Minterm-Transitive Functions

200 papers

The model of relative-error property testing of Boolean functions has been the subject of significant recent research effort [CDH+24][CPPS25a][CPPS25b] In this paper we consider the problem of relative-error testing an unknown and arbitrary…

Computational Complexity · Computer Science 2025-10-27 Xi Chen , Diptaksho Palit , Kabir Peshawaria , William Pires , Rocco A. Servedio , Yiding Zhang

A subshift with linear block complexity has at most countably many ergodic measures, and we continue of the study of the relation between such complexity and the invariant measures. By constructing minimal subshifts whose block complexity…

Dynamical Systems · Mathematics 2019-02-26 Van Cyr , Bryna Kra

The threshold degree of a Boolean function f:{0,1}^n->{-1,+1} is the least degree of a real polynomial p such that f(x)=sgn p(x). We construct two halfspaces on {0,1}^n whose intersection has threshold degree Theta(sqrt n), an exponential…

Computational Complexity · Computer Science 2016-09-08 Alexander A. Sherstov

The paper addresses the tolerance approach to the sensitivity analysis of optimal solutions to the nonlinear optimization problem of the form $$\mbox{$\bigoplus\limits_{y\in S}C(y)\to\min$\quad over\quad $S\in\mathcal{S}$,}$$ where…

Functional Analysis · Mathematics 2016-01-28 Vyacheslav V. Chistyakov , Panos M. Pardalos

Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…

Computational Complexity · Computer Science 2021-07-08 Srikanth Srinivasan , S. Venkitesh

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Logic in Computer Science · Computer Science 2013-03-15 Ranjeet Kumar Rout , Pabitra Pal Choudhury , Sudhakar Sahoo

Dillon-like Boolean functions are known, in the literature, to be those trace polynomial functions from $\mathbb{F}_{2^{2n}}$ to $\mathbb{F}_{2}$, with all the exponents being multiples of $2^n-1$ often called Dillon-like exponents. This…

Discrete Mathematics · Computer Science 2024-11-26 Ziran Tu , Sihem Mesnager , Xiangyong Zeng , Nian Li , Yupeng Jiang , Yanan Deng

This paper discusses the theory and application of learning Boolean functions that are concentrated in the Fourier domain. We first estimate the VC dimension of this function class in order to establish a small sample complexity of learning…

Machine Learning · Computer Science 2016-01-20 Dustin G. Mixon , Jesse Peterson

A treatment is given of the orbit dynamics for linear unstable motion that allows for the zeros in the beta function and makes no assumptions about the realness of the betatron and phase functions. The phase shift per turn is shown to be…

acc-phys · Physics 2008-02-03 G. Parzen

Let $\Om$ be a Borel subset of $S^\Bbb N$ where $S$ is countable. A measure is called exchangeable on $\Om$, if it is supported on $\Om$ and is invariant under every Borel automorphism of $\Om$ which permutes at most finitely many…

Dynamical Systems · Mathematics 2015-06-26 J. Aaronson , H. Nakada , O. Sarig

We consider the problem of testing whether a Boolean function has Fourier degree $\leq k$ or it is $\epsilon$-far from any Boolean function with Fourier degree $\leq k$. We improve the known lower bound of $\Omega(k)$ \cite{BBM11,CGM10}, to…

Computational Complexity · Computer Science 2013-08-27 Pooya Hatami

In dimension $D\leq 2$ the low temperature behavior of systems enjoying a continuous symmetry is dominated by super-instantons: classical configurations of arbitrarily low energy. Perturbation theory in the background of a super-instanton…

High Energy Physics - Lattice · Physics 2009-10-22 A. Patrascioiu , E. Seiler

If $f(x,y)$ is a real function satisfying $y>0$ and $\sum_{r=0}^{n-1}f(x+ry,ny)=f(x,y)$ for $n=1,2,3,\ldots$, we say that $f(x,y)$ is an invariant function. Many special functions including Bernoulli polynomials, Gamma function and Hurwitz…

Classical Analysis and ODEs · Mathematics 2022-09-30 Zhi-Hong Sun

We prove a result on the fractional Sobolev regularity of composition of paths of low fractional Sobolev regularity with functions of bounded variation. The result relies on the notion of variability, proposed by us in the previous article…

Probability · Mathematics 2022-06-20 Michael Hinz , Jonas M. Tölle , Lauri Viitasaari

We describe a new construction of Boolean functions. A specific instance of our construction provides a 30-variable Boolean function having min-entropy/influence ratio to be $128/45 \approx 2.8444$ which is presently the highest known value…

Computational Complexity · Computer Science 2024-01-19 Aniruddha Biswas , Palash Sarkar

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

Discrete Mathematics · Computer Science 2020-07-07 Erhan Oztop , Minoru Asada

The SU(3) beta function is computed from Wilson loops to 20th order numerical stochastic perturbation theory. An attempt is made to include massless fermions, whose contribution is known analytically to 4th order. The question whether the…

High Energy Physics - Lattice · Physics 2015-06-17 R. Horsley , H. Perlt , P. E. L. Rakow , G. Schierholz , A. Schiller

We explore the sensitivity of the frequencies of low-degree solar p-modes to near-surface magnetic flux on different spatial scales and strengths, specifically to active regions with strong magnetic fields and ephemeral regions with weak…

The present work is concerned with the eqiucontinuity and sensitivity of iterated function systems (IFSs). Here, we consider more general case of IFSs, i.e. the IFSs generated by a family of relations. We generalize the concepts of…

Dynamical Systems · Mathematics 2019-05-21 F. H. Ghane , E. Rezaali , A. Sarizadeh

We present the Trust Region Adversarial Functional Subdifferential (TRAFS) algorithm for constrained optimization of nonsmooth convex Lipschitz functions. Unlike previous methods that assume a subgradient oracle model, we work with the…

Optimization and Control · Mathematics 2024-01-30 Kai Jia , Martin Rinard