Related papers: Effective Genericity and Differentiability

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

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…

An element of a finitely generated non-Abelian free group F(X) is said to be filling if that element has positive translation length in every very small action of F(X) on an $\mathbb{R}$-tree. We give a proof that the set of filling…

In this paper we define "a continued fraction expansion of the exponential integral $E_{1}(x)$ at infinity", which is analogous to the regular continued fraction expansion of real numbers, and prove that this expansion gives the same…

Inspired from a joint work by A. Beckmann, S. Buss and S. Friedman, we propose a class of set-theoretic functions, predicatively computable functions. Each function in this class is polynomial time computable when we restrict to finite…

In this paper, using the tools from the lineability theory, we distinguish certain subsets of $p$-adic differentiable functions. Specifically, we show that the following sets of functions are large enough to contain an infinite dimensional…

For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…

A major open problem in computational complexity is the existence of a one-way function, namely a function from strings to strings which is computationally easy to compute but hard to invert. Levin (2023) formulated the notion of one-way…

From physical perspective, derivatives can be viewed as mathematical idealizations of the linear growth. The linear growth condition has special properties, which make it preferred. The manuscript investigates the general properties of the…

In 1934, Whitney raised the question of how to recognize whether a function f defined on a closed subset X of Euclidean space is the restriction of a function that is continuously differentiable to order p. A necessary and sufficient…

We prove a uniqueness theorem for an entire function, which shares certain values with its higher order derivatives.

Let $k$ be a rational congruence function field and consider an arbitrary finite separable extension $K/k$. If for each prime in $k$ ramified in $K$ we have that at least one ramification index is not divided by the characteristic of $K$,…

Whenever P is a proper definable forcing for adding a real, the countable support iteration of P has all the preservation properties it can possibly have, within a wide syntactically identified class of properties.

We study the Poincar\'e series of the mixed and pure trace rings of generic matrices. These series are known to be rational functions. We obtain an explicit formula in lowest terms in the case of $2\times2$ matrices; a denominator, which we…

Let X be a normal variety such that $K_X$ is Q-Cartier, and let $f: X \rightarrow X$ be a finite surjective morphism of degree at least two. We establish a close relation between the irreducible components of the locus of singularities that…

Let $p$ be a polynomial in one variable whose roots either all have multiplicity more than 1 or all have multiplicity exactly 1. It is shown that the universal $C^*$-algebra of a relation $p(x)=0$, $\|x\| \le 1$ is semiprojective. In the…

We describe a sufficient condition for the localization functor to be a categorical equivalence. Using this result we explain how to simplify the test for projectivity. This leads to a description of the strictly simple algebras which are…

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

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.…

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…