English
Related papers

Related papers: G\"odel algebras: interactive dualities and their …

200 papers

We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause…

cmp-lg · Computer Science 2016-08-31 Mary Dalrymple , Stuart M. Shieber , Fernando C. N. Pereira

We give a construction of an affine Hecke algebra associated to any Coxeter group acting on an abelian variety by reflections; in the case of an affine Weyl group, the result is an elliptic analogue of the usual double affine Hecke algebra.…

Algebraic Geometry · Mathematics 2020-11-06 Eric M. Rains

We give a complete picture of the interaction between Koszul and Ringel dualities for quasi-hereditary algebras admitting linear tilting (co)resolutions of standard and costandard modules. We show that such algebras are Koszul, that the…

Representation Theory · Mathematics 2010-04-02 Volodymyr Mazorchuk

In this paper we consider an approach where both propositions and the accessibility relation are infinitely many-valued over G\"{o}del algebras. In particular, we consider separately the $\Box $-fragment and the $\Diamond $-fragment of our…

Logic · Mathematics 2009-03-17 Xavier Caicedo , Ricardo Oscar Rodriguez

This paper introduces and investigates some properties of algebras constructed from the algebra of polynomials via derivation and integration operators using a process presented by Dzhumadildaev in a previous work. In particular, we…

Rings and Algebras · Mathematics 2026-03-24 Ivan Kaygorodov , Naurizbay Uzakbaev

This paper proposes to use dialgebras to specify the semantics of interactive systems in a natural way. Dialgebras are a conservative extension of coalgebras. In this categorical model, from the point of view that we provide, the notions of…

Programming Languages · Computer Science 2011-08-03 Vincenzo Ciancia

We investigate in a method for proving separation results for abstract classes of languages. A well established method to characterize varieties of regular languages are identities. We use a recently established generalization of these…

Computational Complexity · Computer Science 2015-10-19 Silke Czarnetzki , Andreas Krebs

Hexahedral meshes are an ubiquitous domain for the numerical resolution of partial differential equations. Computing a pure hexahedral mesh from an adaptively refined grid is a prominent approach to automatic hexmeshing, and requires the…

Graphics · Computer Science 2022-09-07 Marco Livesu , Luca Pitzalis , Gianmarco Cherchi

Geometric (Clifford) algebra provides an efficient mathematical language for describing physical problems. We formulate general relativity in this language. The resulting formalism combines the efficiency of differential forms with the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Matthew R. Francis , Arthur Kosowsky

A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…

Mathematical Physics · Physics 2015-09-30 Jose Fernandez Nunez , Wifredo Garcia Fuertes , Askold M. Perelomov

We adapt the algorithm of Kolesnikov and Pozhidaev, which converts a polynomial identity for algebras into the corresponding identities for dialgebras, to the Cayley-Dickson doubling process. We obtain a generalization of this process to…

Rings and Algebras · Mathematics 2012-09-13 R. Felipe-Sosa , R. Felipe , J. Sanchez-Ortega , M. R. Bremner , M. K. Kinyon

We introduce a periodic form of the iterated algebraic K-theory of ku, the (connective) complex K-theory spectrum, as well as a natural twisting of this cohomology theory by higher gerbes. Furthermore, we prove a form of topological…

Algebraic Topology · Mathematics 2020-03-25 John A. Lind , Hisham Sati , Craig Westerland

A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…

Logic in Computer Science · Computer Science 2011-07-08 Emmanuel Beffara

We regard explanations as a blending of the input sample and the model's output and offer a few definitions that capture various desired properties of the function that generates these explanations. We study the links between these…

Machine Learning · Computer Science 2020-01-16 Lior Wolf , Tomer Galanti , Tamir Hazan

We use one-dimensional double affine Hecke algebras to introduce q-counterparts of the Gauss integrals and new types of Gauss-Selberg sums at roots of unity.

Quantum Algebra · Mathematics 2007-05-23 Ivan Cherednik

We develop a systematic way for constructing bispectral algebras of commuting ordinary differential operators of any rank $N$. It combines and unifies the ideas of Duistermaat-Gr\"unbaum and Wilson. Our construction is completely…

q-alg · Mathematics 2009-10-30 B. Bakalov , E. Horozov , M. Yakimov

We endow the category of bialgebras over a pair of operads in distribution with a cofibrantly generated model category structure. We work in the category of chain complexes over a field of characteristic zero. We split our construction in…

Algebraic Topology · Mathematics 2013-09-27 Sinan Yalin

Let C_*(K) denote the cellular chains on the Stasheff associahedra. We construct an explicit combinatorial diagonal \Delta : C_*(K) --> C_*(K) \otimes C_*(K); consequently, we obtain an explicit diagonal on the A_\infty-operad. We apply the…

Algebraic Topology · Mathematics 2007-05-23 Samson Saneblidze , Ronald Umble

We introduce the category of Heyting frames and show that it is equivalent to the category of Heyting algebras and dually equivalent to the category of Esakia spaces. This provides a frame-theoretic perspective on Esakia duality for Heyting…

Logic · Mathematics 2023-02-17 Guram Bezhanishvili , Luca Carai , Patrick Morandi

This paper is about producing a new kind of the pairs which we call it MS-pairs. To produce these pairs, we use an algorithm for dividing a natural number $x$ by two for two arbitrary numbers and consider their related graphs. We present…

Cryptography and Security · Computer Science 2021-11-09 Mohammad Zeynali Azim , Saeid Alikhani , Babak Anari