Related papers: Characterizations of o-polynomials by the Walsh tr…
The classical theory of symmetric functions has a central position in algebraic combinatorics, bridging aspects of representation theory, combinatorics, and enumerative geometry. More recently, this theory has been fruitfully extended to…
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…
The purpose of this paper is to find the characterization of the Sheffer polynomial sets satisfying the d-orthogonality conditions. The generating function form of these polynomial sets is given in Theorem 2.2. As applications of the…
Within the framework of mappings between affine spaces, the notion of $n$-th polarization of a function will lead to an intrinsic characterization of polynomial functions. We prove that the characteristic features of derivations, such as…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Much work has been devoted to bent functions in odd characteristic, but there still remains a gap between our knowledge of binary and nonbinary bent functions. In the first part of this paper, we attempt to partially bridge this gap by…
Bent functions are Boolean functions that are maximally nonlinear. They can be represented as bent squares, i.e., square matrices for which each row and each column is the Walsh spectrum of a Boolean function. Using this representation, it…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
This paper proves that the characteristic polynomial is a complete unitary invariant for pairs of projection matrices. Some special cases involving three or more projections are also considered.
Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown…
A novel polynomial expansion method of symmetric Boolean functions is described. The method is efficient for symmetric Boolean function with small set of valued numbers and has the linear complexity for elementary symmetric Boolean…
We study combinatorial properties of plateaued functions $F \colon \mathbb{F}_p^n \rightarrow \mathbb{F}_p^m$. All quadratic functions, bent functions and most known APN functions are plateaued, so many cryptographic primitives rely on…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Orthogonal polynomials with respect to a weight function defined on a wedge in the plane are studied. A basis of orthogonal polynomials is explicitly constructed for two large class of weight functions and the convergence of Fourier…
We generalize Block-G\"ottsche polynomials, originally defined for toric del Pezzo surfaces, to arbitrary surfaces. To do this, we show that these polynomials arise as special cases of BPS polynomials, defined for any surface $S$ as Laurent…
Orthogonal polynomials have very useful properties in the solution of mathematical problems, so recent years have seen a great deal in the field of approximation theory using orthogonal polynomials. In this paper, we characterize the…