Related papers: Monotone Boolean functions capture their primes
We study the multiplicative convolution for c-monotone independence. This convolution unifies the monotone, Boolean and orthogonal multiplicative convolutions. We characterize convolution semigroups for the c-monotone multiplicative…
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…
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality…
It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a…
A parallel method for computing Boolean expressions based on the properties of finite free Boolean algebras is presented. We also show how various finite combinatorial objects can be codded in the formalism of Boolean algebras and counted…
In this paper, we introduce a generalized notion of monotone property and prove some results regarding existence and uniqueness of multi-tupled fixed points for nonlinear contraction mappings satisfying monotone property in ordered complete…
To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task is much far…
We provide an algorithm for the construction of orthonormal multivariate polynomials that are symmetric with respect to the interchange of any two coordinates on the unit hypercube and are constrained to the hyperplane where the sum of the…
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p…
A recent heuristic argument based on basic concepts in spectral analysis showed that the twin prime conjecture and a few other related primes counting problems are valid. A rigorous version of the spectral method, and a proof for the…
Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
We investigate the construction of $\pm1$-valued completely multiplicative functions that take the value $+1$ at at most $k$ consecutive integers, which we call length-$k$ functions. We introduce a way to extend the length based on the idea…
Part-and-parcel of the study of "multiplicative number theory" is the study of the distribution of multiplicative functions in arithmetic progressions. Although appropriate analogies to the Bombieri-Vingradov Theorem have been proved for…
In the present article, we introduce a unified notion of multi-tupled fixed points and utilize the same to prove some existence and uniqueness unified multi-tupled fixed point theorems for Boyd-Wong type nonlinear contractions satisfying…
This paper studies the singularities of Cullen-regular functions of one quaternionic variable. The quaternionic Laurent series prove to be Cullen-regular. The singularities of Cullen-regular functions are thus classified as removable,…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
We introduce polynomial processes taking values in an arbitrary Banach space $B$ via their infinitesimal generator $L$ and the associated martingale problem. We obtain two representations of the (conditional) moments in terms of solutions…
A monotone Boolean (OR,AND) circuit computing a monotone Boolean function f is a read-k circuit if the polynomial produced (purely syntactically) by the arithmetic (+,x) version of the circuit has the property that for every prime implicant…
We compare quantum and classical machines designed for learning an N-bit Boolean function in order to address how a quantum system improves the machine learning behavior. The machines of the two types consist of the same number of…