Related papers: From H\"older Triangles to the Whole Plane
The (generalised) Mellin transforms of certain Chebyshev and Gegenbauer functions based upon the Chebyshev and Gegenbauer polynomials, have polynomial factors $p_n(s)$, whose zeros lie all on the `critical line' $\Re\,s=1/2$ or on the real…
In this article, we establish the existence of a norm-one projection from the space of all \emph{two-Lipschitz} operators onto the space of all bounded bilinear operators under certain conditions on the corresponding codomain spaces, using…
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
We address the question of the bi-Lipschitz local triviality of a complex polynomial function over a complex value. Our main result state that a non constant complex polynomial admits a locally bi-Lipschitz trivial value if and only if it…
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
A rational approximation by a ratio of polynomial functions is a flexible alternative to polynomial approximation. In particular, rational functions exhibit accurate estimations to nonsmooth and non- Lipschitz functions, where polynomial…
Orthogonal polynomials in two variables on cubic curves are considered, including the case of elliptic curves. For an integral with respect to an appropriate weight function defined on a cubic curve, an explicit basis of orthogonal…
In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…
We prove the classical result, which goes back at least to Fourier, that a polynomial with real coefficients has all zeros real and distinct if and only if the polynomial and also all of its nonconstant derivatives have only negative minima…
We use functions of a bicomplex variable to unify the existing constructions of harmonic morphisms from a 3-dimensional Euclidean or pseudo-Euclidean space to a Riemannian or Lorentzian surface. This is done by using the notion of…
In the paper we prove several inequalities involving two isotonic linear functionals. We consider inequalities for functions with variable bounds, for Lipschitz and H\" older type functions etc. These results give us an elegant method for…
The action of ring automorphisms of the polynomial ring in two variables over the real numbers on real plane curves is considered. The orbits containing degree-three polynomials are computed, with one representative per orbit being…
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…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
The theory of Toeplitz quantization presented in our previous paper is extended and further developed to include diverse and interesting non-commutative realizations of the classical Euclidean plane. This is done using Hilbert spaces of…
We study a generalization of the classical correspondence between homogeneous quadratic polynomials, quadratic forms, and symmetric/alternating bilinear forms to forms in $n$ variables. The main tool is combinatorial polarization, and the…
We derive the Hasse principle and weak approximation for pencils of certain varieties in the spirit of work by Colliot-Th\'el\`ene,Sansuc and Harpaz-Skorobogatov-Wittenberg. Our varieties are defined through polynomials in many variables…
We show that a function $f : X \to \mathbb R$ defined on a closed uniformly polynomially cuspidal set $X$ in $\mathbb R^n$ is real analytic if and only if $f$ is smooth and all its composites with germs of polynomial curves in $X$ are real…
We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…
We deploy numerical semidefinite programming and conversion to exact rational inequalities to certify that for a positive semidefinite input polynomial or rational function, any representation as a fraction of sums-of-squares of polynomials…