Related papers: Characterizations of o-polynomials by the Walsh tr…
One of basic difficulties of machine learning is handling unknown rotations of objects, for example in image recognition. A related problem is evaluation of similarity of shapes, for example of two chemical molecules, for which direct…
We calculate the autocorrelation functions (or shifted moments) of the characteristic polynomials of matrices drawn uniformly with respect to Haar measure from the groups U(N), O(2N) and USp(2N). In each case the result can be expressed in…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
We design new polynomials for representing threshold functions in three different regimes: probabilistic polynomials of low degree, which need far less randomness than previous constructions, polynomial threshold functions (PTFs) with…
Let R and S be two irreducible root systems spanning the same vector space and having the same Weyl group W, such that S (but not necessarily R) is reduced. For each such pair (R,S) we construct a family of W-invariant orthogonal…
The structure of orthogonal polynomials on $\mathbb{R}^{2}$ with the weight function $| x_{1}^{2}-x_{2}^{2}|^{2k_{0}}| x_{1}x_{2}|^{2k_{1}}e^{-(x_{1}^{2}+x_{2}^{2})/2}$ is based on the Dunkl operators of type $B_{2}$. This refers to the…
In this paper, we will discuss the notion of almost orthogonality in a functional sequence.Especially, we will define a few sequences of almost orthogonal polynomials which can be used successfully for modeling of electronic systems which…
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…
Polynomial spaces associated to a convex body $C$ in $({\bf R}^+)^d$ have been the object of recent studies. In this work, we consider polynomial spaces associated to non-convex $C$. We develop some basic pluripotential theory including…
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.
The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…
Differential properties for orthogonal polynomials in several variables are studied. We consider multivariate orthogonal polynomials whose gradients satisfy some quasi--orthogonality conditions. We obtain several characterizations for these…
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…
A new method of composition orthogonality is introduced. It is applied to generate new sequences of orthogonal polynomials and functions. In particular, classical orthogonal polynomials are interpreted in the sense of composition…
In this note, the polar decomposition of binary fields of even extension degree is used to reduce the evaluation of the Walsh transform of binomial Boolean functions to that of Gauss sums. In the case of extensions of degree four times an…
We define the spaces of Schwartz functions, tempered functions and tempered distributions on manifolds definable in polynomially bounded o-minimal structures. We show that all the classical properties that these spaces have in the Nash…
Studying degenerate versions of various special polynomials have become an active area of research and yielded many interesting arithmetic and combinatorial results. Here we introduce a degenerate version of polylogarithm function, called…
The multivariate quantum $q$-Krawtchouk polynomials are shown to arise as matrix elements of "$q$-rotations" acting on the state vectors of many $q$-oscillators. The focus is put on the two-variable case. The algebraic interpretation is…
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the…
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…