English
Related papers

Related papers: Effectively Open Real Functions

200 papers

We exhibit a sound and complete implicit-complexity formalism for functions feasibly computable by structural recursions over inductively defined data structures. Feasibly computable here means that the structural-recursive definition runs…

Computational Complexity · Computer Science 2022-05-23 Norman Danner , James S. Royer

Let K be an algebraically closed valued field, and let f:X--->Y be a universally open morphism of K-schemes of finite type. We show that the induced map on K-rational points is open for the topologies deduced from the absolute value of K.…

Algebraic Geometry · Mathematics 2013-01-31 Laurent Moret-Bailly

Let $\Omega$ be a set of positive integers and let $f:\Omega \rightarrow \Omega$ be an arithmetic function. Let $V = (v_i)_{i=1}^n$ be a finite sequence of positive integers. An integer $m \in \Omega$ has \textit{increasing-decreasing…

Number Theory · Mathematics 2025-03-03 Melvyn B. Nathanson

The Thue-Morse sequence (1, -1, -1, 1, -1, 1, 1, ...) can in a sense be naturally extended to a continuous function f called the Fabius function. It is shown how to determine the exact value of f(x) whenever x is the ratio between a…

General Mathematics · Mathematics 2020-05-06 Jan Kristian Haugland

In the context of the correspondence between real functions on the unit circle and inner analytic functions within the open unit disk, that was presented in previous papers, we show that the constructions used to establish that…

Complex Variables · Mathematics 2019-02-19 Jorge L. deLyra

In this paper, we consider certain topological properties along with certain types of mappings on these spaces defined by the notion of ideal convergence. In order to do that, we primarily follow in the footsteps of the earlier studies of…

General Topology · Mathematics 2023-01-03 Pratulananda Das , Upasana Samanta , Shou Lin

Let $\precsim$ be a reflexive binary relation on a topological space $(X, \tau )$. A pair $(u,v)$ of continuous real-valued functions on $(X, \tau )$ is said to be a {\em continuous representation} of $\precsim$ if, for all $x,y \in X$,…

Theoretical Economics · Economics 2024-02-14 Gianni Bosi , Asier Estevan

For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…

Combinatorics · Mathematics 2018-09-11 Martin Klazar

We study mappings that satisfy the inverse modulus inequality of Poletsky type in a fixed domain. It is shown that, under some additional restrictions, the image of a ball under such mappings contains a fixed ball uniformly over the class.…

Complex Variables · Mathematics 2024-05-28 Evgeny Sevost'yanov , Valery Targonskii

Let $r,\,f$ be multiplicative functions with $r\geqslant 0$, $f$ is complex valued, $|f|\leqslant r$, and $r$ satisfies some standard growth hypotheses. Let $x$ be large, and assume that, for some real number $\tau$, the quantities…

Number Theory · Mathematics 2025-12-19 Gérald Tenenbaum

We describe dynamical properties of a map $\mathfrak{F}$ defined on the space of rational functions. The fixed points of $\mathfrak{F}$ are classified and the long time behavior of a subclass is described in terms of Eulerian polynomials.

Classical Analysis and ODEs · Mathematics 2007-05-23 G. Boros , J. Little , V. Moll , E. Mosteig , R. Stanley

We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…

Logic · Mathematics 2023-06-09 Masato Fujita

Reactive Turing machines extend classical Turing machines with a facility to model observable interactive behaviour. We call a behaviour (finitely) executable if, and only if, it is equivalent to the behaviour of a (finite) reactive Turing…

Logic in Computer Science · Computer Science 2023-06-22 Bas Luttik , Fei Yang

In this paper, we show that some fundamental results for smooth mappings (e.g., the Brouwer degree formula, the implicit function and inverse function theorems, the mean value theorem, Sard's theorem, Hadamard's global invertibility…

Functional Analysis · Mathematics 2021-05-26 Xuan Duc Ha Truong , Tien Son Pham

Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…

Number Theory · Mathematics 2022-03-01 Joseph Burnett , Alex Taylor

We consider the class of smooth convex functions defined over an open convex set. We show that this class is essentially different than the class of smooth convex functions defined over the entire linear space by exhibiting a function that…

Optimization and Control · Mathematics 2019-01-01 Yoel Drori

This paper enriches preexisting satisfiability tests for unquantified languages, which in turn augment a fragment of Tarski's elementary algebra with unary real functions possessing a continuous first derivative. Two sorts of individual…

Logic in Computer Science · Computer Science 2025-07-04 G. Buriola , D. Cantone , G. Cincotti , E. G. Omodeo , G. T. Spartà

We give necessary and sufficient conditions for a function in a naturally appearing functional space to be a fixed point of the Ruelle-Thurston operator associated to a rational function, see Lemma 2.1. The proof uses essentially a recent…

Dynamical Systems · Mathematics 2020-07-23 Genadi Levin

This paper introduces effectful toposes as an extension of the effective topos and investigates their structure relative to Lawvere-Tierney topologies. First, we formulate effectful toposes by lifting the evidenced frame, which is a…

Logic in Computer Science · Computer Science 2026-02-27 Rinta Yamada

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

Logic · Mathematics 2017-01-31 Peter Cholak , Charlie McCoy
‹ Prev 1 4 5 6 7 8 10 Next ›