Related papers: How to refine polynomial functions
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
Discrete analogs of the index transforms, involving Bessel and the modified Bessel functions are introduced and investigated. The corresponding inversion theorems for suitable classes of functions and sequences are established.
Many mathematicians have been studying various degenerate versions of special polynomials and numbers in some arithmetic and combinatorial aspects. Our main focus here is a new type of degenerate poly-Euler polynomials and numbers. This…
The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…
Image enhancement is a technique that frequently utilized in digital image processing. In recent years, the popularity of learning-based techniques for enhancing the aesthetic performance of photographs has increased. However, the majority…
We derive relations between geometric means of the Fourier moduli of a refinable distribution and of a related polynomial. We use Pisot-Vijayaraghavan numbers to construct families of one dimension quasilattices and multiresolution analyses…
There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…
It is shown that any convolution operator in the time domain can be represented exactly as a multiplication operator in the time-scale (wavelet) domain. The Mellin transform gives a one-to-one correspondence between frequency filters…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…
In continuous-time wavelet analysis, most wavelet present some kind of symmetry. Based on the Fourier and Hartley transform kernels, a new wavelet multiresolution analysis is proposed. This approach is based on a pair of orthogonal wavelet…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
The use of operational methods of different nature is shown to be a fairly powerful tool to study different problems regarding the theory of Legendre and Legendre-like polynomials. We show how the use of the well known integral…
In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…
This contribution introduces the idea of refinement patterns for the generation of optimal meshes in the context of the Finite Element Method. The main idea is to generate a library of possible patterns on which elements can be refined and…
We investigate refinement in the context of choreographies. We introduce refinable global choreographies allowing for the underspecification of protocols, whose interactions can be refined into actual protocols. Arbitrary refinements may…
Cyclotomic polylogarithms are reviewed and new results concerning the special constants that occur are presented. This also allows some comments on previous literature results using PSLQ.
We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…
We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear…
In this note functions that transform open segments of a linear space into open segments of another linear space are studied and characterized. Assuming that the range is non-collinear, it is proved that such a map can always be expressed…
We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…