We propose a digit-recurrence algorithm for division in real and complex number domains using a variable radix. The objective of the approach is to simplify the prescaling of the ...
A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the ...
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
In this paper, we develop a method to count the number of spanning trees in certain classes of double fixed-step loop networks with nonconstant steps. More specifically our techni...
Abstract. New enumerating functions for the Euler numbers are considered. Several of the relevant generating functions appear in connection to entries in Ramanujan’s Lost Noteboo...