English
Related papers

Related papers: Essential arity gap of Boolean functions

200 papers

Let A and B be arbitrary sets with at least two elements. The arity gap of a function f: A^n \to B is the minimum decrease in its essential arity when essential arguments of f are identified. In this paper we study the arity gap of…

Rings and Algebras · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen

The authors' previous results on the arity gap of functions of several variables are refined by considering polynomial functions over arbitrary fields. We explicitly describe the polynomial functions with arity gap at least 3, as well as…

Rings and Algebras · Mathematics 2013-06-05 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

We study the arity gap of functions of several variables defined on an arbitrary set A and valued in another set B. The arity gap of such a function is the minimum decrease in the number of essential variables when variables are identified.…

Combinatorics · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

The aim of this paper is to classify order-preserving functions according to their arity gap. Noteworthy examples of order-preserving functions are so-called aggregation functions. We first explicitly classify the Lov\'asz extensions of…

Rings and Algebras · Mathematics 2016-11-22 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

Given an $n$-ary $k-$valued function $f$, $gap(f)$ denotes the essential arity gap of $f$ which is the minimal number of essential variables in $f$ which become fictive when identifying any two distinct essential variables in $f$. In the…

Discrete Mathematics · Computer Science 2013-02-08 Sl. Shtrakov , J. Koppitz

We generalize certain totient functions using elementary symmetric polynomials and derive explicit product forms for the totient functions involving the second elementary symmetric sum. This work follows from the work of Toth [The Ramanujan…

Number Theory · Mathematics 2026-05-21 Udvas Acharjee , N. Uday Kiran

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

Computational Complexity · Computer Science 2025-04-01 Stepan Margaryan

Given an $n$-ary $k-$valued function $f$, $gap(f)$ denotes the minimal number of essential variables in $f$ which become fictive when identifying any two distinct essential variables in $f$. We particularly solve a problem concerning the…

Discrete Mathematics · Computer Science 2010-03-05 Slavcho Shtrakov , Joerg Koppitz

This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…

Computational Complexity · Computer Science 2023-11-07 Stepan G. Margaryan

Boolean calculus has been studied extensively in the past in the context of switching circuits, error-correcting codes etc. This work generalizes several approaches to defining a differential calculus for Boolean functions. A unified theory…

Rings and Algebras · Mathematics 2020-02-06 Sriram Nagaraj

We show that every finite Boolean combination of polynomial equalities and inequalities in C^n admits two uniform normal forms: an $\exists\forall$ form and a $\forall\exists$ form, each using a single polynomial equation. Both forms use…

Logic · Mathematics 2025-12-24 Matthew Frank

Abelian groups are classified by the existence of certain additive decompositions of group-valued functions of several variables with arity gap 2.

Combinatorics · Mathematics 2013-03-29 Miguel Couceiro , Erkko Lehtonen , Tamás Waldhauser

In this article, we prove the existence of extremal functions in higher-order affine Sobolev inequalities. Proofs rely on concentration-compactness methods in spaces of integer or fractional regularity. The tools we use, available in spaces…

Functional Analysis · Mathematics 2026-04-02 Tristan Bullion-Gauthier

In this paper, we will consider $E$-type singularities which are Arnol'd type. We provide invariant conditions for a sufficiently smooth functions to have singularities of type $E_k (6\le k\le 8)$. We show the functions can be reduced to…

Analysis of PDEs · Mathematics 2025-05-21 Ibrokhimbek Akramov , Dildora Ikromova

We study the most-informative Boolean function conjecture using a differential equation approach. This leads to a formulation of a functional inequality on finite-dimensional random variables. We also develop a similar inequality in the…

Information Theory · Computer Science 2025-02-17 Zijie Chen , Amin Gohari , Chandra Nair

This paper is devoted to present new error bounds of regularized gap functions for polynomial variational inequalities with exponents explicitly determined by the dimension of the underlying space and the number/degree of the involved…

Optimization and Control · Mathematics 2020-03-24 Dinh Bui Van , Tien-Son Pham

A seminal result of Nisan and Szegedy (STOC, 1992) shows that for any total Boolean function, the degree of the real polynomial that computes the function, and the minimal degree of a real polynomial that point-wise approximates the…

Computational Complexity · Computer Science 2025-07-21 Arkadev Chattopadhyay , Yogesh Dahiya , Shachar Lovett

In the present paper we find optimal conditions separating the regular case from the one with Lavrentiev gap for the borderline case of double phase potencial and related general classes of integrands. We present new results on density of…

Analysis of PDEs · Mathematics 2020-10-08 Anna Kh. Balci , Mikhail Surnachev

We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…

Combinatorics · Mathematics 2008-04-18 Sergey Agievich

It was proved by Elkik that, under some smoothness conditions, the Artin functions of systems of polynomials over a Henselian pair are bounded above by linear functions. This paper gives a stronger form of this result for the class of…

Commutative Algebra · Mathematics 2009-01-19 Trung T. Dinh
‹ Prev 1 2 3 10 Next ›