Related papers: Kunchenko's Polynomials for Template Matching
We propose a novel measure for template matching named Deformable Diversity Similarity -- based on the diversity of feature matches between a target image window and the template. We rely on both local appearance and geometric information…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
We consider the problem of estimating the multiplicity of a polynomial when restricted to the smooth analytic trajectory of a (possibly singular) polynomial vector field at a given point or points, under an assumption known as the…
New modifications of the methods for simultaneous extraction of all roots of polynomials over an arbitrary Chebyshev system are elaborated. A cubic convergence of iterations is proved. The method presented is a generalisation of the…
We consider the problem of estimating high-dimensional covariance matrices of $K$-populations or classes in the setting where the sample sizes are comparable to the data dimension. We propose estimating each class covariance matrix as a…
By using the squared slack variables technique, we demonstrate that the solution set of a general polynomial complementarity problem is the image, under a specific projection, of the set of real zeroes of a system of polynomials. This paper…
This article presents a model which is capable of learning and abstracting new concepts based on comparing observations and finding the resemblance between the observations. In the model, the new observations are compared with the templates…
In this article, a new approach based on linear algebra is adopted to study a hybrid Sheffer polynomial sequences. The recurrence relations and differential equation for these polynomials are derived by using the properties and…
An integral formula for the solutions of Knizhnik-Zamolodchikov (KZ) equation with values in an arbitrary irreducible representation of the symmetric group S_N is presented for integer values of the parameter. The corresponding integrals…
Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…
Prototypal analysis is introduced to overcome two shortcomings of archetypal analysis: its sensitivity to outliers and its non-locality, which reduces its applicability as a learning tool. Same as archetypal analysis, prototypal analysis…
We obtain in closed form averages of polynomials, taken over hermitian matrices with the Gaussian measure involved in the Kontsevich integral, and prove a conjecture of Witten enabling one to express analogous averages with the full (cubic…
We introduce the Z-polynomial of a matroid, which we define in terms of the Kazhdan-Lusztig polynomial. We then exploit a symmetry of the Z-polynomial to derive a new recursion for Kazhdan-Lusztig coefficients. We solve this recursion,…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
We prove a formula for the multidegrees of a rational map defined by generalized monomials on a projective variety, in terms of integrals over an associated Newton region. This formula leads to an expression of the multidegrees as volumes…
We present correspondences induced by some classical mappings between measures on an interval and measures on the unit circle. More precisely, we link their sequences of orthogonal polynomial and their recursion coefficients. We also deduce…
We present multiresidue formulae for partial sums in the basis of link patterns of the polynomial solution to the level 1 U_q(\hat sl_2) quantum Knizhnik--Zamolodchikov equation at generic values of the quantum parameter q. These allow for…
We construct double Grothendieck polynomials of classical types which are essentially equivalent to but simpler than the polynomials defined by A.N.Kirillov in arXiv:1504.01469 and identify them with the polynomials defined by T.Ikeda and…
The use of patterns in predictive models is a topic that has received a lot of attention in recent years. Pattern mining can help to obtain models for structured domains, such as graphs and sequences, and has been proposed as a means to…
We compute the uniform probability that finitely many polynomials over a finite field are pairwise coprime and compare the result with the formula one gets using the natural density as probability measure. It will turn out that the formulas…