Related papers: Characterizations of o-polynomials by the Walsh tr…
We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…
We determine a connection between the weight of a Boolean function and the total weight of its first-order derivatives. The relationship established is used to study some cryptographic properties of Boolean functions. We establish a…
We study the computational model of polygraphs. For that, we consider polygraphic programs, a subclass of these objects, as a formal description of first-order functional programs. We explain their semantics and prove that they form a…
We contribute to the knowledge of linear codes from special polynomials and functions, which have been studied intensively in the past few years. Such codes have several applications in secret sharing, authentication codes, association…
We discuss the problem of classifying Dembowski-Ostrom polynomials from the composition of reversed Dickson polynomials of arbitrary kind and monomials over finite fields of odd characteristic. Moreover, by using a variant of the Weil bound…
We develop potential theory including a Bernstein-Walsh type estimate for functions of the form $p(z)q(f(z))$ where $p,q$ are polynomials and $f$ is holomorphic. Such functions arise in the study of certain ensembles of probability measures…
A new class of distributional transformations is introduced, characterized by equations relating function weighted expectations of test functions on a given distribution to expectations of the transformed distribution on the test function's…
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…
The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…
We consider projections of points onto fundamental chambers of finite real reflection groups. Our main result shows that for groups of type $A_n$, $B_n$, and $D_n$, the coefficients of the characteristic polynomial of the reflection…
We introduce an algorithm of joint approximation of a function and its first derivative by alternative orthogonal polynomials on the interval [0,1].The algorithm exhibits properties of shape preserving approximation for the function. A weak…
After defining in detail the Lambert $W$-function branches, we give a large number of exact identities involving (infinite) symmetric functions of these branches, as well as geometrically convergent series for all the branches. In doing so,…
We study correlation functions of the characteristic polynomials in coupled matrix models based on the Schur polynomial expansion, which manifests their determinantal structure.
The notion of a KU-valued function on a set is introduced and related properties are investigated. Codes generated by KU-valued functions are established. Moreover, we will provide an algorithm which allows us to find a KU-algebra starting…
The symmetric group on 4 letters has the reflection group $D_{3}$ as an isomorphic image. This fact follows from the coincidence of the root systems $A_{3}$ and $D_{3}$. The isomorphism is used to construct an orthogonal basis of…
We survey three methods for proving that the characteristic polynomial of a finite lattice factors over the nonnegative integers and indicate how they have evolved recently. The first technique uses geometric ideas and is based on…
The fermionic, bosonic and supersymmetric variants of the colour-flavour transformation are derived for the orthogonal group. These transformations are then used to calculate the ensemble averages of characteristic polynomials of real…
Aichinger's equation is used to give simple proofs of several well-known characterizations of polynomial functions as solutions of certain functional equations. Concretely, we use that Aichinger's equation characterizes polynomial functions…
We study the orthogonal projection of homogeneous polynomials onto the space of homogeneous polyharmonic polynomials. To do this we derive the decomposition of homogeneous polynomials in terms of the Kelvin transform of derivatives of the…
Combinatorial $t$-designs have been an interesting topic in combinatorics for decades. It was recently reported that the image sets of a fixed size of certain special polynomials may constitute a $t$-design. Till now only a small amount of…