Related papers: Algebraic Methods in Difference Sets and Bent Func…
Let $t\geq2$ and $k\geq1$ be integers. Let $H_{k}(z)$ with $\left\vert z\right\vert <1$ be the limit of a certain subsequence of the Stern polynomials introduced by Dilcher and Eriksen. We use Mahler's method to prove the algebraic…
In the present paper, by extending some fractional calculus to the framework of Cliffors analysis, new classes of wavelet functions are presented. Firstly, some classes of monogenic polynomials are provided based on 2-parameters weight…
For the family of polynomials in one variable $P:=x^n+a_1x^{n-1}+\cdots +a_n$ we ask the questions at which points its discriminant set can be considered as the graph of a function of all coefficients $a_j$ but one and how its subset of…
We define the pivotal set of a Boolean function and we prove a fundamental inequality on its expected size, when the inputs are independent random coins of parameter~$p$. We give two complete proofs of this inequality. Along the way, we…
The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in…
The Hilbert class polynomial has as roots the j-invariants of elliptic curves whose endomorphism ring is a given imaginary quadratic order. It can be used to compute elliptic curves over finite fields with a prescribed number of points.…
We introduce an elementary method to study the border rank of polynomials and tensors, analogous to the apolarity lemma. This can be used to describe the border rank of all cases uniformly, including those very special ones that resisted a…
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…
This work is a study of polynomial compositions having a fixed number of terms. We outline a recursive method to describe these characterizations, give some particular results and discuss the general case. In the final sections, some…
For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…
The nonlinearity of a Boolean function is a key property in deciding its suitability for cryptographic purposes, e.g. as a combining function in stream ciphers, and so the nonlinearity computation is an important problem for applications.…
This preprint is dedicated to a self contained simple proof of the classical criteria for representability of algebraic functions of several complex variables by radicals. It also contains a criteria for representability of algebroidal…
In 1888, Hilbert described how to find real polynomials in more than one variable which take only non-negative values but are not a sum of squares of polynomials. His construction was so restrictive that no explicit examples appeared until…
In this note, we provide bijective proofs of some identities involving the Bell number, as previously requested. Our arguments may be extended to yield a generalization in terms of complete Bell polynomials. We also provide a further…
We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
In this paper, we propose a new construction of quadratic bent functions in polynomial forms. Right Euclid algorithm in skew-polynomial rings over finite fields of characteristic 2 is applied in the proof.
In this paper we characterize (octal) bent generalized Boolean functions defined on $\BBZ_2^n$ with values in $\BBZ_8$. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd.
The method of brackets is a method for the evaluation of definite integrals based on a small number of rules. This is employed here for the evaluation of Mellin-Barnes integral. The fundamental idea is to transform these integral…
We classify the Hilbert functions of bigraded algebras in $k[x_1, x_2, y_1, y_2]$ introducing a numerical function called Ferrers function.