English
Related papers

Related papers: Nominal Coalgebraic Data Types with Applications t…

200 papers

We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…

Formal Languages and Automata Theory · Computer Science 2013-10-16 Vincenzo Ciancia , Matteo Sammartino

We discuss the noncommutative generalizations of polynomial algebras which after appropriate completions can be used as coordinate algebras in various noncommutative settings, (noncommutative differential geometry, noncommutative algebraic…

Quantum Algebra · Mathematics 2010-03-19 Michel Dubois-Violette

We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2017-05-12 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones

Functional Analysis · Mathematics 2025-10-28 Murphy E. Egwe , Funke Yusuf

There are many ways to represent the syntax of a language with binders. In particular, nominal frameworks are metalanguages that feature (among others) name abstraction types, which can be used to specify the type of binders. The resulting…

Logic in Computer Science · Computer Science 2026-05-25 Antoine Van Muylder , Andreas Nuyts , Dominique Devriese

We describe gradings by finite abelian groups on the associative algebras of infinite matrices with finitely many nonzero entries, over an algebraically closed field of characteristic zero.

Rings and Algebras · Mathematics 2009-06-26 Yuri Bahturin , Mikhail Zaicev

We prove that every finitary polynomial endofunctor of a category $C$ has a final coalgebra if $C$ is locally Cartesian closed, has finite disjoint coproducts and a natural number object. More generally, we prove that the category of…

Category Theory · Mathematics 2007-05-23 Luigi Santocanale

This is a brief survey of some recent developments in the study of infinite dimensional Hopf algebras which are either noetherian or have finite Gelfand-Kirillov dimension. A number of open questions are listed.

Rings and Algebras · Mathematics 2014-05-19 Ken A. Brown , Paul Gilmartin

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

Rings and Algebras · Mathematics 2026-02-24 Vesselin Drensky

We introduce the notion of almost finite dimensionality of algebras and study its connection with the classical finiteness conditions.

Rings and Algebras · Mathematics 2007-05-23 Gábor Elek

In a previous paper, we showed that profinite $L$-algebras (where $L$ is a variety of modal algebras generated by its finite members) are monadic over $\mathbf{Set}$. This monadicity result suggests that profinite $L$-algebras could be…

Logic · Mathematics 2025-11-21 Matteo De Berardinis , Silvio Ghilardi

One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…

Combinatorics · Mathematics 2014-12-25 Jeremy F. Alm , John W. Snow

A comparison of Landin's form of lambda calculus with Church's shows that, independently of the lambda calculus, there exists a mechanism for converting functions with arguments indexed by variables to the usual kind of function where the…

Programming Languages · Computer Science 2015-06-01 M. H. van Emden

These notes deal with finite-dimensional normed algegras, some basic examples, and the definition of the spectrum.

Classical Analysis and ODEs · Mathematics 2007-05-23 Stephen Semmes

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

We introduce the notion of finitary computable reducibility on equivalence relations on the natural numbers. This is a weakening of the usual notion of computable reducibility, and we show it to be distinct in several ways. In particular,…

Logic · Mathematics 2018-02-12 Russell Miller , Keng Meng Ng

We introduce nominal string diagrams as string diagrams internal in the category of nominal sets. This leads us to define nominal PROPs and nominal monoidal theories. We show that the categories of ordinary PROPs and nominal PROPs are…

Logic in Computer Science · Computer Science 2023-06-22 Samuel Balco , Alexander Kurz

Infinite words over infinite alphabets serve as models of the temporal development of the allocation and (re-)use of resources over linear time. We approach omega-languages over infinite alphabets in the setting of nominal sets, and study…

Formal Languages and Automata Theory · Computer Science 2021-07-13 Henning Urbat , Daniel Hausmann , Stefan Milius , Lutz Schröder

On an infinite set some closure operators are finitary (algebraic) while others are not. We can generalize this idea for a complete algebraic lattice letting the compact elements act as the finite sets. With this in mind, we will consider…

Rings and Algebras · Mathematics 2014-11-25 Martha Lee Hollist Kilpack

We investigate the cluster-tilted algebras of finite representation type over an algebraically closed field. We give an explicit description of the relations for the quivers for finite representation type. As a consequence we show that a…

Representation Theory · Mathematics 2020-12-21 Aslak Bakke Buan , Bethany Marsh , Idun Reiten
‹ Prev 1 3 4 5 6 7 10 Next ›