arXiv research

Computer-generated proofs led to a mathematical result.

The Goldman-Parker Conjecture classifies the complex hyperbolic C-reflection ideal triangle groups up to discreteness. We proved the Goldman-Parker Conjecture in [Ann. of Math. 153 (2001) 533--598] using a rigorous computer-assisted proof. In this paper we give a new and improved proof of the Goldman-Parker Conjecture.…

In this paper we give a simplified proof of the flat Grothendieck-Riemann-Roch theorem. The proof makes use of the local family index theorem and basic computations of the Chern-Simons form. In particular, it does not involve any adiabatic limit computation of the reduced eta-invariant.

Computational method finds examples of extremal hyperbolic surfaces.

We present a combinatorial proof for the existence of the sign refined grid homology in lens spaces, and a self contained proof that $\partial_{\mathbb{Z}}^2 = 0$. We also present a Sage program that computes $\widehat{\mathrm{GH}} (L(p,q),K;\mathbb{Z})$, and provide empirical evidence supporting the absence of torsion…

We provide a computer-assisted proof of the holomorphy of the quartic and the octic meromorphic differentials arising in the main Theorem 4.11 of our paper 'The Classification of Branched Willmore spheres in the $3$-Sphere and the $4$-Sphere' (arXiv:1706.01405), using the free mathematical software Sage.

Corrects a proof gap in the Morse lemma for hyperbolic spaces.

This note (originally from 2015) provides a proof of a 1985 conjecture of Montiel and Ros concerning the conformal volume of tori. This updated version adds a proof of the claim made in Remark 5 about the value of the conformal volume of tori in the cases not covered by the conjecture of Montiel and Ros. Originally, I …

We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.

Agol has conjectured that minimally twisted n-chain links are the smallest volume hyperbolic manifolds with n cusps, for n at most 10. In his thesis, Venzke mentions that these cannot be smallest volume for n at least 11, but does not provide a proof. In this paper, we give a proof of Venzke's statement for a number of…

Given a link $L$, the Blanchfield pairing $\operatorname{Bl}(L)$ is a pairing which is defined on the torsion submodule of the Alexander module of $L$. In some particular cases, namely if $L$ is a boundary link or if the Alexander module of $L$ is torsion, $\operatorname{Bl}(L)$ can be computed explicitly; however no f…

We expose (without proofs) a unified computational approach to integrable structures (including recursion, Hamiltonian, and symplectic operators) based on geometrical theory of partial differential equations. We adopt a coordinate based approach and aim to provide a tutorial to the computations.

We provide a proof of backpropagation algorithm in matrix notation.

Machine learning improves searching for polynomial proofs.

In this paper, we give proofs of the family index formula and the equivariant family index formula by the Greiner's approach to heat kernel asymptotics. We compute equivariant family JLO characters. We also define the equivariant eta form and give a proof of its regularity.

We give a constructive proof that the Regge symmetry is a scissors congruence in hyperbolic space. The main tool is Leibon's construction for computing the volume of a general hyperbolic tetrahedron. The proof consists of identifying the key elements in Leibon's construction and permuting them.

Paper introduces proof-of-learning to verify ML model training.

New proof of Milnor-Wood inequality for circle bundles.

Via a computer search, Altshuler and Steinberg found that there are 1296 +1 combinatorial 3-manifolds on nine vertices, of which only one is non-sphere. This exceptional 3-manifold $K^{3}_{9}$ triangulates the twisted $S^{2}$-bundle over $S^{1}$. It was first constructed by Walkup. In this paper, we present a computer-…

We prove a local index formula in conformal geometry by computing the Connes-Chern character for the conformal Dirac (twisted) spectral triple recently constructed by Connes-Moscovici. Following an observation of Moscovici, the computation reduces to the computation of the CM cocycle of an equivariant Dirac (ordinary) …

New spoofing strategies show PoL verification is more vulnerable than previously thought.

The earlier article tried to construct an algorithm to compute the Heegaard Floer homology \hat{HF}(Y) for a 3-manifold Y. However there is an error in a proof which the author, as of now, is unable to fix.

New proof shows efficient ReLU networks for piecewise linear functions.

In this note, we present a new method for computing fundamental groups of curve complements using a variation of the Zariski-Van Kampen method on general ruled surfaces. As an application we give an alternative (computation-free) proof for the fundamental group of generic $(p,q)$-torus curves.

Unified framework for geometric computation of minimum-area homotopy.

Simple proof for sphere mass calculation.

Researchers compute mod 2 Seiberg-Witten invariants for spin structures and families.

This paper is the second part of a series of papers on noncommutative geometry and conformal geometry. In this paper, we compute explicitly the Connes-Chern character of an equivariant Dirac spectral triple. The formula that we obtain for which was used in the first paper of the series. The computation has two main ste…

Sarkar and Wang have given a combinatorial algorithm for computing Heegaard Floer homology and Plamenevskaya has improved their method to compute Ozsvath-Szabo invariant. In this paper, applying the combinatorial method to stabilizations of an open book, we prove basic properties of Ozsvath-Szabo invariant.

New proof of a 111-year-old result using gauge theory.

The paper is a summary of the results of the authors concerning computations of symplectic invariants of Weinstein manifolds and contains some examples and applications. Proofs are sketched. The detailed proofs will appear in our forthcoming paper. In the Appendix written by S. Ganatra and M. Maydanskiy it is shown tha…

The key cryptographic protocols used to secure the internet and financial transactions of today are all susceptible to attack by the development of a sufficiently large quantum computer. One particular area at risk are cryptocurrencies, a market currently worth over 150 billion USD. We investigate the risk of Bitcoin, …

A few years ago Kramer and Laubenbacher introduced a discrete notion of homotopy for simplicial complexes. In this paper, we compute the discrete fundamental group of the order complex of the Boolean lattice. As it turns out, it is equivalent to computing the discrete homotopy group of the 1-skeleton of the permutahedr…

We present a short analytic proof of the equality between the analytic and combinatorial torsion. We use the same approach as in the proof given by Burghelea, Friedlander and Kappeler, but avoid using the difficult Mayer-Vietoris type formula for the determinants of elliptic operators. Instead, we provide a direct way …

We give a computer free proof of the Deligne, Cohen and deMan formulas for the dimensions of the irreducible $g$-modules appearing in the tensor powers of $g$, where $g$ ranges over the exceptional complex simple Lie algebras. We give additional dimension formulas for the exceptional series, as well as uniform dimensio…

In this paper we prove the validity of a formula for computing the Alexander invariant which was originally conjectured by Bar-Natan and Dancso in [BND].

We give a new short proof of the index formula of Atiyah and Singer based on combining Getzler's rescaling with Greiner's approach of the heat kernel asymptotics. As application we can easily compute the Connes-Moscovici cyclic cocycle of even and odd Dirac spectral triples, and then recover the Atiyah-Singer index for…

The computation of the index of the Hessian of the action functional in semi-Riemannian geometry at geodesics with two variable endpoints is reduced to the case of a fixed final endpoint. Using this observation, we give an elementary proof of the Morse Index Theorem for Riemannian geodesics with two variable endpoints,…

Abstract commensurators of surface groups contain specific Baumslag-Solitar groups and are computationally accessible.

We prove a reciprocity formula between Gauss sums that is used in the computation of certain quantum invariants of 3-manifolds. Our proof uses the discriminant construction applied to the tensor product of lattices.

Formalizes vNM utility theorem using Lean 4, proving existence and uniqueness.

New proof of Gaffney's inequality for differential forms on manifolds with boundary.

New proof of Lie-Tresse theorem with computational advantages.

Estimation is the computational task of recovering a hidden parameter $x$ associated with a distribution $D_x$, given a measurement $y$ sampled from the distribution. High dimensional estimation problems arise naturally in statistics, machine learning, and complexity theory. Many high dimensional estimation problems ca…

Simplified proof for approximations of set systems.

No standard compact Clifford-Klein forms found for exceptional Lie groups.

We give the first rigorous proof of the convergence of Riemannian Hamiltonian Monte Carlo, a general (and practical) method for sampling Gibbs distributions. Our analysis shows that the rate of convergence is bounded in terms of natural smoothness parameters of an associated Riemannian manifold. We then apply the metho…

We propose a general framework for studying pseudo-Anosov homeomorphisms on translation surfaces. This new approach, among other consequences, allows us to compute the systole of the Teichmueller geodesic flow restricted to the hyperelliptic connected components, settling a question of Farb. We stress that all proofs a…