Related papers: A lightface analysis of the differentiability rank

We formulate and prove a log-algebraicity theorem for arbitrary rank Drinfeld modules defined over the polynomial ring F_q[theta]. This generalizes results of Anderson for the rank one case. As an application we show that certain special…

A new class of functions is presented. The structure of the algorithm, particularly the selection criteria (branching), is used to define the fundamental property of the new class. The most interesting property of the new functions is that…

There are familiar examples of computable structures having various computable Scott ranks. There are also familiar structures, such as the Harrison ordering, which have Scott rank $\omega_1^{CK}+1$. Makkai produced a structure of Scott…

There is no infinite sequence of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$ each of which proves $\Pi^1_1$-reflection of the next. This engenders a well-founded ``reflection ranking'' of $\Pi^1_1$-sound extensions of $\mathsf{ACA}_0$.…

Prediction algorithms assign numbers to individuals that are popularly understood as individual "probabilities" -- what is the probability of 5-year survival after cancer diagnosis? -- and which increasingly form the basis for life-altering…

Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…

We prove that the first-order theory of any function field K of characteristic p>2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field,…

We say that a first order formula A distinguishes a graph G from another graph G' if A is true on G and false on G'. Provided G and G' are non-isomorphic, let D(G,G') denote the minimal quantifier rank of a such formula. We prove that, if G…

Various problems on integers lead to the class of congruence preserving functions on rings, i.e. functions verifying $a-b$ divides $f(a)-f(b)$ for all $a,b$. We characterized these classes of functions in terms of sums of rational…

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…

Let L be a time-periodic Lagrangian on a two-torus. Then the beta-function of L is differentiable at least in k directions at any k-irrational homology class, for k= 0, 1, 2.

We focus on formulae $\exists X.\, \varphi(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < \omega_1$ of such a set $X$ measures its…

The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…

The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…

We give upper bounds on the Walsh coefficients of functions for which the derivative of order at least one has bounded variation of fractional order. Further, we also consider the Walsh coefficients of functions in periodic and non-periodic…

Let $\Omega \subset \mathbb{R}^{n}$ be bounded a domain. We prove under certain structural assumptions that the fractional maximal operator relative to $\Omega$ maps $L^{p}(\Omega) \to W^{1,p}(\Omega)$ for all $p > 1$, when the smoothness…

In this paper we study differentiability properties of the map $T\mapsto\phi(T)$, where $\phi$ is a given function in the disk-algebra and $T$ ranges over the set of contractions on Hilbert space. We obtain sharp conditions (in terms of…

We characterize the variation functions of computable Lipschitz functions. We show that a real z is computably random if and only if every computable Lipschitz function is differentiable at z. Beyond these principal results, we show that a…

Ranks estimated from data are uncertain and this poses a challenge in many applications. However, estimated ranks are deterministic functions of estimated parameters, so the uncertainty in the ranks must be determined by the uncertainty in…

We introduce a framework for benchmarking optimizers according to multiple criteria over various test functions. Based on a recently introduced union-free generic depth function for partial orders/rankings, it fully exploits the ordinal…