We consider the problem of exact identification for read-once functions over arbitrary Boolean bases. We introduce a new type of queries (subcube identity ones), discuss its connection to previously known ones, and study the complexity of the problem in question. Besides these new queries, learning algorithms are allowed to use classic membership ones. We present a technique of modeling an equi...

This work is concerned with the development of inverse-type inequalities for piecewise polynomial functions and, in particular, functions belonging to hp-finite element spaces. The cases of positive and negative Sobolev norms are considered for both continuous and discontinuous finite element functions.The inequalities are explicit both in the local polynomial degree and the local mesh size.The...

The common zeros of two bivariate functions can be computed by finding the common zeros of their polynomial interpolants expressed in a tensor Chebyshev basis. From here we develop a bivariate rootfinding algorithm based on the hidden variable resultant method and Bézout matrices with polynomial entries. Using techniques including domain subdivision, Bézoutian regularization and local refinemen...

Sparse interpolation refers to the exact recovery of a function as short linear combination basis functions from limited number evaluations. For multivariate functions, case monomial is well studied, now exponential functions. Beyond Chebyshev polynomial obtained tensor products univariate polynomials, theory root systems allows define variety generalized polynomials that have connections topic...

We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1}   A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We    derive a priory estimates  for the sums of the rootsof the considered system andfor the counting function of  roots.