Related papers: On the mixed monotonicity of polynomial functions
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…
This note mainly concerns the binomial power function, defined as $(1+x^q)^{r}$. We construct systems of polynomials related to non-local approximation, which allows us to establish the density results on $C[a,b]$, where $a,b\in\mathbb{R}$.…
Thom polynomials measure how global topology forces singularities. The power of Thom polynomials predestine them to be a useful tool not only in differential topology, but also in algebraic geometry (enumerative geometry, moduli spaces) and…
A function on a topological space is called unimodal if all of its super-level sets are contractible. A minimal unimodal decomposition of a function $f$ is the smallest number of unimodal functions that sum up to $f$. The problem of…
The classical Ritt's Theorems state several properties of univariate polynomial decomposition. In this paper we present new counterexamples to Ritt's first theorem, which states the equality of length of decomposition chains of a…
We consider a Nicholson's equation with multiple pairs of time-varying delays and nonlinear terms given by mixed monotone functions. Sufficient conditions for the permanence, local stability and global attractivity of its positive…
In the present work we show that the local generalized monotonicity of a lower semicontinuous set-valued operator on some certain type of dense sets ensures the global generalized monotonicity of that operator. We achieve this goal…
In this manuscript, we analyze the expansions of functions in orthogonal polynomials associated with a general weight function in a multidimensional setting. Such orthogonal polynomials can be obtained by Gram-Schmidt orthogonalization.…
In this paper, we consider mixed sums of generalized polygonal numbers. Specifically, we obtain a finiteness condition for universality of such sums; this means that it suffices to check representability of a finite subset of the positive…
In the paper, the authors introduce a matrix-parametrized generalization of the multinomial probability mass function that involves a ratio of several multivariate gamma functions. They show the logarithmic complete monotonicity of this…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
The density of polynomials in a weighted space of infinitely differentiable functions in a multidimensional real space is proved under minimal conditions on weight functions and on differences between weight functions. We apply this result…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
The approximation properties of the finite element method can often be substantially improved by choosing smooth high-order basis functions. It is extremely difficult to devise such basis functions for partitions consisting of arbitrarily…
This article offers a comprehensive treatment of polynomial functional regression, culminating in the establishment of a novel finite sample bound. This bound encompasses various aspects, including general smoothness conditions, capacity…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
Any homogeneous polynomial $P(x, y, z)$ of degree $d$, being restricted to a unit sphere $S^2$, admits essentially a unique representation of the form $\lambda_0 + \sum_{k = 1}^d \lambda_k [\prod_{j = 1}^k L_{kj}]$, where $L_{kj}$'s are…
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…
This work has a purpose to collect selected facts about the completely monotone (CM) functions that can be found in books and papers devoted to different areas of mathematics. We opted for lesser known ones, and for those which may help…
Generalized Macdonald polynomials (GMP) are eigenfunctions of specifically-deformed Ruijsenaars Hamiltonians and are built as triangular polylinear combinations of Macdonald polynomials. They are orthogonal with respect to a modified scalar…