Related papers: A Complete Congruence System for the Erdos-Straus …
In this paper, a simple explanation for the Goldbach Conjecture is given. We have shown that the probability of violating the conjecture not only for the prime numbers, but also for any subset of natural numbers whose distribution is…
A new definition of prime congruences in additively idempotent semirings is given using twisted products. This class turns out to exhibit some analogous properties to the prime ideals of commutative rings. In order to establish a good…
We investigate the famous conjecture by Erd\H os-Simonovits and Sidorenko using information theory. Our method gives a unified treatment for all known cases of the conjecture and it implies various new results as well. Our topological type…
Consensus is a well-studied problem in distributed sensing, computation and control, yet deriving useful and easily computable bounds on the rate of convergence to consensus remains a challenge. This paper discusses the use of seminorms for…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…
After surveying classical results, we introduce a generalized notion of inference system to support structural recursion on non-well-founded data types. Besides axioms and inference rules with the usual meaning, a generalized inference…
A numeral system is an infinite sequence of different closed normal $\lambda$-terms intended to code the integers in $\lambda$-calculus. H. Barendregt has shown that if we can represent, for a numeral system, the functions : Successor,…
In this paper we study pattern-replacement equivalence relations on the set $S_n$ of permutations of length $n$. Each equivalence relation is determined by a set of patterns, and equivalent permutations are connected by pattern-replacements…
In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…
We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.
The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…
The asymptotically optimal hypothesis testing problem with the general sources as the null and alternative hypotheses is studied under exponential-type error constraints on the first kind of error probability. Our fundamental philosophy in…
We consider complete convergence and closely related Hsu-Robbins-Erdos-Spitzer-Baum-Katz series for sums whose terms are elements of a linear 2-nd order autoregressive sequences of random variables and prove sufficient conditions for the…
Euler had considered the problem of finding three integers whose sum, product, and also the sum of the products of the integers, taken two at a time, are all perfect squares. Euler's methods of solving the problem lead to parametric…
The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system…
By means of the generating function method, a linear recurrence relation is explicitly resolved. The solution is expressed in terms of the Stirling numbers of both the first and the second kind. Two remarkable pairs of combinatorial…