Related papers: Hairer's Reconstruction Theorem without Regularity…
We deal with the shape reconstruction of inclusions in elastic bodies. For solving this inverse problem in practice, data fitting functionals are used. Those work better than the rigorous monotonicity methods from [5], but have no…
We present a new approach to Hamilton's theory of turns for the groups SO(3) and SU(2) which renders their properties, in particular their composition law, nearly trivial and immediately evident upon inspection. We show that the entire…
We discuss the possibility of deriving an H-theorem for the nonlinear discrete time evolution known as Ulam's redistribution of energy problem. In this model particles are paired at random and then their total energy is redistributed…
Reconstructing a network of dynamic systems from observational data is an active area of research. Many approaches guarantee a consistent reconstruction under the relatively strong assumption that the network dynamics is governed by…
Machine learning often needs to model density from a multidimensional data sample, including correlations between coordinates. Additionally, we often have missing data case: that data points can miss values for some of coordinates. This…
We introduce an intrinsic notion of Hoelder-Zygmund regularity for Colombeau generalized functions. In case of embedded distributions belonging to some Zygmund-Hoelder space this is shown to be consistent. The definition is motivated by the…
Consider an information source generating a symbol at the root of a tree network whose links correspond to noisy communication channels, and broadcasting it through the network. We study the problem of reconstructing the transmitted symbol…
We introduce meta-factorization, a theory that describes matrix decompositions as solutions of linear matrix equations: the projector and the reconstruction equation. Meta-factorization reconstructs known factorizations, reveals their…
We study the structure of renormalons in the Heavy Quark Effective Theory, by expanding the heavy quark propagator in powers of $1/m_Q$. We demonstrate that the way in which renormalons appear depends on the regularisation scheme used to…
The notion of random self-decomposability is generalized here. Its relation to self-decomposability, Harris infinite divisibility and its connection with a stationary first order generalized autoregressive model are presented. The notion is…
A generalized divergence theorem is established allowing for domains with inner boundaries. The normal trace of a rough integrand is not a Radon measure; rather, the boundary integral is expressed via a surface functional continuous with…
This survey aims to give an overview of several substantial developments of the last 50 years in the structure theory of regular semigroups and to shed light on their impact on other parts of semigroup theory.
Causal perturbative renormalization within the recursive Epstein-Glaser scheme involves extending, at each order, time-ordered operator-valued distributions to coinciding points. This is achieved by a generalized Taylor subtraction on test…
In this paper, we give a short proof of a theorem by Koll\'{a}r on hereditarily rational functions. This is an answer to his appeal to find an elementary proof which does not rely so much on resolution of singularities. Our approach does…
We take a geometrical viewpoint and present a unifying view on supervised deep learning with the Bregman divergence loss function - this entails frequent classification and prediction tasks. Motivated by simulations we suggest that there is…
We prove an elegant structure theorem for log de Rham-Witt sheaves with vanishing along an effective Cartier divisor $D$ defined in arXiv:2403.18763, answering a question of Shuji Saito during the Mainz conference and a question of Yigeng…
In statistical learning, identifying underlying structures of true target functions based on observed data plays a crucial role to facilitate subsequent modeling and analysis. Unlike most of those existing methods that focus on some…
This paper is concerned with the question of reconstructing a vector in a finite-dimensional real or complex Hilbert space when only the magnitudes of the coefficients of the vector under a redundant linear map are known. We present new…
Trace reconstruction is the problem of learning an unknown string $x$ from independent traces of $x$, where traces are generated by independently deleting each bit of $x$ with some deletion probability $q$. In this paper, we initiate the…
When studying social, economic and biological systems, one has often access to only limited information about the structure of the underlying networks. An example of paramount importance is provided by financial systems: information on the…