We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
Abstract. In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalizati...
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Much research concerning Satisfiability Modulo Theories is devoted to the design of efficient SMT-solvers that integrate a SATsolver with T -satisfiability procedures. The rewrite-...
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...