English
Related papers

Related papers: Boundedly finite-to-one functions

200 papers

Given a subset $\Lambda$ of $\mathbb Z_+:=\{0,1,2,\dots\}$, let $H^\infty(\Lambda)$ denote the space of bounded analytic functions $f$ on the unit disk whose coefficients $\widehat f(k)$ vanish for $k\notin\Lambda$. Assuming that either…

Complex Variables · Mathematics 2022-03-18 Konstantin M. Dyakonov

We show that in the setting of fair-coin measure on the power set of the natural numbers, each sufficiently random set has an infinite subset that computes no random set. That is, there is an almost sure event $\mathcal A$ such that if…

Logic · Mathematics 2014-08-12 Bjørn Kjos-Hanssen

We continue the study of analytic functions in the unit disk of finite order with arbitrary set of singular points on the unit circle, introduced in \cite{FG}. The main focus here is made upon the inverse problem: the existence of a…

Complex Variables · Mathematics 2010-07-20 S. Favorov , L. Golinskii

We present a theorem on taking the repeated indefinite summation of a holomorphic function $\phi(z)$ in a vertical strip of $\mathbb{C}$ satisfying exponential bounds as the imaginary part grows. We arrive at this result using transforms…

Complex Variables · Mathematics 2015-03-24 James Nixon

Suppose that $f$ belongs to a suitably defined complete metric space $ {{\cal C}}^{{\alpha}}$ of H\"older $ {\alpha}$-functions defined on $[0,1]$. We are interested in whether one can find large (in the sense of Hausdorff, or lower/upper…

Classical Analysis and ODEs · Mathematics 2017-03-21 Zoltan Buczolich

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

Functional Analysis · Mathematics 2020-11-11 Michael Dymond , Olga Maleva

Let $\mathcal S$ denote the class of all functions of the form $f(z)=z+a_2z^2+a_3z^3+\cdots$ which are analytic and univalent in the open unit disk $\ID$ and, for $\lambda >0$, let $\Phi_\lambda (n,f)=\lambda a_n^2-a_{2n-1}$ denote the…

Complex Variables · Mathematics 2016-03-24 Liulan Li , Saminathan Ponnusamy , Jinjing Qiao

Let f be a real entire function whose set S(f) of singular values is real and bounded. We show that, if f satisfies a certain function-theoretic condition (the "sector condition"), then $f$ has no wandering domains. Our result includes all…

Dynamical Systems · Mathematics 2014-12-10 Helena Mihaljević-Brandt , Lasse Rempe-Gillen

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

Assuming the absence of Q-points (which is consistent with ZFC) we prove that the free topological group $F(X)$ over a Tychonov space $X$ is $o$-bounded if and only if every continuous metrizable image $T$ of $X$ satisfies the selection…

General Topology · Mathematics 2009-11-05 Taras Banakh , Dušan Repovš , Lyubomyr Zdomskyy

A function $f:R\to R$, where $R$ is a commutative ring with unit element, is called polyfunction if it admits a polynomial representative $p\in R[x]$. Based on this notion we introduce ring invariants which associate to $R$ the numbers…

Rings and Algebras · Mathematics 2022-11-17 Ernst Specker , Norbert Hungerbühler , Micha Wasem

In this note, we present a puzzle. We prove that Zermelo-Fraenkel set theory is inconsistent by proving, using Zermelo-Fraenkel set theory, the false statement that any algorithm that determines whether any $n \times n$ matrix over $\mathbb…

Computational Complexity · Computer Science 2014-10-08 Craig Alan Feinstein

Let $C$ be a convex subset of a locally convex space. We provide optimal approximate fixed point results for sequentially continuous maps $f\colon C\to\bar{C}$. First we prove that if $f(C)$ is totally bounded, then it has an approximate…

Functional Analysis · Mathematics 2013-02-27 Cleon S. Barroso , Ondřej F. K. Kalenda , Michel P. Rebouças

In this paper we prove that among the permutations of length n with i fixed points and j excedances, the number of 321-avoiding ones equals the number of 132-avoiding ones, for all given i,j<=n. We use a new technique involving diagonals of…

Combinatorics · Mathematics 2007-05-23 Sergi Elizalde

In this paper, we show that the set of continuous functions defined on $\mathbb{R}^n$ that approach zero at infinity and attain their maximum at precisely one (and only one) point is $n$-lineable but not $(n+2)$-lineable. This result…

Functional Analysis · Mathematics 2023-12-11 Anderson Barbosa , Gustavo Araújo

Motivated by the analogy between number fields and function fields, this paper extends the main result of \cite{janbazi2025unified} to the function field setting. Let $C$ be a smooth affine curve over a finite field, and let $\pi: S…

Algebraic Geometry · Mathematics 2025-07-29 Fateme Sajadi

One measure of the complexity of a first-order theory, and similarly a type, is the complexity of the formulas required to axiomatize it. We say a theory is bounded if there is an axiomatization involving only $\forall_n$-formulas for some…

Logic · Mathematics 2026-04-29 Hongyu Zhu

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

In this note we show the characteristic function of every indecomposable set $F$ in the plane is $BV$ equivalent to the characteristic function a closed set $\mathbb{F}$, i.e.…

Analysis of PDEs · Mathematics 2019-02-20 Andrew Lorent

Fairly deep results of Zermelo-Frenkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplication is K*K = K,…

Logic in Computer Science · Computer Science 2016-08-31 Lawrence C. Paulson , Krzysztof Grabczewski