Related papers: Minimal cubature rules and Koornwinder polynomials
Motivated by recent work of Hanser and Mayers, we study two combinatorial puzzles arising from the theory of Kohnert polynomials. Such polynomials are defined as generating polynomials for certain collections of diagrams consisting of unit…
Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…
We introduce a new family of multiple orthogonal polynomials satisfying orthogonality conditions with respect to two weights $(w_1,w_2)$ on the positive real line, with $w_1(x)=x^\alpha e^{-x}$ the gamma density and $w_2(x) = x^\alpha…
In this paper we derive the bi-orthogonality relations, diagonal term evaluations and evaluation formulas for the non-symmetric Koornwinder polynomials. For the derivation we use certain representations of the (double) affine Hecke algebra…
A new algebraic cubature formula of degree $2n+1$ for the product Chebyshev measure in the $d$-cube with $\approx n^d/2^{d-1}$ nodes is established. The new formula is then applied to polynomial hyperinterpolation of degree $n$ in three…
We study a family of orthogonal polynomials which satisfy (apart from a 3-term recurrence relation) an eigenvalue equation involving a third order differential operator of Dunkl-type. The orthogonality measure of these polynomials consists…
In this paper, we present a new method for the analysis of piecewise dynamical systems that are similar to the Collatz conjecture in regard to certain properties of the commutator of their sub-functions. We use the fact that the commutator…
We prove two recent conjectures of Bourn and Erickson (2023) regarding the real-rootedness of a certain family of polynomials $N_n(t)$ as well as the sum of their coefficients. These polynomials arise as the numerators of generating…
We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles…
We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…
We explicitly characterize when the Milnor number at the origin of a polynomial or power series (over an algebraically closed field k of arbitrary characteristic) is the minimum of all polynomials with the same Newton diagram, which…
Given a polynomial system f associated with a simple multiple zero x of multiplicity {\mu}, we give a computable lower bound on the minimal distance between the simple multiple zero x and other zeros of f. If x is only given with limited…
The orthogonality relations of multivariate Krawtchouk polynomials are discussed. In case of two variables, the necessary and sufficient conditions of orthogonality is given by Gr\"unbaum and Rahman in [SIGMA 6 (2010), 090, 12 pages,…
The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…
The subject matter of this work is quadratic and cubic polynomial functions with integer coefficients;and all of whose roots are integers. The material of this work is directed primarily at educators,students,and teachers of…
In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…
We develop an effective version of Kronecker's Theorem on the splitting of polynomials, based on asymptotic arguments proposed by the Chudnovsky brothers, coming from Hermite-Pad\'e approximation. In conjunction with Honda's proof of the…
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient method which can avoid singularities and breakdowns in the…
We present a restricted variable generalization of Warning's Second Theorem (a result giving a lower bound on the number of solutions of a low degree polynomial system over a finite field, assuming one solution exists). This is analogous to…
We prove lower bounds of order $n\log n$ for both the problem to multiply polynomials of degree $n$, and to divide polynomials with remainder, in the model of bounded coefficient arithmetic circuits over the complex numbers. These lower…