English
Related papers

Related papers: Essential arity gap of Boolean functions

200 papers

We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power…

Number Theory · Mathematics 2020-07-09 Kaisa Matomäki , Maksym Radziwiłł

We use M\"obius inversion and the Bernoulli polynomials to prove inequalities between the logarithmic summatory function of the M\"obius function and weighted averages of its ordinary summatory function.

Number Theory · Mathematics 2012-09-18 Michel Balazard

We introduce a simply stated conjecture regarding the maximum mutual information a Boolean function can reveal about noisy inputs. Specifically, let $X^n$ be i.i.d. Bernoulli(1/2), and let $Y^n$ be the result of passing $X^n$ through a…

Information Theory · Computer Science 2013-07-16 Gowtham R. Kumar , Thomas A. Courtade

According to generalized Mellin derivative (Kargin), we introduce a new family of polynomials called higher order generalized geometric polynomials. We obtain some properties of them.We discuss their connections to degenerate Bernoulli and…

Classical Analysis and ODEs · Mathematics 2019-08-01 Levent Kargin , Bayram Çekim

It is known that if $f\colon {\mathbb R}^2 \to {\mathbb R}$ is a polynomial in each variable, then $f$ is a polynomial. We present generalizations of this fact, when ${\mathbb R}^2$ is replaced by $G\times H$, where $G$ and $H$ are…

General Topology · Mathematics 2021-05-26 Gergely Kiss , Miklós Laczkovich

This paper is concerned at the minimization fundamental gap problem for a class of two-dimensional degenerate sub-elliptic operators. We establish existence results for weak solutions, Sobolev embedding theorem and spectral theory of…

Analysis of PDEs · Mathematics 2023-07-11 Hongli Sun , Donghui Yang , Xu Zhang

In this paper we give a new proof of the second order Boltzmann-Gibbs principle. The proof does not impose the knowledge on the spectral gap inequality for the underlying model and it relies on a proper decomposition of the antisymmetric…

Probability · Mathematics 2017-08-30 Patricia Gonçalves , Milton Jara , Marielle Simon

We aim to fill a gap in the proof of an inequality relating two exponents of uniform Diophantine approximation stated in a paper by Bugeaud. We succeed to verify the inequality in several instances, in particular for small dimension.…

Number Theory · Mathematics 2024-12-11 Johannes Schleischitz

A formulation is given for the spectral transformation of the generalized eigenvalue problem through the decomposition of the second-order differential operators. This allows us to construct some Laurent biorthogonal polynomial systems with…

Classical Analysis and ODEs · Mathematics 2022-12-26 Yu Luo , Satoshi Tsujimoto

Proving super-polynomial lower bounds on the size of proofs of unsatisfiability of Boolean formulas using resolution over parities is an outstanding problem that has received a lot of attention after its introduction by Raz and Tzamaret…

Computational Complexity · Computer Science 2024-02-26 Sreejata Kishor Bhattacharya , Arkadev Chattopadhyay , Pavel Dvořák

Boole polynomials play an important role in the area of number theory, algebra and umbral calculus. In this paper, we investigate some properties of Boole polynomials and consider Witt-type formulas for the Boole numbers and polynomials.…

Number Theory · Mathematics 2013-10-31 Dae San Kim , Taekyun Kim

We construct new examples of exceptional Hahn and Jacobi polynomials. Exceptional polynomials are orthogonal polynomials with respect to a measure which are also eigenfunctions of a second order difference or differential operator. The most…

Classical Analysis and ODEs · Mathematics 2021-04-06 Antonio J. Durán

We calculate the second order derivatives of the Ronkin function in the case of an affine linear polynomial in three variables and give an expression of them in terms of complete elliptic integrals and hypergeometric functions. This gives a…

Complex Variables · Mathematics 2013-06-27 Johannes Lundqvist

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

Information Theory · Computer Science 2014-04-11 E. Bellini , I. Simonetti , M. Sala

We write spectral decomposition of the hypergeometric differential operator on the contour $Re z=1/2$ (multiplicity of spectrum is 2). As a result, we obtain an integral transform that differs from the Jacobi (or Olevsky) transform. We also…

Classical Analysis and ODEs · Mathematics 2012-11-27 Neretin Yu. A

The theorem states that: Every Boolean function can be $\epsilon -approximated$ by a Disjunctive Normal Form (DNF) of size $O_{\epsilon}(2^{n}/\log{n})$. This paper will demonstrate this theorem in detail by showing how this theorem is…

Computational Complexity · Computer Science 2020-05-13 Yunhao Yang , Andrew Tan

We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…

Data Structures and Algorithms · Computer Science 2014-02-11 Ferdinando Cicalese , Travis Gagie , Eduardo Laber , Martin Milanic

In the present paper, we were mainly concerned with obtaining estimates for the general Taylor-Maclaurin coefficients for functions in a certain general subclass of analytic bi-univalent functions. For this purpose, we used the Faber…

Complex Variables · Mathematics 2019-05-01 Ala Amourah

We prove a duality theorem the computation of certain Bellman functions is usually based on. As a byproduct, we obtain sharp results about the norms of monotonic rearrangements. The main novelty of our approach is a special class of…

Optimization and Control · Mathematics 2016-04-07 Dmitriy M. Stolyarov , Pavel B. Zatitskiy

We consider the problem of representing Boolean functions exactly by "sparse" linear combinations (over $\mathbb{R}$) of functions from some "simple" class ${\cal C}$. In particular, given ${\cal C}$ we are interested in finding…

Computational Complexity · Computer Science 2018-02-27 R. Ryan Williams
‹ Prev 1 3 4 5 6 7 10 Next ›