Related papers: Effective Genericity and Differentiability

Multivariable, real-valued functions induce matrix-valued functions defined on the space of d-tuples of n-times-n pairwise-commuting self-adjoint matrices. We examine the geometry of this space of matrices and conclude that the best notion…

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

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

This article expands our work in [Ca16]. By its reliance on Turing computability, the classical theory of effectivity, along with effective reducibility and Weihrauch reducibility, is only applicable to objects that are either countable or…

We show that if an exponential sum with multiplicative coefficients is large then the associated multiplicative function is "pretentious". This leads to applications in the circle method, and a natural interpretation of the local-global…

Given a function on diagonal matrices, there is a unique way to extend this to an invariant (by conjugation) function on symmetric matrices. We show that the extension preserves regularity -- that is, if the original function is k times…

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

A set $I$ is said to be a universal indifferent set for $1$-genericity if for every $1$-generic $G$ and for all $X \subseteq I$, $G \Delta X$ is also $1$-generic. Miller showed that there is no infinite universal indifferent set for…

We show that for a random polynomial \[ F(X) = \sum_{n=1}^{N} f(n) X^{n-1}, \] where $f(n)$ is a random completely multiplicative function taking values in $\{\pm 1\}$, one has \[ \limsup_{N \to \infty} \mathbb{P}\big[F(X) \text{ is…

We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. The Kac-Kubilius model suggests that the distribution of values of a given additive function can…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

In this paper, some sufficient conditions for the differentiability of the $n$-variable real-valued function are obtained, which are given based on the differentiability of the $n-1$-variable real-valued function and are weaker than…

Let $k$ be a natural number and $s$ be real. In the 1-dimensional case, the $k$-th order derivatives of the functions $\lvert x\rvert^s$ and $\log \lvert x\rvert$ are multiples of $\lvert x\rvert^{s-k}$ and $\lvert x\rvert^{-k}$,…

We consider several notions of genericity appearing in algebraic geometry and commutative algebra. Special emphasis is put on various stability notions which are defined in a combinatorial manner and for which a number of equivalent…

We view a conic optimization problem that has a unique solution as a map from its data to its solution. If sufficient regularity conditions hold at a solution point, namely that the implicit function theorem applies to the normalized…

It is known that if $f\colon {\mathbb R}^2 \to {\mathbb R}$ is a polynomial in each variable, then $f$ is a polynomial. We present generalizations of this fact, when ${\mathbb R}^2$ is replaced by $G\times H$, where $G$ and $H$ are…

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

We introduce the definition of conformable derivative on time scales and develop its calculus. Fundamental properties of the conformable derivative and integral on time scales are proved. Linear conformable differential equations with…

Let V be a set of number-theoretical functions. We define a notion of V -realizability for predicate formulas in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In this…