English
Related papers

Related papers: Definable Lipschitz selections for affine-set valu…

200 papers

We prove that the roots of a smooth monic polynomial with complex-valued coefficients defined on a bounded Lipschitz domain $\Omega$ in $\mathbb R^m$ admit a parameterization by functions of bounded variation uniformly with respect to the…

Classical Analysis and ODEs · Mathematics 2021-04-06 Adam Parusinski , Armin Rainer

Fixed-point equations with Lipschitz operators have been studied for more than a century, and are central to problems in mathematical optimization, game theory, economics, and dynamical systems, among others. When the Lipschitz constant of…

Optimization and Control · Mathematics 2025-11-12 Jelena Diakonikolas

We study extension theorems for Lipschitz-type operators acting on metric spaces and with values on spaces of integrable functions. Pointwise domination is not a natural feature of such spaces, and so almost everywhere inequalities and…

Functional Analysis · Mathematics 2019-10-02 W. V. Cavalcante , P. Rueda , E. A. Sánchez-Pérez

We give necessary and sufficient conditions on an Ore extension $A[x;\sigma,\delta]$, where $A$ is a finite dimensional algebra over a field $\mathbb{F}$, for being a Frobenius extension over the ring of commutative polynomials…

We give a simple alternative proof for the $C^{1,1}$--convex extension problem which has been introduced and studied by D. Azagra and C. Mudarra [2]. As an application, we obtain an easy constructive proof for the Glaeser-Whitney problem of…

Functional Analysis · Mathematics 2018-02-20 Aris Daniilidis , Mounir Haddou , Erwan Le Gruyer , Olivier Ley

Suppose that $\widetilde{\mathbb R}$ is an o-minimal expansion of the real field in which restricted power functions are definable. We show that if $\widehat{\mathbb R}$ is both a reduct (in the sense of definability) of the expansion…

Logic · Mathematics 2020-11-23 Gareth Jones , Olivier Le Gal

First-order linear real arithmetic enriched with uninterpreted predicate symbols yields an interesting modeling language. However, satisfiability of such formulas is undecidable, even if we restrict the uninterpreted predicate symbols to…

Logic in Computer Science · Computer Science 2017-06-27 Marco Voigt

This paper concerns the regularity and geometry of the free boundary in the optimal partial transport problem for general cost functions. More specifically, we prove that a $C^1$ cost implies a locally Lipschitz free boundary. As an…

Analysis of PDEs · Mathematics 2013-12-12 Shibing Chen , Emanuel Indrei

A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…

Optimization and Control · Mathematics 2020-07-09 Feng Guo , Liguo Jiao , Do Sang Kim

In this article, we study exponents which preserve complete monotonicity of functions on lattices. We prove that for any completely monotone function $f$ on a finite lattice, $f^\alpha$ is completely monotone for all $\alpha\geq c$, where…

Probability · Mathematics 2023-12-06 Jnaneshwar Baslingker , Biltu Dan

The decidability of the reachability problem for finitary PCF has been used as a theoretical basis for fully automated verification tools for functional programs. The reachability problem, however, often becomes undecidable for a slight…

Logic in Computer Science · Computer Science 2025-02-11 Naoki Kobayashi

We use the Cauchy-Crofton formula to show that every definable cell (bounded by a ball with rational radius) in an O-minimal expansion of a field extension of the real numbers satisfies the Whitney arc property.

Logic · Mathematics 2010-11-09 Elisa Vasquez Rifo

In this paper we work in o-minimal structures with definable Skolem functions and show that a continuous definable map between Hausdorff locally definably compact definable spaces is definably proper if and only if it is proper morphism in…

Logic · Mathematics 2015-07-14 Mário Edmundo , Marcello Mamino , Luca Prelli

It follows from recent results of V. Bakhtin, R. Oleinik, and the second named author that, given a metric space $\mathcal{X}$, a continuous map $\gamma\colon [a,b] \to \mathcal{X}$ is a map of bounded variation if and only if $f \circ…

Classical Analysis and ODEs · Mathematics 2026-03-05 Dmitriy Stolyarov , Alexander Tyulenev

Composition operators with analytic symbols on some reproducing kernel Hilbert spaces of entire functions on a complex Hilbert space are studied. The questions of their boundedness, seminormality and positivity are investigated. It is…

Functional Analysis · Mathematics 2016-10-17 Jan Stochel , Jerzy B. Stochel

Let $F$ be a set-valued mapping from an $N$-element metric space $({\mathcal M},\rho)$ into the family of all closed half-planes in ${\bf R}^2$. In this paper, we provide an efficient algorithm for a Lipschitz selection of $F$, i.e., a…

Functional Analysis · Mathematics 2025-06-12 Pavel Shvartsman

We investigate the classification of quasihomogeneous polynomials in two variables with real coefficients under semialgebraic bi-Lipschitz equivalence in a neighborhood of the origin in ${\mathbb R}^2$. Building on the work of Birbrair,…

Algebraic Geometry · Mathematics 2025-03-11 Sergio Alvarez

We first show that the projection image of a discrete definable set is again discrete for an arbitrary definably complete locally o-minimal structure. This fact together with the results in a previous paper implies tame dimension theory and…

Logic · Mathematics 2022-10-07 Masato Fujita , Tomohiro Kawakami , Wataru Komine

We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…

Complex Variables · Mathematics 2007-05-23 Walter Bergweiler

We study set-valued mappings defined by solution sets of parametric systems of equalities and inequalities. We prove Lipschitz-like continuity of these mappings under relaxed constant rank constraint qualification.

Optimization and Control · Mathematics 2019-05-21 Ewa M. Bednarczuk , Leonid I. Minchenko , Krzysztof E. Rutkowski