Abelian Groups With Partial Decomposition Bases In LΔ∞Ω, Part I, 2012 Jacoby Consulting
Abelian Groups With Partial Decomposition Bases In LΔ∞Ω, Part I, Carol Jacoby, Katrin Leistner, Peter Loth, Lutz Strungmann
Mathematics Faculty Publications
We consider the class of abelian groups possessing partial decomposition bases in Lδ∞ω for δ an ordinal. This class contains the class of Warfield groups which are direct summands of simply presented groups or, alternatively, are abelian groups possessing a nice decomposition basis with simply presented cokernel. We prove a classification theorem using numerical invariants that are deduced from the classical Ulm-Kaplansky and Warfield invariants. This extends earlier work by Barwise-Eklof, Göbel and the authors.
Distribution Of Prime Numbers,Twin Primes And Goldbach Conjecture, 2011 SelectedWorks
Distribution Of Prime Numbers,Twin Primes And Goldbach Conjecture, Subhajit Kumar Ganguly
Subhajit Kumar Ganguly
The following paper deals with the distribution of prime numbers, the twin prime numbers and the Goldbach conjecture. Starting from the simple assertion that prime numbers are never even, a rule for the distribution of primes is arrived at. Following the same approach, the twin prime conjecture and the Goldbach conjecture are found to be true.
The Mathematical Landscape, 2011 Claremont McKenna College
The Mathematical Landscape, Antonio Collazo
CMC Senior Theses
The intent of this paper is to present the reader will enough information to spark a curiosity in to the subject. By no means is the following a complete formulation of any of the topics covered. I want to give the reader a tour of the mathematical landscape. There are plenty of further details to explore in each section, I have just touched the tip the iceberg. The work is basically in four sections: Numbers, Geometry, Functions, Sets and Logic, which are the basic building blocks of Math. The first sections are a exposition into the mathematical objects and their ...
Morphogrammatics Of Reflection, 2010 ThinkArt Lab Glasgow
Morphogrammatics Of Reflection, Rudolf Kaehr
Turning back from the studies of morphogrammatics to some open questions of reflectional programming, the recountered problematics might be put into a different light and new methods of handling formal aspects of reflection and reflectionality shall be introduced. Albeit the use of light-metaphors, morphogrammatic reflection is not sketched along the paradigm of optical metaphors. Morphograms are presenting neither propositions nor perceptions able for mirroring (representation). Exercises in defining morphogrammatic retro-grade recursion and reflection schemata are continued from the paper “Sketches to Morphogrammatic Programming”.
Memristics: Memristors, Again? – Part Ii, How To Transform Wired ‘Translations’ Between Crossbars Into Interactions?, Rudolf Kaehr
The idea behind this patchwork of conceptual interventions is to show the possibility of a “buffer-free” modeling of the crossbar architecture for memristive systems on the base of a purely difference-theoretical approach. It is considered that on a nano-electronic level principles of interpretation appears as mechanisms of complementarity. The most basic conceptual approach to such a complementarity is introduced as an interchangeability of operators and operands of an operation. Therefore, the architecture of crossbars gets an interpretation as complementarity between crossbar functionality and “buffering” translation functionality. That is, the same matter functions as operator and at once, as operand – and ...
Memristics: Memristors, Again?, 2010 ThinkArt Lab Glasgow
Memristics: Memristors, Again?, Rudolf Kaehr
This collection gives first and short critical reflections on the concepts of memristics, memristors and memristive systems and the history of similar movements with an own focus on a possible interplay between memory and computing functions, at once, at the same place and time, to achieve a new kind of complementarity between computation and memory on a single chip without retarding buffering conditions.
The Four-Color Theorem And Chromatic Numbers Of Graphs, 2010 Lynchburg College
The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates
Undergraduate Theses and Capstone Projects
We study graph colorings of the form made popular by the four-color theorem. Proved by Appel and Haken in 1976, the Four-Color Theorem states that all planar graphs can be vertex-colored with at most four colors. We consider an alternate way to prove the Four-Color Theorem, introduced by Hadwiger in 1943 and commonly know as Hadwiger’s Conjecture. In addition, we examine the chromatic number of graphs which are not planar. More specifically, we explore adding edges to a planar graph to create a non-planar graph which has the same chromatic number as the planar graph which we started from.
Towards A Formal Theory Of Interoperability, 2010 Old Dominion University
Towards A Formal Theory Of Interoperability, Saikou Y. Diallo
Computational Modeling and Simulation Engineering Theses & Dissertations
This dissertation proposes a formal theory of interoperability that explains 1) what interoperability is as opposed to how it works, 2) how to tell whether two or more systems can interoperate and 3) how to identify whether systems are interoperating or merely exchanging bits and bytes. The research provides a formal model of data in M&S that captures all possible representations of a real or imagined thing and distinguishes between existential dependencies and transformational dependencies. Existential dependencies capture the relationships within a model while transformational dependencies capture the relationships between interactions with a model. These definitions are used to ...
Sketch Of A Typology Of Abstract Memristic Machines, 2010 ThinkArt Lab Glasgow
Sketch Of A Typology Of Abstract Memristic Machines, Rudolf Kaehr
A typology of memristic machines is sketched. This sketch gives an overview and orientation to the paper “Towards Abstract Memristic Machines”. It also intents to propose a concise systematization of the newly introduced terms and strategies to memristics and morphogrammatics. This sketch is introducing four types of sign-use for four types of machines of fundamentally different paradigms: 1. semiotic, 2. monomorphic, 3. polymorphic and 4. bisimilar abstract machines. Further definitions of abstract machines have to be based on those graphematic notational systems. A realization of such constructions of abstract machines, in contrast to existing abstract machines of the theory of ...
Towards Abstract Memristic Machines, 2010 ThinkArt Lab Glasgow
Towards Abstract Memristic Machines, Rudolf Kaehr
No abstract provided.
From Universe To Polyverses, 2010 ThinkArt Lab Glasgow
From Universe To Polyverses, Rudolf Kaehr
Some thoughts about the power of speculation behind important discoveries in mathematics, physics and computer science. The exercise shows that there is no need for a compulsory ultimate unifying universe. It is speculated that just this paradigm of a single ultimate universe is unmasking itself today as the main obstacle for further development in Western science and technology.
Morphogrammatics For Dummies: The Domino Approach, 2010 ThinkArt Lab Glasgow
Morphogrammatics For Dummies: The Domino Approach, Rudolf Kaehr
Dominoes, morphograms, cellular automata, memristics. Topics: possible continuation, coalitions, cooperations, substitution, morphic bisimilarity.
Multiscale Landform Characterization For Land Use Evaluation Using Fuzzy Sets, 2010 University of Colorado at Boulder
Multiscale Landform Characterization For Land Use Evaluation Using Fuzzy Sets, Andrew R. Bock
Geography Graduate Theses & Dissertations
A multi-scale geomorphometric landform model was created through the use of fuzzy semantic import models and fuzzy overlay to measure distribution of landforms within parcels of the Conservation Reserve Program in a portion of the Delaware River Sub-basin in Northeast Kansas. Different fuzzy logic operators (intersect, algebraic mean, and fuzzy gamma) were used to test the impact of different model mechanisms on the resulting distributions of crisp and fuzzy membership values, and classification uncertainty measured by entropy values. Across scales (900 m2 to 16,900 m2 window sizes), only one crisp class (drainages) showed an optimal scale for detection area ...