Related papers: How to refine polynomial functions
In this paper, we study polynomials of the form $f(x)=(x^n+x^{n-1}+...+1)^l$ for $l=1,2,3,4$ to generate a pattern titled "unique coefficient pattern". Namely, we analyze each unique coefficient patterns of $f(x)$ and generate functions…
We define refined invariants which "count" nodal curves in sufficiently ample linear systems on surfaces, conjecture that their generating function is multiplicative, and conjecture explicit formulas in the case of K3 and abelian surfaces.…
We study the topology of polynomial functions by deforming them generically. We explain how the non-conservation of the total ``quantity'' of singularity in the neighbourhood of infinity is related to the variation of topology in certain…
We consider the wavelet transform of a finite, rooted, node-ranked, $p$-way tree, focusing on the case of binary ($p = 2$) trees. We study a Haar wavelet transform on this tree. Wavelet transforms allow for multiresolution analysis through…
We introduce the concept of fractels for functions and discuss their analytic and algebraic properties. We also consider the representation of polynomials and analytic functions using fractels, and the consequences of these representations…
In this paper, we propose a new and simple approach to the approximation algorithms that are modified and improved from our published results. The computational and graphical examples are presented with the aid of Maple procedures.
This paper is devoted to the study of generalized differentiation properties of the infimal convolution. This class of functions covers a large spectrum of nonsmooth functions well known in the literature. The subdifferential formulas…
For a given symmetric refinable mask obeying the sum rule of order $n$, an explicit method is suggested for the construction of mutually symmetric almost frame-like wavelet system providing approximation order $n$. A transformation based on…
This is a short review of some recent results obtained by the author. These results are related the problem of obtaining polynomial identities (computational formulas) for some matrix functions by means of the known polarization theorem,…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
Modularity is the fundamental aspect of modern software engineering, however many advanced modularity techniques requires prospective technologies as part of development and operation process. In this paper, we present Refinable Function,…
The article is devoted to affine and wrap algebras over quaternions and octonions. Residues of functions of quaternion and octonion variables are studied. They are used for construction of such algebras. Their structure is investigated.
The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…
We study polynomial functors over locally cartesian closed categories. After setting up the basic theory, we show how polynomial functors assemble into a double category, in fact a framed bicategory. We show that the free monad on a…
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…
Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…
We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
We study polynomial functors in the incompressible category $\text{Ver}_4^+$, which can be viewed as super polynomial functors in characteristic 2. Concretely, we classify additive, exact and simple polynomial functors, and describe how…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…