Related papers: Proof of a Combinatorial Conjecture Coming from th…
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
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…
We prove two multivariate $q$-binomial identities conjectured by Bousseau, Brini and van Garrel [Geom. Topol. 28 (2024), 393-496, arXiv:2011.08830] which give generating series for Gromov-Witten invariants of two specific log Calabi-Yau…
Approximate Bayesian computation (ABC) has become an essential tool for the analysis of complex stochastic models when the likelihood function is numerically unavailable. However, the well-established statistical method of empirical…
Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…
Goldwasser et al. (2021) recently proposed the setting of PAC verification, where a hypothesis (machine learning model) that purportedly satisfies the agnostic PAC learning objective is verified using an interactive proof. In this paper we…
"Goldbach's Conjecture" proven by analysis of how all combinations of the odd primes, summed in pairs, generates all of the even numbers.
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.…
In this note, we confirm two conjectural supercongruences on double sums of binomial coefficients due to El Bachraoui.
We use the PAC-Bayesian theory for the setting of learning-to-optimize. To the best of our knowledge, we present the first framework to learn optimization algorithms with provable generalization guarantees (PAC-Bayesian bounds) and explicit…
We give positive answer to two conjectures posed by M. E. H Ismail in his monograph [Classical and quantum orthogonal polynomials in one variable, Cambridge University Press, 2005].
We survey some of the mechanisms used to prove that naturally defined sequences in combinatorics are log-concave. Among these mechanisms are Alexandrov's inequality for mixed discriminants, the Alexandrov Fenchel inequality for mixed…
We prove some 3-adic congruences for binomial sums, which were conjectured by Sun.
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…
Subresultants of two univariate polynomials are one of the most classic and ubiquitous objects in computational algebra and algebraic geometry. In 1948, Habicht discovered and proved interesting relationships among subresultants. Those…
Paul Erdos claimed that mathematics is not yet ready to settle the 3x+1 conjecture. I agree, but very soon it will be! With the exponential growth of computer-generated mathematics, we (or rather our silicon brethrern) would have a shot at…
We present two related conjectures, arising in work on i-matchings in random r-regular bipartite graphs. The conjectures themselves are easily stated and involve only basic properties of convergent power series. One formulation involves…
In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
In 1977 Pohst conjectured a certain inequality for $n$ variables and give a computer-assisted proof for $n\leq 10$. We give a proof for all $n$ using a combinatorial argument. This inequality yields a better bound for the regulator in terms…