61,315 research outputs found

    Apocalyptic Beauty

    Get PDF
    A potent and formative text for a theological aesthetics faithful to the God revealed in the Scriptures is the Apocalypse of John (Revelation). An apocalyptic viewpoint is beautiful inasmuch as it observes the whole from within the part of time/space and inasmuch as the apocalyptic vision provides considerable unity of diverse theological themes with various expansions and enhancements, hence mimicking the very function of theological beauty to communicate the whole (God) in the part (here, in space-time). This essay traces major themes throughout Scripture, utilizing inter-textual interpretation en route, and seeks to clarify the Book of Revelation\u27s role in recapitulation, consummation, and consolation (i.e. beauty). Commenting on how the Apocalypse meets the criteria for being theologically beautiful, this essay then seeks to show how this role of beauty--and in particular, consolation--attracted the early Christian devotees visiting/dwelling-in the catacombs (A.D. 150-500) to make the Apocalypse of John one of the major contributors to their artwork

    Congruence Lattices of Certain Finite Algebras with Three Commutative Binary Operations

    Full text link
    A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that every finite distributive lattice is representable, seen as a special case of the Finite Lattice Representation Problem. The construction of this proof brings together Birkhoff's representation theorem for finite distributive lattices, an emphasis on boolean lattices when representing finite lattices, and a perspective based on inequalities of partially ordered sets. It may be possible to generalize the techniques used in this approach. Other than the aforementioned representation theorem only elementary tools are used for the two theorems of this note. In particular there is no reliance on group theoretical concepts or techniques (see P\'eter P\'al P\'alfy and Pavel Pud\'lak), or on well-known methods, used to show certain finite lattice to be representable (see William J. DeMeo), such as the closure method

    Molecular Biology at the Quantum Level: Can Modern Density Functional Theory Forge the Path?

    Full text link
    Recent years have seen vast improvements in the ability of rigorous quantum-mechanical methods to treat systems of interest to molecular biology. In this review article, we survey common computational methods used to study such large, weakly bound systems, starting from classical simulations and reaching to quantum chemistry and density functional theory. We sketch their underlying frameworks and investigate their strengths and weaknesses when applied to potentially large biomolecules. In particular, density functional theory---a framework that can treat thousands of atoms on firm theoretical ground---can now accurately describe systems dominated by weak van der Waals interactions. This newfound ability has rekindled interest in using this tried-and-true approach to investigate biological systems of real importance. In this review, we focus on some new methods within density functional theory that allow for accurate inclusion of the weak interactions that dominate binding in biological macromolecules. Recent work utilizing these methods to study biologically-relevant systems will be highlighted, and a vision for the future of density functional theory within molecular biology will be discussed

    The mm-colored composition poset

    Full text link
    We generalize Bj\"{o}rner and Stanley's poset of compositions to mm-colored compositions. Their work draws many analogies between their (1-colored) composition poset and Young's lattice of partitions, including links to (quasi-)symmetric functions and representation theory. Here we show that many of these analogies hold for any number of colors. While many of the proofs for Bj\"{o}rner and Stanley's poset were simplified by showing isomorphism with the subword order, we remark that with 2 or more colors, our posets are not isomorphic to a subword order.Comment: 12 pages, 1 figur
    corecore