Related papers: Proof of a Combinatorial Conjecture Coming from th…

We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several…

We measure whether there are numerous pairs of twin primes (hereafter referred to as twin prime pairs) according to the prime number inferred by sieve of Eratosthenes. In this study, we reveal at least three additional twin prime pairs…

A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…

We prove two polynomial identities which are particular cases of a conjecture arising in the theory of L-functions of twisted Carlitz modules. This conjecture is stated in earlier papers of the second author.

In this paper, we employ the theories and techniques of hypergeometric functions to provide two distinct proofs of the conjectured identities involving multiple Ap\'ery-like series with central binomial coefficients and multiple harmonic…

The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two prime numbers. This conjecture was first proposed by German mathematician Christian Goldbach in 1742 and, despite being obviously true,…

Composite likelihood provides approximate inference when the full likelihood is intractable and sub-likelihood functions of marginal events can be evaluated relatively easily. It has been successfully applied for many complex models.…

The classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then it is placed into the framework of evidence theory. Several authors like Laskey, Lehner (1989) and Provan (1990) already…

We present finitary formulations of two well known results concerning infinite series, namely Abel's theorem, which establishes that if a series converges to some limit then its Abel sum converges to the same limit, and Tauber's theorem,…

We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.

Recently, Chen, Hou and Jin used both Abel's lemma on summation by parts and Zeilberger's algorithm to generate recurrence relations for definite summations. Meanwhile, they proposed the Abel-Gosper method to evaluate some indefinite sums…

Using elementary means, we prove several identities involving the M\"obius function, generalizing in the multidimensional case well-known formulas coming from convolution arguments.

In this paper we consider the following conjecture, proposed by Brian Alspach, concerning partial sums in finite cyclic groups: given a subset $A$ of $\mathbb{Z}_n\setminus \{0\}$ of size $k$ such that $\sum_{z\in A} z\not= 0$, it is…

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

The Bayesian Classification represents a supervised learning method as well as a statistical method for classification. Assumes an underlying probabilistic model and it allows us to capture uncertainty about the model in a principled way by…

This paper is about the recent notion of computably probably approximately correct learning, which lies between the statistical learning theory where there is no computational requirement on the learner and efficient PAC where the learner…

We upgrade [1] to a complete proof of the conjecture NP = PSPACE. [1]: L. Gordeev, E. H. Haeusler, Proof Compression and NP Versus PSPACE, Studia Logica (107) (1): 55-83 (2019)

We derive PAC-Bayesian learning guarantees for heavy-tailed losses, and obtain a novel optimal Gibbs posterior which enjoys finite-sample excess risk bounds at logarithmic confidence. Our core technique itself makes use of PAC-Bayesian…

Let $p$ be a prime. Let $A$ and $B$, $A \ge B \ge 0$, be integers with base $p$ expansions $A = \alpha_i\alpha_{i-1}\dots \alpha_0$ and $B = \beta_i\beta_{i-1}\dots \beta_0$. Lucas proved that $$\binom{A}{B} \equiv…

We propose data-dependent uniform generalization bounds by approaching the problem from a PAC-Bayesian perspective. We first apply the PAC-Bayesian framework on "random sets" in a rigorous way, where the training algorithm is assumed to…