中文
相关论文

相关论文: On the mixed monotonicity of polynomial functions

200 篇论文

We study the topology of polynomial functions by deforming them generically. We explain how the non-conservation of the total ``quantity'' of singularity in the neighbourhood of infinity is related to the variation of topology in certain…

代数几何 · 数学 2007-05-23 Dirk Siersma , Mihai Tibar

We shown that every continuous local functional on the space of finite convex functions on $\mathbb{R}^n$ is a valuation. This relation is used to establish a homogeneous decomposition for the class of polynomial local functionals as well…

泛函分析 · 数学 2025-12-18 Jonas Knoerr

We enhance the approximation capabilities of algebraic polynomials by composing them with homeomorphisms. This composition yields families of functions that remain dense in the space of continuous functions, while enabling more accurate…

数值分析 · 数学 2025-12-17 Álvaro Fernández Corral , Yahya Saleh

It is a classical result in rational approximation theory that certain non-smooth or singular functions, such as $|x|$ and $x^{1/p}$, can be efficiently approximated using rational functions with root-exponential convergence in terms of…

数值分析 · 数学 2025-06-27 Kingsley Yeon , Steven B. Damelin

In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…

泛函分析 · 数学 2014-04-02 J. M. Almira , L. Székelyhidi

We show that tools from circuit complexity can be used to study decompositions of global constraints. In particular, we study decompositions of global constraints into conjunctive normal form with the property that unit propagation on the…

人工智能 · 计算机科学 2009-05-26 Christian Bessiere , George Katsirelos , Nina Narodytska , Toby Walsh

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

环与代数 · 数学 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…

代数几何 · 数学 2019-03-04 Dima Grigoriev

Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…

数值分析 · 数学 2019-01-31 Konstantin Usevich , Philippe Dreesen , Mariya Ishteva

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

数论 · 数学 2015-03-19 Dijana Kreso , Robert F. Tichy

Submodular set functions are undoubtedly among the most important building blocks of combinatorial optimization. Somewhat surprisingly, continuous counterparts of such functions have also appeared in an analytic line of research where they…

We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…

环与代数 · 数学 2014-06-10 Jean-Luc Marichal , Bruno Teheux

Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…

alg-geom · 数学 2015-06-30 Eduardo Cattani , Alicia Dickenstein , Bernd Sturmfels

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

组合数学 · 数学 2014-04-15 Xueliang Li , Yongtang Shi , Martin Trinks

We simplify the proof of some widely used theoretical theorems, extending their applicability, while correcting some erroneous results. We also generalize key results and present new results that contribute to the development of the theory.…

经典分析与常微分方程 · 数学 2025-10-02 V. E. Sándor Szabó

In this survey, we use (more or less) elementary means to establish the well-known result that for any given smooth multivariate function, the respective multivariate Bernstein polynomials converge to that function in all derivatives on…

经典分析与常微分方程 · 数学 2016-09-08 Adrian Fellhauer

This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…

概率论 · 数学 2016-08-04 Robert J. Vanderbei

In this paper we obtain several extensions to the quaternionic setting of some results concerning the approximation by polynomials of functions continuous on a compact set and holomorphic in its interior. The results include approximation…

复变函数 · 数学 2023-07-19 Sorin G. Gal , Irene Sabadini

The purpose of the paper is to provide a characterization of the error of the best polynomial approximation of composite functions in weighted spaces. Such a characterization is essential for the convergence analysis of numerical methods…

数值分析 · 数学 2023-08-14 Luisa Fermo , Concetta Laurita , Maria Grazia Russo

The analysis of observable phenomena (for instance, in biology or physics) allows the detection of dynamical behaviors and, conversely, starting from a desired behavior allows the design of objects exhibiting that behavior in engineering.…

离散数学 · 计算机科学 2026-04-10 Antonio E. Porreca , Marius Rolland
‹ 上一页 1 2 3 10 下一页 ›