Related papers: An affirmative answer to a problem of Cater
We study the problem of whether the centered Hardy--Littlewood maximal function of a singular function is absolutely continuous. For a parameter $d \in (0,1)$ and a closed set $E\subset [0,1]$, let $\mu$ be a $d$-Ahlfors regular measure…
Absolute continuity implies uniform continuity, but generally not vice versa. In this short note, we present one sufficient condition for a uniformly continuous function to be absolutely continuous, which is the following theorem: For a…
It is proved that for certain algebras of continuous functions on compact abelian groups, the set of factorable matrix functions with entries in the algebra is not dense in the group of invertible matrix functions with entries in the…
Let $f: B^n \rightarrow {\mathbb R}$ be a $d+1$ times continuously differentiable function on the unit ball $B^n$, with $\max_{z\in B^n} \Vert f(z) \Vert=1$. A well-known fact is that if $f$ vanishes on a set $Z\subset B^n$ with a non-empty…
Let $D$ be the open unit disc in the complex plane. We denote by $\mathbb{C}$ the set of complex numbers and consider any compact set $K$ which is disjoint from $D$ and which also has connected complement. Let $A(K)$ denote all the…
We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
The famous Jacobian problem asks: Is a morphism $f:\mathbb{C}[x,y]\to \mathbb{C}[x,y]$ having an invertible Jacobian, invertible? If we add the assumption that $\mathbb{C}(f(x),f(y))=\mathbb{C}(x,y)$, then $f$ is invertible; this result is…
Let a function $F: [0,1]^2\rightarrow [0,1]$ be given by $F(x,y)= f^{(-1)}(T(f(x), f(y)))$ where $f :[0,1]\rightarrow [0,1]$ is a monotone function, $f^{(-1)}$ is the pseudo-inverse of $f$ and $T$ is a triangular norm. This article…
Under the separability assumption on the augmented density, a distribution function can be always constructed for a spherical population with the specified density and anisotropy profile. Then, a question arises, under what conditions the…
Let (X, d) be a quasi-convex, complete and separable metric space with reference probability measure m. We prove that the set of of real valued Lipschitz function with non zero point-wise Lipschitz constant m-almost everywhere is residual,…
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
By using the complete discrimination system for polynomials, we study the number of positive solutions in {\small $C[0,1]$} to the integral equation {\small $\phi (x)=\int_0^1k(x,y)\phi ^n(y)dy$}, where {\small…
We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…
We develop an analytic approach that draws on tools from Fourier analysis and ergodic theory to study Ramsey-type problems involving sums and products in the integers. Suppose $Q$ denotes a polynomial with integer coefficients. We establish…
An old result of M\"uller and R\"odl states that a countable graph $G$ has a subgraph whose vertices all have infinite degree if and only if for any vertex labeling of $G$ by positive integers, an infinite increasing path can be found. They…
We show a number of undecidable assertions concerning countably compact spaces hold under PFA(S)[S]. We also show the consistency without large cardinals of "every locally compact, perfectly normal space is paracompact".
We prove an analogue of the Ikehara theorem for positive non-increasing functions convergent to zero, generalising the results postulated in Diekmann, Kaper (1978, Nonlinear Anal. 2(6), 721--737) and Carr, Chmaj (2004, Proc. AMS 132(8),…
In this paper we study variations of an old result by M\"{u}ller, Reiterman, and the last author stating that a countable graph has a subgraph with infinite degrees if and only if in any labeling of the vertices (or edges) of this graph by…
A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…