Related papers: Normal functions and maximal order types
Extending earlier work by Rogers, Wiener-Hopf factorisation is studied for a class of functions closely related to Nevanlinna-Pick functions and complete Bernstein functions. The name 'Rogers functions' is proposed for this class. Under…
Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…
We study the problem of learning causal models from observational data through the lens of interpolation and its counterpart -- regularization. A large volume of recent theoretical, as well as empirical work, suggests that, in highly…
In the framework of convolutional neural networks, downsampling is often performed with an average-pooling, where all the activations are treated equally, or with a max-pooling operation that only retains an element with maximum activation…
Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…
We show that a family ${\cal F}$ of meromorphic functions in a domain $D$ satisfying $$\frac{|f^{(k)}|}{1+|f^{(j)}|^\alpha}(z)\ge C \qquad \mbox{for all} z\in D \mbox{and all} f\in {\cal F}$$ (where $k$ and $j$ are integers with $k>j\ge 0$…
We study several aspects of the regular deformations of completely integrable systems. Namely, we prove the existence of a Hamiltonian normal form for these deformations and we show the necessary and sufficient conditions a perturbation has…
White noise is a fundamental and fairly well understood stochastic process that conforms the conceptual basis for many other processes, as well as for the modeling of time series. Here we push a fresh perspective toward white noise that,…
We show how a rescaling of fractional operators with bounded kernels may help circumvent their documented deficiencies, for example, the inconsistency at zero or the lack of inverse integral operator. On the other hand, we build a novel…
We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the…
Normalisation in probability theory turns a subdistribution into a proper distribution. It is a partial operation, since it is undefined for the zero subdistribution. This partiality makes it hard to reason equationally about normalisation.…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
The study of intelligent systems explains behaviour in terms of economic rationality. This results in an optimization principle involving a function or utility, which states that the system will evolve until the configuration of maximum…
We explore the impact of weak disorder on the dynamics of classical particles in a periodically oscillating lattice. It is demonstrated that the disorder induces a hopping process from diffusive to regular motion i.e. we observe the…
We consider three classes of linear differential equations on distribution functions, with a fractional order $\alpha\in [0,1].$ The integer case $\alpha =1$ corresponds to the three classical extreme families. In general, we show that…
Recent studies of unconventional superconductivity have focused on charge or spin fluctuation, instead of electron-phonon coupling, as an origin of attractive interaction between electrons. On the other hand, a multipole order, which…
We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…
We study upper bounds, approximations, and limits for functions of motivic exponential class, uniformly in non-Archimedean local fields whose characteristic is $0$ or sufficiently large. Our results together form a flexible framework for…
Termination is a major question in both logic and computer science. In logic, termination is at the heart of proof theory where it is usually called strong normalization (of cut elimination). In computer science, termination has always been…
These lecture notes are intended as an introduction to the theory of rational Dunkl operators and the associated special functions, with an emphasis on positivity and asymptotics. We start with an outline of the general concepts: Dunkl…