English
Related papers

Related papers: On continuous selections of polynomial functions

200 papers

In this paper, we relate the set of asymptotic critical values of a polynomial function $f$ with the set of discontinuity of two functions, the multivalued function which associate to each value $t$ the set of tangent directions at infinity…

Algebraic Geometry · Mathematics 2021-05-24 Si Tiep Dinh , Tien Son Pham

Consider a Henselian rank one valued field $K$ of equicharacteristic zero along with the language $\mathcal{L}^{P}$ of Denef--Pas. Let $f: A \to K$ be an $\mathcal{L}^{P}$-definable (with parameters) function on a subset $A$ of $K^{n}$. We…

Algebraic Geometry · Mathematics 2017-02-28 Krzysztof Jan Nowak

An algorithm is proposed, analyzed, and tested for solving continuous nonlinear-equality-constrained optimization problems where the objective and constraint functions are defined by expectations or averages over large, finite numbers of…

Optimization and Control · Mathematics 2026-05-14 Frank E. Curtis , Lingjun Guo , Daniel P. Robinson

The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…

Number Theory · Mathematics 2007-05-23 Vinay Deolalikar

We study a class of one-dimensional full branch maps admitting two indifferent fixed points as well as critical points and/or unbounded derivative. Under some mild assumptions we prove the existence of a unique invariant mixing absolutely…

Dynamical Systems · Mathematics 2024-05-28 Douglas Coates , Stefano Luzzatto , Muhammad Mubarak

We give some classes of power maps with low $c$-differential uniformity over finite fields of odd characteristic, {for $c=-1$}. Moreover, we give a necessary and sufficient condition for a linearized polynomial to be a perfect $c$-nonlinear…

Combinatorics · Mathematics 2021-02-23 Sartaj Ul Hasan , Mohit Pal , Constanza Riera , Pantelimon Stanica

Let $\P_{n}^c(\bar{\mu},\bar{\nu})$ be the set of all complex polynomials $p(z)=\prod_{i=1}^{m}(z-z_i)^{\mu_i}$, $\sum_{i=1}^m\mu_i=n$, with derivatives of the form $$ p'(z)=n\prod_{i=1}^{m}(z-z_i)^{\mu_i-1}\prod_{j=1}^{k}(z-\xi_j)^{\nu_j},…

Complex Variables · Mathematics 2021-11-29 Petar P. Petrov

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

Computational Complexity · Computer Science 2015-05-07 Cristian S. Calude , Damien Desfontaines

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

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.…

Discrete Mathematics · Computer Science 2026-04-10 Antonio E. Porreca , Marius Rolland

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

Optimization and Control · Mathematics 2008-02-12 Jiawang Nie , Kristian Ranestad

We introduce and study the approximation properties of $g$-polynomials, defined as linear combinations of iterated Stieltjes integrals of a constant function. Focusing on the case where the derivator $g$ has finitely many discontinuities,…

Classical Analysis and ODEs · Mathematics 2025-07-08 Víctor Cora , F. Adrián F. Tojo

The paper deals with different properties of polynomials in random elements: bounds for characteristics functionals of polynomials, stochastic generalization of the Vinogradov mean value theorem, characterization problem, bounds for…

Probability · Mathematics 2016-08-05 Vladimir V. Ulyanov

We provide polynomial completeness results for finite algebras in congruence permutable varieties. In 2001, Idziak and S{\l}omczy{\'n}ska introduced the completeness concept of being \emph{polynomially rich}: a finite algebra is…

Rings and Algebras · Mathematics 2026-04-01 Erhard Aichinger , Mario Kapl , Bernardo Rossi

The main purpose of this paper is to prove some density results of polynomials in Fock spaces of slice regular functions. The spaces can be of two different kinds since they are equipped with different inner products and contain different…

Complex Variables · Mathematics 2018-12-10 Kamal Diki , Sorin G. Gal , Irene Sabadini

Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…

Combinatorics · Mathematics 2019-08-02 Stefan Steinerberger

We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).

Dynamical Systems · Mathematics 2009-09-25 Alfredo Poirier

Michael's selection theorem implies that a closed convex nonempty-valued mapping from the Sorgenfrey line to a euclidean space is inner semicontinuous if and only if the mapping can be represented as the image closure of right-continuous…

Optimization and Control · Mathematics 2022-04-12 Ari-Pekka Perkkiö , Erick Treviño-Aguilar

This paper describes a novel method to approximate the polynomial coefficients of regression functions, with particular interest on multi-dimensional classification. The derivation is simple, and offers a fast, robust classification…

Machine Learning · Statistics 2012-03-27 Péter Kövesárki

The concept of permutograph is introduced and properties of integral functions on permutographs are established. The central result characterizes the class of integral functions that are representable as lattice polynomials. This result is…

Combinatorics · Mathematics 2009-04-12 Sergei Ovchinnikov