It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
e than previously established, appearing at various levels of abstraction, in diverse systems and languages. The implications of this phenomenon cover various aspects of software e...
The Ohta-Kawasaki density functional theory of diblock copolymers gives rise to a nonlocal free boundary problem. Under a proper condition between the block composition fraction a...
For a complete lattice V which, as a category, is monoidal closed, and for a suitable Setmonad T we consider (T, V)-algebras and introduce (T, V)-proalgebras, in generalization of...
Maria Manuel Clementino, Dirk Hofmann, Walter Thol...
We present a new preconditioner for the iterative solution of linear systems of equations arising from discretizations of systems of first order partial differential equations (P...