Related papers: Note on $\mathsf{TD} + \mathsf{DC}_\mathbb{R}$ imp…

We have found a possibility to streamline the proof of the Treves' theorem (Duke Math. J., 108, 251-295, 2001) on an algebraic characterization of the KdV hierarchy which makes it significantly shorter, following essentially the logic of…

We propose a variant of the effective adjunction conjecture for lc-trivial fibrations. This variant is suitable for inductions and can be used to treat real coefficients.

We present a short proof of Klartag's central limit theorem for convex bodies, using only the most classical facts about log-concave functions. An appendix is included where we give the proof that thin shell implies CLT. The paper is…

Although the currently favored cold dark matter plus cosmological constant model (LCDM) has proven to be remarkably successful on large scales, on subgalactic scales it faces some potentially fatal difficulties; these include over-producing…

Let $Bun_G(X)$ be the moduli stack of $G$-torsors on a smooth projective curve $X$ for a reductive group $G$. We prove a conjecture made by Drinfeld-Wang and Gaitsgory on the Deligne-Lusztig duality for D-modules on $Bun_G(X)$. This…

Consequence-based reasoning can be used to construct proofs that explain entailments of description logic (DL) ontologies. In the literature, one can find multiple consequence-based calculi for reasoning in the $\mathcal{EL}$ family of DLs,…

In this very short note, we show that there is a relation between the leading term at $s=1$ of an $L$-function of an elliptic curve defined over an number field and the term that follows.

This article provides an overview of some of the mathematical principles of Automatic Differentiation (AD). In particular, we summarise different descriptions of the Forward Mode of AD, like the matrix-vector product based approach, the…

Within the framework of the augmented Lagrangian (AL), we propose a novel distributed optimization method, termed Distributed Augmented Lagrangian Decomposition (DALD), and provide a rigorous convergence proof for its standard version. To…

This paper is an announcement of the minimal model theory for log surfaces in all characteristics and contains some related results including a simplified proof of the Artin-Keel contraction theorem in the surface case.

These notes provide two derivations of the Lorentz-Dirac equation. The first is patterned after Landau and Lifshitz and is based on the observation that the half-retarded minus half-advanced potential is entirely responsible for the…

The early minimum bias and the QCD results from the ATLAS experiment in the LHC are presented.

We give an analytic version of the injectivity theorem by using multiplier ideal sheaves, and prove some extension theorems for the adjoint bundle of dlt pairs. Moreover, by combining techniques of the minimal model program, we obtain some…

This work focuses on the decentralized deep learning optimization framework. We propose Adjacent Leader Decentralized Gradient Descent (AL-DSGD), for improving final model performance, accelerating convergence, and reducing the…

The Ginzburg-Landau (GL) equations for a d-wave superconductor are derived within the context of two microscopic lattice models used to describe the cuprates: the extended Hubbard model and the Antiferromagnetic-van Hove model. Both models…

Let $\mathfrak{q}>2$ be a prime number, $\chi$ a primitive Dirichlet character modulo $\mathfrak{q}$ and $f$ a primitive holomorphic cusp form or a Hecke-Maass cusp form of level $\mathfrak{q}$ and trivial nebentypus. We prove the subconvex…

Doppler-resilient complementary sequence sets (DRCSs) are crucial in modern communication and sensing systems in mobile environments. In this paper, we propose a new lower bound for the aperiodic ambiguity function (AF) of unimodular DRCSs…

We prove the decomposition conjecture of Leclerc and Thibon for the Schur algebra. We also give a new approach to the Lusztig conjecture for the dimension of the simple U(sl_k)-modules at roots of unity via canonical bases of the Hall…

This paper introduces a uniform substitution calculus for differential refinement logic dRL. The logic dRL extends the differential dynamic logic dL such that one can simultaneously reason about properties of and relations between hybrid…

We present the first theoretical framework that connects predictive coding (PC), a biologically inspired local learning rule, with the minimum description length (MDL) principle in deep networks. We prove that layerwise PC performs…