English
Related papers

Related papers: On APN functions and their derivatives

200 papers

We consider the construction of insurance premiums that are monotonically increasing with respect to a loading parameter. By introducing weight functions that are totally positive of higher order, we derive higher monotonicity properties of…

Classical Analysis and ODEs · Mathematics 2019-02-22 Donald Richards , Caroline Uhler

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

Computational Complexity · Computer Science 2020-10-23 Aniruddha Biswas , Palash Sarkar

We consider orthogonal polynomials on the unit circle associated with certain semi-classical weight functions. This means that the Pearson-type differential equations satisfied by these weight functions involve two polynomials of degree at…

Complex Variables · Mathematics 2023-10-13 Cleonice F. Bracciali , Karina S. Rampazzi , Luana L. Silva Ribeiro

We consider semiclassical orthogonal polynomials on the unit circle associated with a weight function that satisfy a Pearson-type differential equation involving two polynomials of degree at most three. Structure relations and difference…

Classical Analysis and ODEs · Mathematics 2025-06-05 Cleonice F. Bracciali , Karina S. Rampazzi , Luana L. Silva Ribeiro

A relationship between partial derivatives of the associated Legendre function of the first kind with respect to its degree, $[\partial P_{\nu}^{m}(z)/\partial\nu]_{\nu=n}$, and to its order, $[\partial P_{n}^{\mu}(z)/\partial\mu]_{\mu=m}$,…

Classical Analysis and ODEs · Mathematics 2009-10-26 Radoslaw Szmytkowski

We provide two sufficient and necessary conditions to characterize any $n$-bit partial Boolean function with exact quantum 1-query complexity. Using the first characterization, we present all $n$-bit partial Boolean functions that depend on…

Computational Complexity · Computer Science 2021-02-24 Guoliang Xu , Daowen Qiu

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

New methods for derivation of Bell polynomials of the second kind are presented. The methods are based on an ordinary generating function and its composita. The relation between a composita and a Bell polynomial is demonstrated. Main…

Combinatorics · Mathematics 2011-09-09 Vladimir Kruchinin

Functional equations satisfied by additive functions have a special interest not only in the theory of functional equations, but also in the theory of (commutative) algebra because the fundamental notions such as derivations and…

Classical Analysis and ODEs · Mathematics 2018-02-22 Eszter Gselmann , Gergely Kiss , Csaba Vincze

We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…

Weighted mean value identities over balls are considered for harmonic functions and their derivatives. Logarithmic and other weights are involved in these identities for functions. Some applications of weighted identities are presented.…

Analysis of PDEs · Mathematics 2023-02-14 Nikolay Kuznetsov

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

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

In this paper we explore a connection between certain Almost Perfect Nonlinear Functions (APN functions) and relative difference sets. In particular, we show that the image set of certain 2-to-1 APN functions is a relative difference set.…

Combinatorics · Mathematics 2026-03-12 Zeying Wang

In 1982, Cameron and Liebler investigated certain "special sets of lines" in PG(3,q), and gave several equivalent characterizations. Due to their interesting geometric and algebraic properties, these "Cameron-Liebler line classes" got much…

Combinatorics · Mathematics 2025-10-02 Michael Kiermaier , Jonathan Mannaert , Alfred Wassermann

We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set of rational-valued functions, which generalize constraints.…

Computational Complexity · Computer Science 2009-06-03 Andrei Bulatov , Martin Dyer , Leslie Ann Goldberg , Markus Jalsenius , David Richerby

This paper gives a dichotomy theorem for the complexity of computing the partition function of an instance of a weighted Boolean constraint satisfaction problem. The problem is parameterised by a finite set F of non-negative functions that…

Computational Complexity · Computer Science 2009-02-23 Martin Dyer , Leslie Ann Goldberg , Mark Jerrum

The derivative of the associated Legendre function of the first kind of integer degree with respect to its order, $\partial P_{n}^{\mu}(z)/\partial\mu$, is studied. After deriving and investigating general formulas for $\mu$ arbitrary…

Classical Analysis and ODEs · Mathematics 2008-03-28 Radoslaw Szmytkowski

A one to one correspondence between regular generalized bent functions from $\F_2^n$ to $\Z_{2^m},$ and $m-$tuples of Boolean bent functions is established. This correspondence maps self-dual (resp. anti-self-dual) generalized bent…

Information Theory · Computer Science 2016-11-22 Lin Sok , MinJia Shi , Patrick Solé

A new characterization of harmonic functions is obtained. It is based on quadrature identities involving mean values over annular domains and over concentric spheres lying within these domains or on their boundaries. The analogous result…

Analysis of PDEs · Mathematics 2023-04-04 Nikolay Kuznetsov