Related papers: Several new classes of Boolean functions with few …
The relationship between quantum physics and discrete mathematics is reviewed in this article. The Boolean functions unitary representation is considered. The relationship between Zhegalkin polynomial, which defines the algebraic normal…
This is the first installment in a series of papers devoted to examining certain aspects of the asymptotic value distribution and distribution of zeros manifested by members of a broad class of linear combinations of L-functions in the…
In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this construction, we give two classes of linear codes…
The main aim of this paper is to provide a unified approach to deriving identities for the Bernstein polynomials using a novel generating function. We derive various functional equations and differential equations using this generating…
We present a unified framework to study threshold functions for the existence of solutions to linear systems of equations in random sets which includes arithmetic progressions, sum-free sets, $B_{h}[g]$-sets and Hilbert cubes. In…
We prove that any function with real-valued coefficients, whose input is 4 binary variables and whose output is a real number, is perfectly equivalent to a quadratic function whose input is 5 binary variables and is minimized over the new…
In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…
The report studies the generation of ternary bent functions by permuting the circular Vilenkin_Chrestenson spectrum of a known bent function. We call this spectral invariant operations in the spectral domain, in analogy to the spectral…
In this note we revisit Almgren's theory of Q-valued functions, that are functions taking values in the space of unordered Q-tuples of points in R^n. In particular: 1) we give shorter versions of Almgren's proofs of the existence of…
In this article, we provide the first systematic analysis of bent functions $f$ on $\mathbb{F}_2^{n}$ in the Maiorana-McFarland class $\mathcal{MM}$ regarding the origin and cardinality of their $\mathcal{M}$-subspaces, i.e., vector…
Fourier analysis on the discrete hypercubes $\{-1,1\}^n$ has found numerous applications in learning theory. A recent breakthrough involves the use of a classical result from Fourier analysis, the Bohnenblust--Hille inequality, in the…
Arising from the factorizations of Dedekind zeta-functions of cubic fields, we obtain Artin $L$-functions of certain two-dimensional representations. In this paper, we study the value-distribution of such Artin $L$-functions for families of…
In the present paper the new multiplier transformations $\mathrm{{\mathcal{J}% }}_{p}^{\delta }(\lambda ,\mu ,l)$ $(\delta ,l\geq 0,\;\lambda \geq \mu \geq 0;\;p\in \mathrm{% }%\mathbb{N} )}$ of multivalent functions is defined. Making use…
In this paper, we first introduce the new class of multiple weights $A^\vc_{\vec{p}}$ which is larger than the class of multiple weights in \cite{LOPTG}. Then, using this class of weights, we study the weighted norm inequalities for certain…
Early in 1992, Deutsch-Jozsa algorithm computed a symmetric partial Boolean function with a single quantum query, and thus achieved the best separation between classical deterministic and exact quantum query complexity. Until recent years,…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…
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…
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…
We study a new class of functions that arise naturally in quaternionic analysis, we call them "quasi regular functions". Like the well-known quaternionic regular functions, these functions provide representations of the quaternionic…