English
Related papers

Related papers: Semisimplicity, Glivenko theorems, and the exclude…

200 papers

We extend two well-known results on primitive ideals in enveloping algebras of semisimple Lie algebras, the `Irreducibility theorem' and `Duflo theorem', to much wider classes of algebras. Our general version of Irreducibility theorem says…

Representation Theory · Mathematics 2012-05-29 Victor Ginzburg

A semisimple element $s$ of a connected reductive group $G$ is said {\it quasi-isolated} (respectively {\it isolated}) if $C_G(s)$ (respectively $C_G^0(s)$) is not contained in a Levi subgroup of a proper parabolic subgroup of $G$. We study…

Group Theory · Mathematics 2007-05-23 Cédric Bonnafé

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2016-01-28 Andrei A. Bulatov

While context-free grammars are characterized by a simple proof-theoretic grammatical formalism namely categorial grammar and its logic the Lambek calculus, no such characterizations were known for tree-adjoining grammars, and even for any…

Computation and Language · Computer Science 2021-01-12 Hiroyoshi Komatsu

Part I proved that for every quasivariety K of structures (which may have both operations and relations) there is a semilattice S with operators such that he lattice of quasi-equational theories of K (the dual of the lattice of…

Rings and Algebras · Mathematics 2012-12-06 Kira Adaricheva , J. B. Nation

We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…

Logic in Computer Science · Computer Science 2021-04-21 A. R. Balasubramanian , Timo Lang , Revantha Ramanayake

In this note, we prove that an affine cellular algebra $A$ is semisimple if and only if the scheme associated to $A$ is reduced and 0-dimensional, and the bilinear forms with respect to all layers of $A$ are isomorphisms. Moreover, if the…

Rings and Algebras · Mathematics 2023-03-02 Yanbo Li , Bowen Sun

Let g be a semi-simple Lie algebra. In this paper we study the spaces of based quasi-maps from the projective line P^1 to the flag variety of g (it is well-known that their singularities are supposed to model the singularities of the so…

Algebraic Geometry · Mathematics 2017-12-05 Alexander Braverman , Michael Finkelberg

We prove the semisimplicity conjecture for A-motives over finitely generated fields K. This conjecture states that the rational Tate modules V_p(M) of a semisimple A-motive M are semisimple as representations of the absolute Galois group of…

Number Theory · Mathematics 2019-02-20 Nicolas Stalder

This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…

Logic in Computer Science · Computer Science 2022-07-01 Andrea Aler Tubella , Alessio Guglielmi

We show how to use Jantzen's sum formula for Weyl modules to prove semisimplicity criteria for endomorphism algebras of $\textbf{U}_q$-tilting modules (for any field $\mathbb{K}$ and any parameter $q\in\mathbb{K}-\{0,-1\}$). As an…

Quantum Algebra · Mathematics 2017-10-04 Henning Haahr Andersen , Catharina Stroppel , Daniel Tubbenhauer

Let $\mathfrak{g}$ be the simple Lie algebra of square matrices $(n+1)\times (n+1)$ with zero trace. There are certain relations concerning standard automorphisms that are considered ``folklore". One can find a complete proof of these in…

Rings and Algebras · Mathematics 2025-08-25 David Reynoso-Mercado

We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of…

Logic in Computer Science · Computer Science 2009-03-23 Mehrnoosh Sadrzadeh , Roy Dyckhoff

The Bershadsky-Polyakov algebras are the minimal quantum hamiltonian reductions of the affine vertex algebras associated to $\mathfrak{sl}_3$ and their simple quotients have a long history of applications in conformal field theory and…

Representation Theory · Mathematics 2021-03-17 Zachary Fehily , Kazuya Kawasetsu , David Ridout

A subalgebra of a semisimple Lie algebra is wide if every simple module of the semisimple Lie algebra remains indecomposable when restricted to the subalgebra. A subalgebra is narrow if the restrictions of all non-trivial simple modules to…

Representation Theory · Mathematics 2024-03-28 Andrew Douglas , Joe Repka

Quasi-set theory was proposed as a mathematical context to investigate collections of indistinguishable objects. After presenting an outline of this theory, we define an algebra that has most of the standard properties of an orthocomplete…

Quantum Physics · Physics 2009-02-19 Decio Krause , Hercules de Araujo Feitosa

This work is concerned with Bielawski's hyperk\"ahler slices in the cotangent bundles of homogeneous affine varieties. One can associate such a slice to the data of a complex semisimple Lie group $G$, a reductive subgroup $H\subseteq G$,…

Symplectic Geometry · Mathematics 2023-06-22 Peter Crooks , Maarten van Pruijssen

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

Logic in Computer Science · Computer Science 2025-01-16 Andrei A. Bulatov

In this paper, we focus on the variety DHMSH of dually hemimorphic semi-Heyting algebras from a logical point of view. Firstly, we present a Hilbert-style axiomatization of a new logic called Dually hemimorphic semi-Heyting logic (DHMSH,…

Logic · Mathematics 2022-02-10 Juan M. Cornejo , Hanamantagouda P. Sankappanavar

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

Artificial Intelligence · Computer Science 2007-05-23 Daniel Lehmann