Related papers: An evaluation algorithm for q-B\'ezier triangular …
In approximation theory, it is standard to approximate functions by polynomials expressed in the Chebyshev basis. Evaluating a polynomial $f$ of degree n given in the Chebyshev basis can be done in $O(n)$ arithmetic operations using the…
In this paper, we demonstrate that many of the computational tools for univariate orthogonal polynomials have analogues for a family of bivariate orthogonal polynomials on the triangle, including Clenshaw's algorithm and sparse…
Given a combinatorial triangulation of an $n$-gon, we study (a) the space of all possible drawings in the plane such the edges are straight line segments and the boundary has a fixed shape, and (b) the algebraic variety of possibilities for…
In this paper we classify and derive closed formulas for geometric elements of quadrics in rational B\'ezier triangular form (such as the center, the conic at infinity, the vertex and the axis of paraboloids and the principal planes), using…
A short intrinsic proof is given for the Bourgain-Brezis-Mironescu theorem with an extension for higher-order gradient forms. This argument illustrates the role of functional geometry and Fourier analysis for obtaining embedding estimates.…
We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…
By applying an integral representation for $q^{k^{2}}$ we systematically derive a large number of new Fourier and Mellin transform pairs and establish new integral representations for a variety of $q$-functions and polynomials that…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
It is known that B\'{e}zier curves and surfaces may have multiple representations by different control polygons. The polygons may have different number of control points and may even be disjoint. Up to our knowledge, Pekerman et al. (2005)…
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…
The Factorial Basis method, initially designed for quasi-triangular, shift-compatible factorial bases, provides solutions to linear recurrence equations in the form of definite-sums. This paper extends the Factorial Basis method to its…
We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…
We develop an algorithm for recursively constructing orthogonal multiplet bases for the color space of QCD, for any order of partons and any Nc. This recipe is then applied for explicitly constructing some of these bases. Using the bases, a…
A subclass of complex-valued close-to-convex harmonic functions that are univalent and sense-preserving in the open unit disc is investigated. The coefficient estimates, growth results, area theorem, boundary behavior, convolution and…
We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…
The notion of multivariate $P$- and $Q$-polynomial association scheme has been introduced recently, generalizing the well-known univariate case. Numerous examples of such association schemes have already been exhibited. In particular, it…
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a…
Let $\UT_n(q)$ denote the group of unipotent $n\times n$ upper triangular matrices over a field with $q$ elements. The degrees of the complex irreducible characters of $\UT_n(q)$ are precisely the integers $q^e$ with $0\leq e\leq \lfloor…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…