Related papers: Algebraic Methods in Difference Sets and Bent Func…
We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…
Let S be a set of states of a physical system and p(s) be the probability of the occurrence of an event when the system is in state s. A function p from S to [0,1] is called a numerical event or alternatively an S-probability. If a set…
We establish a new perturbation theory for orthogonal polynomials using a Riemann--Hilbert approach and consider applications in numerical linear algebra and random matrix theory. This new approach shows that the orthogonal polynomials with…
In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…
Semi-bent Boolean functions are interesting from a cryptographic standpoint, since they possess several desirable properties such as having a low and flat Walsh spectrum, which is useful to resist linear cryptanalysis. In this paper, we…
Given any square matrix or a bounded operator $A$ in a Hilbert space such that $p(A)$ is normal (or similar to normal), we construct a Banach algebra, depending on the polynomial $p$, for which a simple functional calculus holds. When the…
A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…
Partial multivariate Bell polynomials have been defined by E.T. Bell in 1934. These polynomials have numerous applications in Combinatorics, Analysis, Algebra, Probabilities, etc. Many of the formulae on Bell polynomials involve…
Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…
The number of $n$-ary bent functions is less than $2^{3\cdot2^{n-3}(1+o(1))}$ as $n$ is even and $n\rightarrow\infty$. Keywords: Boolean function, bent function, upper bound
In this paper we generalize the partial spread class and completely describe it for generalized Boolean functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$. Explicitly, we describe gbent functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$, which can be…
There are several versions of Bell's inequalities, proved in different contexts, using different sets of assumptions. The discussions of their experimental violation often disregard some required assumptions and use loose formulations of…
This paper aims to construct a new family of numbers and polynomials which are related to the Bell numbers and polynomials by means of the confluent hypergeometric function. We give various properties of these numbers and polynomials…
Abstract characterizations of Menger algebras of partial $n$-place functions defined on a set $A$ and closed under the set-theoretic difference functions treatment as subsets of the Cartesian product $A^{n+1}$ are given.
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…
Some properties of diagonal binomial coefficients were studied in respect to frequency of their units digits. An approach was formulated that led to use of difference tables to predict if certain units digits can appear in the values of…
We prove several theorems concerning the exceptional sets of Hilbert transform on the real line. In particular, it is proved that any null set is exceptional set for the Hibert transform of an indicator function. The paper also provides a…
In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…
It is known a method for converting a system of Boolean polynomial equations to a single Boolean polynomial equation with less variables. In this paper, we show a formula for systems of Boolean polynomial equations which is based on the…
We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…