Related papers: Dedekind Zeta Zeroes and Faster Complex Dimension …
We disprove two (unpublished) conjectures of Kontsevich which state generalized versions of categorical Hodge-to-de Rham degeneration for smooth and for proper DG categories (but not smooth and proper, in which case degeneration is proved…
It's well known that multiple polylogarithms give rise to good unipotent variations of mixed Hodge-Tate structures. In this paper we shall {\em explicitly} determine these structures related to multiple logarithms and some other multiple…
Let a and f be coprime positive integers. Let g be an integer. Under the Generalized Riemann Hypothesis (GRH) it follows by a result of H.W. Lenstra that the set of primes p such that p=a(mod f) and g is a primitive root modulo p has a…
Consider the following toy problem. There are $m$ rectangles and $n$ points on the plane. Each rectangle $R$ is a consumer with budget $B_R$, who is interested in purchasing the cheapest item (point) inside R, given that she has enough…
Let X be a smooth complex algebraic variety with the Zariski topology, and let Y be the underlying complex manifold with the complex topology. Grothendieck's algebraic de Rham theorem asserts that the singular cohomology of Y with complex…
Harvey Friedman, in his remarkable paper Finite functions and the necessary use of large cardinals, Ann. Math. 148:803-893, 1998 and in a technical report, Applications of large cardinals to graph theory, Ohio State University, 1997,…
Gradient-based dimension reduction decreases the cost of Bayesian inference and probabilistic modeling by identifying maximally informative (and informed) low-dimensional projections of the data and parameters, allowing high-dimensional…
It is known that solutions of the KZ equations can be written in the form of multidimensional hypergeometric integrals. In 2017 in a joint paper of the author with V. Schechtman the construction of hypergeometric solutions was modified, and…
In a recent issue of this journal, Mordukhovich et al.\ pose and solve an interesting non-differentiable generalization of the Heron problem in the framework of modern convex analysis. In the generalized Heron problem one is given $k+1$…
A Hardy space approach to the Nyman-Beurling and B\'aez-Duarte criterion for the Riemann Hypothesis (RH) was introduced recently in [18] and further developed in [13]. It states that the RH holds if and only if a particular sequence of…
Jarnik's identity plays a major role in classical simultaneous approximation to two real numbers. O. German [2] has shown a generalization to the weighted setting in which the identity has to be replaced by two inequalities. His methods…
In the application of the Deift-Zhou steepest descent method to the Riemann-Hilbert problem for orthogonal polynomials, a model Riemann-Hilbert problem that appears in the multi-cut case is solved with the use of hyperelliptic theta…
This paper concerns the a priori generalization analysis of the Deep Ritz Method (DRM) [W. E and B. Yu, 2017], a popular neural-network-based method for solving high dimensional partial differential equations. We derive the generalization…
Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…
Hypertree decompositions, as well as the more powerful generalized hypertree decompositions (GHDs), and the yet more general fractional hypertree decompositions (FHD) are hypergraph decomposition methods successfully used for answering…
We find general parameterizations for generic off-diagonal spacetime metrics and matter sources in general relativity (GR) and modified gravity theories when the field equations decouple with respect to certain types of nonholonomic frames…
In the Euclidean setting, the proximal gradient method and its accelerated variants are a class of efficient algorithms for optimization problems with decomposable objective. In this paper, we develop a Riemannian proximal gradient method…
We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…
We study a basic algorithmic problem in algebraic geometry, which we call NNL, of constructing a normalizing map as per Noether's Normalization Lemma. For general explicit varieties, as formally defined in this paper, we give a randomized…
Assuming the Generalized Riemann Hypothesis, Bach has shown that one can calculate the residue of the Dedekind zeta function of a number field K by a clever use of the splitting of primes p < X, with an error asymptotically bounded by 8.33…