English
Related papers

Related papers: On the Continuity Set of an omega Rational Functio…

200 papers

It is known that for $X$ a nowhere locally compact metric space, the set of bounded continuous, nowhere locally uniformly continuous real-valued functions on $X$ contains a dense $G_\delta$ set in the space $C_b(X)$ of all bounded…

General Topology · Mathematics 2021-05-21 Alexander J. Izzo

In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is…

Computational Complexity · Computer Science 2010-06-03 Vassilios Gregoriades

Let f be a rational function such that the multipliers of all repelling periodic points are real. We prove that the Julia set of such a function belongs to a circle. Combining this with a result of Fatou we conclude that whenever J(f)…

Dynamical Systems · Mathematics 2012-02-07 Alexandre Eremenko , Sebastian van Strien

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

We prove consistency of the following sentence: ``ZFC + every real function is continuous on a non-meagre set'', answering a question of Fremlin.

Logic · Mathematics 2009-09-25 Saharon Shelah

A sequence $s(n)$ of integers is MC-finite if for every $m \in \mathbb{N}^+$ the sequence $s^m(n) = s(n) \bmod{m}$ is ultimately periodic. We discuss various ways of proving and disproving MC-finiteness. Our examples are mostly taken from…

Combinatorics · Mathematics 2023-07-04 Yuval Filmus , Eldar Fischer , Johann A. Makowsky , Vsevolod Rakita

We study the radius of absolute monotonicity R of rational functions with numerator and denominator of degree s that approximate the exponential function to order p. Such functions arise in the application of implicit s-stage, order p…

Numerical Analysis · Mathematics 2019-02-20 Lajos Loczi , David I. Ketcheson

We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is…

Discrete Mathematics · Computer Science 2023-09-04 E. Charlier , A. Massuir , M. Rigo , E. Rowland

Given any collection F of computable functions over the reals, we show that there exists an algorithm that, given any L_F-sentence \varphi containing only bounded quantifiers, and any positive rational number \delta, decides either "\varphi…

Logic in Computer Science · Computer Science 2012-05-01 Sicun Gao , Jeremy Avigad , Edmund Clarke

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…

Dynamical Systems · Mathematics 2007-05-23 Raphael M. Jungers , Vincent D. Blondel

The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing…

Formal Languages and Automata Theory · Computer Science 2024-02-09 Emmanuel Filiot , Sarah Winter

The notion of non-deterministic logical matrix (where connectives are interpreted as multi-functions) preserves many good properties of traditional semantics based on logical matrices (where connectives are interpreted as functions) whilst…

Logic in Computer Science · Computer Science 2022-04-15 Pedro Filipe , Carlos Caleiro , Sérgio Marcelino

We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.

Logic · Mathematics 2011-08-09 Dmitriy Zhuk

Encodings, that is, injective functions from words to words, have been studied extensively in several settings. In computability theory the notion of encoding is crucial for defining computability on arbitrary domains, as well as for…

Formal Languages and Automata Theory · Computer Science 2015-01-21 Jörg Endrullis , Clemens Grabmayer , Dimitri Hendriks

Let $\Omega \subset \mathbb{R}$ be a compact set with measure $1$. If there exists a subset $\Lambda \subset \mathbb{R}$ such that the set of exponential functions $E_{\Lambda}:=\{e_\lambda(x) = e^{2\pi i \lambda x}|_\Omega :\lambda \in…

Classical Analysis and ODEs · Mathematics 2016-06-16 Debashish Bose , Shobha Madan

A function f:R -> R is approximately continuous iff it is continuous in the density topology, i.e., for any ordinary open set U the set E=f^{-1}(U) is measurable and has Lebesgue density one at each of its points. Denjoy proved that…

Logic · Mathematics 2016-09-06 M. Laczkovich , Arnold W. Miller

We study two formalisms that allow to compare transducers over words under origin semantics: rational and regular resynchronizers, and show that the former are captured by the latter. We then consider some instances of the following…

Formal Languages and Automata Theory · Computer Science 2019-06-26 Sougata Bose , Shankara Narayanan Krishna , Anca Muscholl , Vincent Penelle , Gabriele Puppis

It is known that a positive, compactly supported function $f \in L^1(\mathbb R)$ can tile by translations only if the translation set is a finite union of periodic sets. We prove that this is not the case if $f$ is allowed to have unbounded…

Classical Analysis and ODEs · Mathematics 2015-10-27 Mihail N. Kolountzakis , Nir Lev

Given an F-sigma-delta subset A of the real line R of Lebesgue measure zero, we construct a monotone absolutely continuous function f from R to R such that the little Lipschitz constant of f is equal to infinity exactly at points of A.

Classical Analysis and ODEs · Mathematics 2024-01-30 Martin Rmoutil , Thomas Zürcher

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

Logic · Mathematics 2008-02-03 Saharon Shelah
‹ Prev 1 3 4 5 6 7 10 Next ›