English
Related papers

Related papers: An algebraic approach to weak and delay bismulatio…

200 papers

The aim of this paper is to study bimodule stably Calabi-Yau properties of derivation quotient algebras. We give the definition of a twisted stably Calabi-Yau algebra and show that every twisted derivation quotient algebra $A$ for which the…

Representation Theory · Mathematics 2020-02-19 Gabriele Bocca

The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology,…

Mathematical Physics · Physics 2013-09-11 Vanessa Robins

We extend homological perturbation theory to encompass algebraic structures governed by operads and cooperads. The main difficulty is to find a suitable notion of algebra homotopy that generalizes to algebras over operads O. To solve this…

Algebraic Topology · Mathematics 2016-01-20 Alexander Berglund

In previous work, the authors introduced the notion of Q-Koszul algebras, as a tool to "model" module categories for semisimple algebraic groups over fields of large characteristics. Here we suggest the model extends to small…

Representation Theory · Mathematics 2014-06-24 Brian Parshall , Leonard Scott

Given a fibration over the circle, we relate the eigenspace decomposition of the algebraic monodromy, the homological finiteness properties of the fiber, and the formality properties of the total space. In the process, we prove a more…

Algebraic Topology · Mathematics 2010-10-26 Stefan Papadima , Alexander I. Suciu

We define and study the notions of q-deductive systems, p-deductive systems, deductive systems, maximal and strongly maximal q-deductive systems in quantum-Wajsberg algebras. We also introduce the notion of congruences induced by deductive…

Quantum Algebra · Mathematics 2024-05-01 Lavinia Corina Ciungu

This paper presents a substructural logic of sequents with very restricted exchange and weakening rules. It is sound with respect to sequences of measurements of a quantic system. A sound and complete semantics is provided. The semantic…

Quantum Physics · Physics 2023-07-19 Daniel Lehmann

We describe the structure present in algebras over the little disks operads for various representations of a finite group $G$, including those that are not necessarily universe or that do not contain trivial summands. We then spell out in…

Algebraic Topology · Mathematics 2017-09-08 Michael A. Hill

The classification of the representations of the generalized deformed oscillator algebra is given together with several comments about possibility of introducing a coproduct structure in some type of deformed oscillator algebra.

q-alg · Mathematics 2008-02-03 V. V. Borzov , E. V. Damaskinsky , S. B. Yegorov

These notes present a compact and self-contained approach to iterated forcing with a particular emphasis on semiproper forcing. We tried to make our presentation accessible to any scholar who has some familiarity with forcing and boolean…

Logic · Mathematics 2014-02-10 Matteo Viale , Giorgio Audrito , Silvia Steila

In this work we study the induction theory for Hopf group coalgebra. To reach this goal we define a substructure B of a Hopf group coalgebra $H$, called subHopf group coalgebra. Also, we introduced the definition of Hopf group suboalgebra…

Quantum Algebra · Mathematics 2007-05-23 A. S. Hegazi , F. Ismail , M. M. Elsofy

We investigate the power of weak measurements in the framework of quantum state discrimination. First, we define and analyze the notion of weak consecutive measurements. Our main result is a convergence theorem whereby we demonstrate when…

Quantum Physics · Physics 2015-06-23 Boaz Tamir , Eliahu Cohen , Avner Priel

Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algebras for the underlying functor of the monad subject to the…

Logic in Computer Science · Computer Science 2021-12-30 Daniela Petrişan , Ralph Sarkis

Most classical results in circuit complexity theory concern circuits over the Boolean domain. Besides their simplicity and the ease of comparing different languages, the actual architecture of computers is also an important motivating…

Computational Complexity · Computer Science 2026-04-24 Piotr Kawałek , Jacek Krzaczkowski

We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…

Rings and Algebras · Mathematics 2017-08-31 Miodrag Iovanov , Alexander Sistko

We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible…

Logic in Computer Science · Computer Science 2008-10-28 Taolue Chen , Wan Fokkink , Rob van Glabbeek

In this note we give an axiomatization of Boolean algebras based on weakly dicomplemented lattices: an algebra $(L,\wedge,\vee,\tu)$ of type $(2,2,1)$ is a Boolean algebra iff $(L,\wedge,\vee)$ is a non empty lattice and $(x\wedge…

Logic · Mathematics 2009-07-08 Leonard Kwuida

We introduce a general categorical framework for the definition of weak behavioural equivalences, building on and extending recent results in the field. This framework is based on parametrized saturation categories, i.e. categories whose…

Logic in Computer Science · Computer Science 2015-09-29 Tomasz Brengos , Marino Miculan , Marco Peressotti

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

Combinatorics · Mathematics 2007-05-23 Vladimir Ivanov , Sergei Kerov

Algebraic effects offer a versatile framework that covers a wide variety of effects. However, the family of operations that delimit scopes are not algebraic and are usually modelled as handlers, thus preventing them from being used freely…

Programming Languages · Computer Science 2022-01-26 Zhixuan Yang , Marco Paviotti , Nicolas Wu , Birthe van den Berg , Tom Schrijvers