English
Related papers

Related papers: Generalized Eilenberg Theorem I: Local Varieties o…

200 papers

We give a short introduction to generalized vertex algebras, using the notion of polylocal fields. We construct a generalized vertex algebra associated to a vector space h with a symmetric bilinear form. It contains as subalgebras all…

Quantum Algebra · Mathematics 2007-05-23 Bojko Bakalov , Victor G. Kac

It has long been known in universal algebra that any distributive sublattice of congruences of an algebra which consists entirely of commuting congruences yields a sheaf representation of the algebra. In this paper we provide a…

Rings and Algebras · Mathematics 2019-04-12 M. Gehrke , S. J. v. Gool

We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…

Algebraic Topology · Mathematics 2009-01-16 Dev Sinha , Ben Walter

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

In this thesis, we study the place of regular languages within the communication complexity setting. In particular, we are interested in the non-deterministic communication complexity of regular languages. We show that a regular language…

Computational Complexity · Computer Science 2008-02-01 Anil Ada

We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…

Rings and Algebras · Mathematics 2011-02-23 Tamás Waldhauser

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

The grouplike elements of a coalgebra over a field are known to be linearly independent over said field. Here we prove three variants of this result. One is a generalization to coalgebras over a commutative ring (in which case the linear…

Quantum Algebra · Mathematics 2021-08-03 Gérard Duchamp , Darij Grinberg , Vincel Minh

Coalgebra, as the abstract study of state-based systems, comes naturally equipped with a notion of behavioural equivalence that identifies states exhibiting the same behaviour. In many cases, however, this equivalence is finer than the…

Logic in Computer Science · Computer Science 2024-04-29 Jonas Forster , Lutz Schröder , Paul Wild , Harsh Beohar , Sebastian Gurke , Karla Messing

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

Group Theory · Mathematics 2025-04-14 Jorge Almeida

For every variety of algebras over a field, there is a natural definition of a corresponding variety of dialgebras (Loday-type algebras). In particular, Lie dialgebras are equivalent to Leibniz algebras. We use an approach based on the…

Quantum Algebra · Mathematics 2015-09-17 P. S. Kolesnikov , V. Yu. Voronin

The aim of this article is to study certain categorical-algebraic frameworks for basic homological algebra, introduced in arXiv:2404.15896, with the aim of better understanding the differences between them. We focus on homological…

Category Theory · Mathematics 2024-11-28 Florent Afsa

In this paper we begin to study the subalgebra lattice of a Leibniz algebra. In particular, we deal with Leibniz algebras whose subalgebra lattice is modular, upper semi-modular, lower semi-modular, distributive, or dually atomistic. The…

Rings and Algebras · Mathematics 2021-06-10 Salvatore Siciliano , David A. Towers

Borchers and Wiesbrock have demonstrated certain results concerning the one-parameter semigroups of endomorphisms of von Neumann algebras that appear as lightlike translations in the theory of algebras of local observables. These results…

funct-an · Mathematics 2009-10-28 D. R. Davidson

A resolution of the intersection of a finite number of subgroups of an abelian group by means of their sums is constructed, provided the lattice generated by these subgroups is distributive. This is used for detecting singularities of…

K-Theory and Homology · Mathematics 2009-11-02 Tomasz Maszczyk

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

Logic in Computer Science · Computer Science 2023-06-22 Francesco Ciraulo , Michele Contente

We obtain a generalization of the ABC Theorem on locally nilpotent derivations to the case of the polynomials with m monomials such that each variable is included just in one monomial. As applications of this result we provide some…

Algebraic Geometry · Mathematics 2024-09-17 Veronika Kikteva

In this article we observe that a locally compact group $G$ is completely determined by the algebraic properties of its Feichtinger's Segal algebra $S_0(G).$ Let $G$ and $H$ be locally compact groups. Then any linear (not necessarily…

Functional Analysis · Mathematics 2021-02-09 Lakshmi Lavanya Ramamurthy

We give an algebraic characterisation of first-order logic with the neighbour relation, on finite words. For this, we consider languages of finite words over alphabets with an involution on them. The natural algebras for such languages are…

Logic in Computer Science · Computer Science 2021-05-21 Amaldev Manuel , Dhruv Nevatia

While a language assigns a value of either `yes' or `no' to each word, a lattice language assigns an element of a given lattice to each word. An advantage of lattice languages is that joins and meets of languages can be defined as…

Formal Languages and Automata Theory · Computer Science 2025-06-09 Yusuke Inoue , Yuji Komatsu