English
Related papers

Related papers: Myhill-Nerode Relation for Sequentiable Structures

200 papers

Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…

Algebraic Topology · Mathematics 2015-09-08 Clara Loeh

We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…

Logic · Mathematics 2021-12-21 Matthias Kunik

Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…

Logic · Mathematics 2021-05-27 Deacon Linkhorn

For an arbitrary finite monoid $M$ and subgroup $K$ of the unit group of $M$, we prove that there is a bijection between irreducible representations of $M$ with nontrivial $K$-fixed space and irreducible representations of $\mathcal{H}_K$,…

Representation Theory · Mathematics 2018-11-13 Jared Marx-Kuo , Vaughan McDonald , John M. O'Brien , Alexander Vetter

Presheaves and nominal sets provide alternative abstract models of sets of syntactic objects with free and bound variables, such as lambda-terms. One distinguishing feature of the presheaf-based perspective is its elegant syntax-free…

Logic in Computer Science · Computer Science 2026-02-13 Fabian Lenke , Stefan Milius , Henning Urbat

Reynolds' parametricity originally equips types with proof-irrelevant binary propositional relations over the types. But such relations can also be taken proof-relevant or unary, and described either in an indexed or fibred way.…

Logic in Computer Science · Computer Science 2026-02-16 Hugo Herbelin , Ramkumar Ramachandra

The asynchronous systems f are multi-valued functions, representing the non-deterministic models of the asynchronous circuits from the digital electrical engineering. In real time, they map an 'admissible input' function…

General Literature · Computer Science 2012-06-22 Serban E. Vlad

Let A be a finite-dimensional associative algebra and $\phi$ a symmetric linear function on $A$. In this note, we will show that the pseudotrace maps are obtained as special cases of well-known symmetric linear functions on the endomorphism…

Rings and Algebras · Mathematics 2010-01-18 Yusuke Arike

We introduce nominal string diagrams as, string diagrams internal in the category of nominal sets. This requires us to take nominal sets as a monoidal category, not with the cartesian product, but with the separated product. To this end, we…

Logic in Computer Science · Computer Science 2019-04-17 Samuel Balco , Alexander Kurz

In a recent paper, Cohl and Costas-Santos derived a number of interesting multi-derivative and multi-integral relations for associated Legendre and Ferrers functions in which the orders of those functions are changed in integral steps.…

Mathematical Physics · Physics 2022-03-14 Loyal Durand

This paper introduces the notion of referring forms as a new metric for analyzing sequential circuits from a functional perspective. Sequential circuits are modeled as causal stream functions, the outputs of which depend solely on the past…

Hardware Architecture · Computer Science 2025-01-22 Shunji Nishimura

We study the homotopy theory of a certain type of diagram categories whose vertices are in variable categories with a functorial path, leading to a good calculation of the homotopy category in terms of cofibrant objects. The theory is…

Algebraic Topology · Mathematics 2016-10-04 Joana Cirici

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

Formal Languages and Automata Theory · Computer Science 2020-11-25 Joost Engelfriet

We give a formula for the eventual multiplicities of irreducible representations appearing in a finitely-presented FI-module over the rational numbers. The result relies on structure theory due to Sam-Snowden SS16.

Representation Theory · Mathematics 2018-08-24 John D. Wiltshire-Gordon

A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…

Combinatorics · Mathematics 2024-01-24 Susan Jowett , Dillon Mayhew , Songbao Mo , Christopher Tuffley

We say that a positively homogeneous function admits a saddle representation by linear functions iff it admits both an inf-sup-representation and a sup-inf-representation with the same two-index family of linear functions. In the paper we…

Optimization and Control · Mathematics 2017-10-18 Valentin V. Gorokhovik , Marina Trafimovich

String transductions that are definable in monadic second-order (mso) logic (without the use of parameters) are exactly those realized by deterministic two-way finite state transducers. Nondeterministic mso definable string transductions…

Logic in Computer Science · Computer Science 2008-11-24 Joost Engelfriet , Hendrik Jan Hoogeboom

Fusion categories are fundamental objects in quantum algebra, but their definition is narrow in some respects. By definition a fusion category must be k-linear for some field k, and every simple object V is strongly simple, meaning that (V)…

Quantum Algebra · Mathematics 2019-09-16 Greg Kuperberg

In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…

Group Theory · Mathematics 2014-11-25 Jorge Almeida , Stuart Margolis , Benjamin Steinberg , Mikhail Volkov

In this work, we analyze the structure of the category of partial representations of a finite group $G$ as a multifusion category, providing an alternative way to describe simple objects and their tensor products. We describe the…

Representation Theory · Mathematics 2026-02-16 Arthur R. Alves Neto , Eliezer Batista , Javier Méndez