Combinatorial and Automated Proofs of Certain Identities

First we wish to generalize and formalize the work of Chinneck and Dravnieks (1991) by focusing on the search of infeasible subset of inequalities that are irreducible with respect

Finally we show that an averaged strong form of Goldbach’s conjecture is equivalent to the Generalized Riemann Hypothesis; as well as a similar equivalence to estimates for the

“If we constructed two similar strips, and if we put the second one behind the first one returning it and making correspond 1 cell with 2n cell, it is evident that if Goldbach

Abstract In the computation of the intersection cohomology of Shimura varieties, or of the L 2 cohomology of equal rank locally symmetric spaces, combinatorial identities

Suppose that given x > 49 and using Sieve I we have a way to compute the number of permitted k-tuples whose indices lie in [1, x]; then, we could prove the main theorem

This article is inspired from the YouTube video “Ogni numero `e l’inizio di una potenza di 2” by MATH-segnale (www.youtube.com/mathsegnale) and from the article “Elk natuurlijk

In the present work, we define the prob- lem called the Minimum Receiver Problem (MRP) consisting in finding the minimum number of receivers needed for a given traffic matrix in

« The total grammatical complexity of any language, counting both morphology and syntax, is about the same as that of any other »..