English
Related papers

Related papers: Regular Behaviours with Names

200 papers

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

Number Theory · Mathematics 2016-04-12 Joao Alberto de Faria , Benjamin Hutz

A functor of sets $\mathbb X$ over the category of $K$-commutative algebras is said to be an affine functor if its functor of functions, $\mathbb A_{\mathbb X}$, is reflexive and $\mathbb X=\Spec \mathbb A_{\mathbb X}$. We prove that affine…

Algebraic Geometry · Mathematics 2012-05-08 J. Navarro , C. Sancho , P. Sancho

If $G$ is a finite $\ell$-group acting on an affine space $\mathbb{A}^n$ over a finite field $K$ of cardinality prime to $\ell$, Serre has shown that there exists a rational fixed point. We generalize this to the case where $K$ is a…

Algebraic Geometry · Mathematics 2011-02-02 Hélène Esnault , Johannes Nicaise

Esik and Maletti introduced the notion of a proper semiring and proved that some important (classes of) semirings -- Noetherian semirings, natural numbers -- are proper. Properness matters as the equivalence problem for weighted automata…

Logic in Computer Science · Computer Science 2018-02-27 Ana Sokolova , Harald Woracek

For a set-endofunctor $F$, a graph is triple $(V,E,g)$ with a structure map $g:E\rightarrow F V$. This model is a generalized coalgebra over the category of sets. In this note, we model graphs as coalgebras over $Set\times Set$ and use the…

Combinatorics · Mathematics 2016-01-19 Christian Jäkel

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

Logic · Mathematics 2009-05-19 Jaap van Oosten

It is common to model inductive datatypes as least fixed points of functors. We show that within the Cedille type theory we can relax functoriality constraints and generically derive an induction principle for Mendler-style lambda-encoded…

Programming Languages · Computer Science 2018-03-08 Denis Firsov , Richard Blair , Aaron Stump

We discuss some results concerning fixed point equations in the setting of topological *-algebras of unbounded operators. In particular, an existence result is obtained for what we have called {\em weak $\tau$ strict contractions}, and some…

Mathematical Physics · Physics 2007-05-23 F. Bagarello

The main theorem provides a characterisation of the finite rank operators lying in a norm closed Lie ideal of a continuous nest algebra. These operators are charaterised as those finite rank operators in the nest algebra satisfying a…

Operator Algebras · Mathematics 2010-06-15 Lina Oliveira

The finite condensation $\sim_F$ is an equivalence relation defined on a linear order $L$ by $x \sim_F y$ if and only if the set of points lying between $x$ and $y$ is finite. We define an operation $\cdot_F$ on linear orders $L$ and $M$ by…

Logic · Mathematics 2025-09-17 Jennifer Brown , Ricardo Suárez

If C and D are varieties of algebras in the sense of general algebra, then by a representable functor C --> D we understand a functor which, when composed with the forgetful functor D --> Set, gives a representable functor in the classical…

Category Theory · Mathematics 2013-05-10 George M. Bergman

We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques -- as those popular in process calculi -- we extend classical regular expressions with names (to model…

Formal Languages and Automata Theory · Computer Science 2013-10-29 Alexander Kurz , Tomoyuki Suzuki , Emilio Tuosto

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…

Logic in Computer Science · Computer Science 2017-01-11 Pascal Tesson , Denis Therien

We introduce continuation semantics for both fixpoint modal logic (FML) and Computation Tree Logic* (CTL*), parameterised by a choice of branching type and quantitative predicate lifting. Our main contribution is proving that they are…

Logic in Computer Science · Computer Science 2026-03-03 Ryota Kojima , Corina Cirstea

We study the quantizations of the algebras of regular functions on nilpotent orbits. We show that such a quantization always exists and is unique if the orbit is birationally rigid. Further we show that, for special birationally rigid…

Representation Theory · Mathematics 2015-06-01 Ivan Losev

We consider a fixed free and proper action of a locally compact group $G$ on a space $T$, and actions $\alpha:G\to \Aut A$ on $C^*$-algebras for which there is an equivariant embedding of $(C_0(T),\rt)$ in $(M(A),\alpha)$. A recent theorem…

Operator Algebras · Mathematics 2009-07-06 Astrid an Huef , S. Kaliszewski , Iain Raeburn , Dana P. Williams

There is a wide range of modal logics whose semantics goes beyond relational structures, and instead involves, e.g., probabilities, multi-player games, weights, or neighbourhood structures. Coalgebraic logic serves as a unifying semantic…

Logic in Computer Science · Computer Science 2023-06-16 Oliver Görlitz , Daniel Hausmann , Merlin Humml , Dirk Pattinson , Simon Prucker , Lutz Schröder

We study rational modules over complete path and monomial algebras, and the problem of when rational modules over the dual $C^*$ of a coalgebra $C$ are closed under extensions, equivalently, when is the functor $Rat$ a torsion functor. We…

Representation Theory · Mathematics 2016-01-01 M. C. Iovanov

To, say, a proper algebraic or holomorphic space $X/S$, and a coherent sheaf ${\mathcal F}$ on $X$ we identify a functorial ideal, the fitted flatifier, blowing up sequentially in which leads to a flattening of the proper transform of…

Algebraic Geometry · Mathematics 2025-09-23 Michael McQuillan