Related papers: Regular coverings in filter and ideal lattices
Regularisation allows one to handle ill-posed inverse problems. Here we focus on discrete unfolding problems. The properties of the results are characterised by the consistency between measurements and unfolding result and by the posterior…
This part of a multi-paper project studies the lattice properties of the arithmetic mean ideals of B(H) introduced by Dykema, Figiel, Weiss, and Wodzicki. We prove: the lattices of all principal ideals, of arithmetic mean or arithmetic mean…
Based on an analogue for systems of partial isomorphisms between lower sections in a complemented modular lattice we prove that principal right ideals $aR \cong bR$ in a (von Neumann) regular ring $R$ are perspective if $aR \cap bR$ is of…
Inclusion preserving maps from modules over an Artin algebra to complete partially ordered sets are studied. This yields a filtration of the Ziegler spectrum which is indexed by all Gabriel-Roiter measures. Another application is a…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
This paper completes the classification of regular Lagrangian fibratiopns over compact surfaces. \cite{misha} classifies regular Lagrangian fibrations over $\mathbb{T}^2$. The main theorem in \cite{hirsch} is used in order to classify…
Mathematically characterizing the implicit regularization induced by gradient-based optimization is a longstanding pursuit in the theory of deep learning. A widespread hope is that a characterization based on minimization of norms may…
Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…
We investigate similarity classes of arithmetic lattices in the plane. We introduce a natural height function on the set of such similarity classes, and give asymptotic estimates on the number of all arithmetic similarity classes,…
We study $b$-property of a sublattice (or an order ideal) $F$ of a vector lattice $E$. In particular, $b$-property of $E$ in $E^\delta$, the Dedekind completion of $E$, $b$-property of $E$ in $E^u$, the universal completion of $E$, and…
Quadratic form reduction and lattice reduction are fundamental tools in computational number theory and in computer science, especially in cryptography. The celebrated Lenstra-Lenstra-Lov\'asz reduction algorithm (so-called LLL) has been…
We introduce a notion of integration defined from filters over families of finite sets. This procedure corresponds to determining the average value of functions whose range lies in any algebraic structure in which finite averages make…
We develop a regularity and compactness theory for stable capillary minimal hypersurfaces in the half-space $\mathbb{H}^{n+1}$ with contact angle $\theta \in (0,\pi)$ and dimension $n \geq 2$. As a consequence, we obtain the generalized…
Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…
We establish effective convergence rates in the Doeblin-Lenstra law, describing the limiting distribution of approximation coefficients arising from continued fraction convergents of a typical real number. More generally, we prove…
This article describes a normal form algorithm for the Brieskorn lattice of an isolated hypersurface singularity. It is the basis of efficient algorithms to compute the Bernstein-Sato polynomial, the complex monodromy, and Hodge-theoretic…
A set A of natural numbers is finitely embeddable in another such set B if every finite subset of A has a rightward translate that is a subset of B. This notion of finite embeddability arose in combinatorial number theory, but in this paper…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
We establish higher order convergence rates in the theory of periodic homogenization of both linear and fully nonlinear uniformly elliptic equations of non-divergence form. The rates are achieved by involving higher order correctors which…
A manifestly supersymmetric nonperturbative matrix regularization for a twisted version of N=(8,8) theory on a curved background (a two-sphere) is constructed. Both continuum and the matrix regularization respect four exact scalar…