Related papers: Probable Counterexamples of the ABC Conjecture

In many applications, it is important to be able to explain the decisions of machine learning systems. An increasingly popular approach has been to seek to provide \emph{counterfactual instance explanations}. These specify close possible…

For earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…

In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.

By presenting the proofs of a few sample results, we introduce the reader to the use of nonstandard analysis in aspects of combinatorics of numbers.

We study how well a real number can be approximated by sums of two or more rational numbers with denominators up to a certain size.

By suitable examples we illustrate an algorithm for composition of inverse problems.

In this paper, we study the reciprocal sums of the Jacobsthal numbers. We establish many results on the infinite sum and alternating infinite sum of the reciprocals of Jacobsthal numbers and square Jacobsthal numbers.

New cases of the multiplicity conjecture are considered.

Approximate Bayesian Computation (ABC) can be viewed as an analytic approximation of an intractable likelihood coupled with an elementary simulation step. Such a view, combined with a suitable instrumental prior distribution permits…

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

We revisit and generalize the concept of composite likelihood as a method to make a probabilistic inference by aggregation of multiple Bayesian agents, thereby defining a class of predictive models which we call composite Bayesian. This…

In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.

We use a probabilistic method to produce some combinatorial inequalities by considering pattern containment in permutations and words.

AI-driven outcomes can be challenging for end-users to understand. Explanations can address two key questions: "Why this outcome?" (factual) and "Why not another?" (counterfactual). While substantial efforts have been made to formalize…

In this note we give a counterexample to a conjecture proposed by Ciliberto about special linear systems of P^n through multiple base points.

In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the…

This paper provides a review of Approximate Bayesian Computation (ABC) methods for carrying out Bayesian posterior inference, through the lens of density estimation. We describe several recent algorithms and make connection with traditional…

Defeasible reasoning is the mode of reasoning where conclusions can be overturned by taking into account new evidence. A commonly used method in cognitive science and logic literature is to handcraft argumentation supporting inference…

The $abc$ conjecture states that there are only finitely many triples of coprime positive integers $(a,b,c)$ such that $a+b=c$ and $\operatorname{rad}(abc) < c^{1-\epsilon}$ for any $\epsilon > 0$. Using the optimized methods in a recent…

Expert systems applications that involve uncertain inference can be represented by a multidimensional contingency table. These tables offer a general approach to inferring with uncertain evidence, because they can embody any form of…