Related papers: Quadratic Motion Polynomials With Irregular Factor…
The clustering properties of Jack polynomials are relevant in the theoretical study of the fractional Hall states. In this context, some factorization properties have been conjectured for the $(q,t)$-deformed problem involving Macdonald…
The monodromy group is an invariant for parameterized systems of polynomial equations that encodes structure of the solutions over the parameter space. Since the structure of real solutions over real parameter spaces are of interest in many…
The double-direction orthogonalization algorithm is applied to construct sequences of polynomials, which are orthogonal over the interval [0,1]with the weighting function 1. Functional and recurrent relations are derived for the sequences…
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These…
In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.
Let f be a generic polynomial mapping mapping from the plane to the plane. There are constructed quadratic forms whose signatures determine the number of positive and negative cusps of f.
We introduce the quadratic harness condition and show that integrable quadratic harnesses have orthogonal martingale polynomials with a three step recurrence that satisfies a q-commutation relation. This implies that quadratic harnesses are…
We recall that diagonals of rational functions naturally occur in lattice statistical mechanics and enumerative combinatorics. We find that a seven-parameter rational function of three variables with a numerator equal to one (reciprocal of…
Spherically symmetric random walks in arbitrary dimension $D$ can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically…
We present explicit constructions of orthogonal polynomials inside quadratic bodies of revolution, including cones, hyperboloids, and paraboloids. We also construct orthogonal polynomials on the surface of quadratic surfaces of revolution,…
Commutative analogues of Clifford algebras are algebras defined in the same way as Clifford algebras except that their generators commute with each other, in contrast to Clifford algebras in which the generators anticommute. In this paper,…
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…
Polymatroids can be considered as "fractional matroid" where the rank function is not required to be integer valued. Many, but not every notion in matroid terminology translates naturally to polymatroids. Defining cyclic flats of a…
We present a generalization of multiple orthogonal polynomials of type I and type II, which we call multiple orthogonal polynomials of mixed type. Some basic properties are formulated, and a Riemann-Hilbert problem for the multiple…
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…
Polynomial functors are sums of covariant representable functors from the category of sets to itself. They have a robust theory with many applications -- from operads and opetopes to combinatorial species. In this paper, we define a…
We consider a superintegrable Hamiltonian system in a two-dimensional space with a scalar potential that allows one quadratic and one cubic integral of motion. We construct the most general associative cubic algebra and we present specific…
Loop invariants are properties of a program loop that hold before and after each iteration of the loop. They are often employed to verify programs and ensure that algorithms consistently produce correct results during execution.…
We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…
A polynomial transformation of the real plane $\Bbb R^2$ is a mapping $\Bbb R^2\to\Bbb R^2$ given by two polynomials of two variables. Such a transformation is called cubic if the degrees of its polynomials are not greater than three. It…