18,024 research outputs found

    Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays

    Full text link
    The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree. The result is obtained in three steps: first, by computing an independent set of generators for the d-space partition induced by the input; then, by reducing the solid expression to an equivalent logical formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. This method is implemented in Julia using sparse arrays. The computational evaluation of every possible solid expression, usually denoted as CSG (Constructive Solid Geometry), is reduced to an equivalent logical expression of a finite set algebra over the cells of a space partition, and solved by native bitwise operators.Comment: revised version submitted to Computer-Aided Geometric Desig

    Higher dimensional Automorphic Lie Algebras

    Get PDF
    The paper presents the complete classification of Automorphic Lie Algebras based on sln(C)\mathfrak{sl}_n (\mathbb{C}), where the symmetry group GG is finite and the orbit is any of the exceptional GG-orbits in C‾\overline{\mathbb{C}}. A key feature of the classification is the study of the algebras in the context of classical invariant theory. This provides on one hand a powerful tool from the computational point of view, on the other it opens new questions from an algebraic perspective, which suggest further applications of these algebras, beyond the context of integrable systems. In particular, the research shows that Automorphic Lie Algebras associated to the TOY\mathbb{T}\mathbb{O}\mathbb{Y} groups (tetrahedral, octahedral and icosahedral groups) depend on the group through the automorphic functions only, thus they are group independent as Lie algebras. This can be established by defining a Chevalley normal form for these algebras, generalising this classical notion to the case of Lie algebras over a polynomial ring.Comment: 43 pages, standard LaTeX2

    Relational Parametricity for Computational Effects

    Get PDF
    According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relational parametricity, introduced by Reynolds, is one possible mathematical formulation of this idea. Relational parametricity provides a powerful tool for establishing data abstraction properties, proving equivalences of datatypes, and establishing equalities of programs. Such properties have been well studied in a pure functional setting. Many programs, however, exhibit computational effects, and are not accounted for by the standard theory of relational parametricity. In this paper, we develop a foundational framework for extending the notion of relational parametricity to programming languages with effects.Comment: 31 pages, appears in Logical Methods in Computer Scienc

    A Broad Class of Discrete-Time Hypercomplex-Valued Hopfield Neural Networks

    Full text link
    In this paper, we address the stability of a broad class of discrete-time hypercomplex-valued Hopfield-type neural networks. To ensure the neural networks belonging to this class always settle down at a stationary state, we introduce novel hypercomplex number systems referred to as real-part associative hypercomplex number systems. Real-part associative hypercomplex number systems generalize the well-known Cayley-Dickson algebras and real Clifford algebras and include the systems of real numbers, complex numbers, dual numbers, hyperbolic numbers, quaternions, tessarines, and octonions as particular instances. Apart from the novel hypercomplex number systems, we introduce a family of hypercomplex-valued activation functions called B\mathcal{B}-projection functions. Broadly speaking, a B\mathcal{B}-projection function projects the activation potential onto the set of all possible states of a hypercomplex-valued neuron. Using the theory presented in this paper, we confirm the stability analysis of several discrete-time hypercomplex-valued Hopfield-type neural networks from the literature. Moreover, we introduce and provide the stability analysis of a general class of Hopfield-type neural networks on Cayley-Dickson algebras

    Yang-Baxter Equations, Computational Methods and Applications

    Full text link
    Computational methods are an important tool for solving the Yang-Baxter equations(in small dimensions), for classifying (unifying) structures, and for solving related problems. This paper is an account of some of the latest developments on the Yang-Baxter equation, its set-theoretical version, and its applications. We construct new set-theoretical solutions for the Yang-Baxter equation. Unification theories and other results are proposed or proved.Comment: 12 page

    Modal Ω-Logic: Automata, Neo-Logicism, and Set-Theoretic Realism

    Get PDF
    This essay examines the philosophical significance of Ω\Omega-logic in Zermelo-Fraenkel set theory with choice (ZFC). The duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The modal profile of Ω\Omega-logical validity can then be countenanced within a coalgebraic logic, and Ω\Omega-logical validity can be defined via deterministic automata. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal profiles of Ω\Omega-logical validity correspond to those of second-order logical consequence, Ω\Omega-logical validity is genuinely logical, and thus vindicates a neo-logicist conception of mathematical truth in the set-theoretic multiverse. Second, the foregoing provides a modal-computational account of the interpretation of mathematical vocabulary, adducing in favor of a realist conception of the cumulative hierarchy of sets
    • …
    corecore