10 citations · 15 across the 4 of their papers we have counts for
6 papers
A constructive two-parameter Ramsey increment
Milos Tatarevic
We prove the inequality for classical Ramsey numbers, valid for all , and formalize the proof in Lean 4. As a consequence, we obtai…
Improved algorithms for left factorial residues
Vladica Andrejić, Alin Bostan, Milos Tatarevic
We present improved algorithms for computing the left factorial residues . We use these algorithms for the calculation of the residues , f…
On distinct residues of factorials
Vladica Andrejić, Milos Tatarevic
We investigate the existence of primes for which the residues of , , \dots, modulo are all distinct. We describe the connection between this problem an…
New Lower Bounds for 28 Classical Ramsey Numbers
Geoffrey Exoo, Milos Tatarevic
We establish new lower bounds for classical two and three color Ramsey numbers, and describe the heuristic search procedures we used. Several of the new three color bounds are…
On Limits of Dense Packing of Equal Spheres in a Cube
Milos Tatarevic
We examine packing of congruent spheres in a cube when is close but less than the number of spheres in a regular cubic close-packed (ccp) arrangement of $\lceil p^{3}/2\rce…
Searching for a counterexample to Kurepa's Conjecture
Vladica Andrejić, Milos Tatarevic
Kurepa's conjecture states that there is no odd prime that divides . We search for a counterexample to this conjecture for all . We introduce…