Related papers: The solution of the Brannan conjecture
We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.
Total probability and Bayes formula are two basic tools for using prior information in the Bayesian statistics. In this paper we introduce an alternative tool for using prior information. This new toold enables us to improve some…
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].
The method of brackets is a method for the evaluation of definite integrals based on a small number of rules. This is employed here for the evaluation of Mellin-Barnes integral. The fundamental idea is to transform these integral…
Maclaurin Integration is a new series-based technique for solving infamously difficult integrals in terms of elementary functions. It has fairly liberal conditions for sound use, making it one of the most versatile integration techniques.…
The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…
In this paper, we develop the method of circle of partitions and associated statistics. As an application we prove conditionally the binary Goldbach conjecture. We develop a series of steps to prove the binary Goldbach conjecture in full.…
We prove Burkholder inequality using Bregman divergence.
We provide the detailed proof of a strengthened version of the M. Artin Approximation Theorem.
In this paper we study the integrals of fractional parts of given functions, and develop some new tools to understand the behaviour of prime differences. We demonstrate how simply some seemingly difficult conjectures related to prime…
The purpose of this article is threefold. First, it provides the reader with a few useful and efficient tools which should enable her/him to evaluate nontrivial determinants for the case such a determinant should appear in her/his research.…
We prove a binomial formula for Macdonald polynomials and consider applications of it.
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.
This is a summary of the proof of BAB conjecture. All material are taken from the two BAB paper in the reference. The aim of this summary is to help reader to understand the more technical side of the proof of BAB.
We use machine learning to classify examples of braids (or flat braids) as trivial or non-trivial. Our ML takes form of supervised learning using neural networks (multilayer perceptrons). When they achieve good results in classification, we…
We present a formulation of the Collatz conjecture that is potentially more amenable to modeling and analysis by automated termination checking tools.
We use the Gromov-Witten invariants and a nonsqueezing theorem by the author to affirm a conjecture by P.Biran on the Lagrangian barriers.
We describe an approach to the circulant Hadamard conjecture based on Walsh-Fourier analysis. We show that the existence of a circulant Hadamard matrix of order $n$ is equivalent to the existence of a non-trivial solution of a certain…
Both uncertainty estimation and interpretability are important factors for trustworthy machine learning systems. However, there is little work at the intersection of these two areas. We address this gap by proposing a novel method for…
In this survey, we give a short overview of the recent progress on the multidimensional L2 conjecture. It can also serve as an introduction to the subject.