English
Related papers

Related papers: A complete axiomatisation of reversible Kleene lat…

200 papers

Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…

Algebraic Geometry · Mathematics 2007-05-23 Robert Friedman , John W. Morgan

We consider all 16 unary operations that, given a homogeneous binary relation R, define a new one by a boolean combination of xRy and yRx. Operations can be composed, and connected by pointwise-defined logical junctors. We consider the…

Logic · Mathematics 2021-02-11 Jochen Burghardt

We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…

Formal Languages and Automata Theory · Computer Science 2024-01-18 Juan Climent Vidal , Enric Cosme Llópez

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

Logic · Mathematics 2021-02-23 Laurent De Rudder , Alessandra Palmigiano

Analytical tools to $K$-theory; namely, self-stabilization of rapidly decreasing matrices, linearization of cyclic loops, and the contractibility of the pointed stable Toeplitz algebra are discussed in terms of concrete formulas. Adaptation…

K-Theory and Homology · Mathematics 2013-05-31 Gyula Lakos

It is shown that the coloured isomorphism class of a unital, simple, $\mathcal{Z}$-stable, separable amenable C$^*$-algebra satisfying the Universal Coefficient Theorem (UCT) is determined by its tracial simplex.

Operator Algebras · Mathematics 2022-04-14 Jeffrey Im , George A. Elliott

In this paper we study projective algebras in varieties of (bounded) commutative integral residuated lattices from an algebraic (as opposed to categorical) point of view. In particular we use a well-established construction in residuated…

Logic · Mathematics 2022-09-05 Paolo Aglianò , Sara Ugolini

Kleene algebra with tests (KAT) is a foundational equational framework for reasoning about programs, which has found applications in program transformations, networking and compiler optimizations, among many other areas. In his seminal…

Programming Languages · Computer Science 2022-08-08 Cheng Zhang , Arthur Azevedo de Amorim , Marco Gaboardi

We show that the language equivalence problem for regular and context-free commutative grammars is coNEXP-complete. In addition, our lower bound immediately yields further coNEXP-completeness results for equivalence problems for…

Formal Languages and Automata Theory · Computer Science 2015-06-26 Christoph Haase , Piotr Hofman

A few properties of unitary Cayley graphs are explored using their eigenvalues. It is shown that the adjacency algebra of a unitary Cayley graph is a coherent algebra. Finally, a class of unitary Cayley graphs that are distance regular are…

Number Theory · Mathematics 2017-07-11 A. Satyanarayana Reddy

We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other.…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Jason Bell , Daniel Smertnig , Hellis Tamm

We solve a class of lifting problems involving approximate polynomial relations (soft polynomial relations). Various associated C*-algebras are therefore projective. The technical lemma we need is a new manifestation of Akemann and…

Operator Algebras · Mathematics 2014-01-14 Terry A. Loring , Tatiana Shulman

We present news proofs of the additivity, resolution and cofinality theorems for the algebraic $K$-theory of exact categories. These proofs are entirely algebraic, based on Grayson's presentation of higher algebraic $K$-groups via binary…

K-Theory and Homology · Mathematics 2013-11-21 Tom Harris

Lie antialgebras is a class of supercommutative algebras recently appeared in symplectic geometry. We define the notion of enveloping algebra of a Lie antialgebra and study its properties. We show that every Lie antialgebra is canonically…

Commutative Algebra · Mathematics 2010-07-26 Séverine Leidwanger , Sophie Morier-Genoud

In this contributed presentation, we discuss and compare the mutually opposite procedures of deformations and contractions of Lie algebras. We suggest that with appropriate combinations of both procedures one may construct new Lie algebras.…

Representation Theory · Mathematics 2008-04-24 Alice Fialowski , Marc de Montigny

The universal object oriented languages made programming more simple and efficient. In the article is considered possibilities of using similar methods in computer algebra. A clear and powerful universal language is useful if particular…

Programming Languages · Computer Science 2016-08-31 Alexander Yu. Vlasov

We present a general unified approach for finding the coherent states of polynomially deformed algebras such as the quadratic and Higgs algebras, which are relevant for various multiphoton processes in quantum optics. We give a general…

Quantum Physics · Physics 2007-05-23 V. SunilKumar , B. A. Bambah , R. Jagannathan , P. K. Panigrahi , V. Srinivasan

Irreducible skew-Berger algebras $\g\subset\gl(n,\Co)$, i.e. algebras spanned by the images of the linear maps $R:\odot^2\Co^n\to\g$ satisfying the Bianchi identity, are classified. These Lie algebras can be interpreted as irreducible…

Differential Geometry · Mathematics 2009-10-19 Anton S. Galaev

In this paper a characterisation is given of solvable complemented Lie algebras. They decompose as a direct sum of abelian subalgebras and their ideals relate nicely to this decomposition. The class of such algebras is shown to be a…

Rings and Algebras · Mathematics 2011-04-20 David A. Towers

Pomsets constitute one of the most basic models of concurrency. A pomset is a generalisation of a word over an alphabet in that letters may be partially ordered. A term $t$ using the bi-Kleene operations $0,1, +, \cdot\, ,^*, \parallel,…

Formal Languages and Automata Theory · Computer Science 2017-05-18 Michael R Laurence , Georg Struth
‹ Prev 1 8 9 10 Next ›