English
Related papers

Related papers: Eilenberg theorems for many-sorted formations

200 papers

In [Lu6] Lusztig defined a certain algebra $H,$ which is a direct sum of various algebras $H_{\mathfrak{o}}.$ We establish an explicit algebra isomorphism between each algebra $H_{\mathfrak{o}}$ and some matrix algebra with coefficients in…

Representation Theory · Mathematics 2017-08-22 Weideng Cui

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Group Theory · Mathematics 2018-11-14 Benjamin Linowitz , D. B. McReynolds , Nicholas Miller

We provide new equivalent conditions for an algebra $\Lambda$ to be $g$-finite, analogous to those established by L. Demonet, O. Iyama, and G. Jasso, but within the category of projective presentations $\mathcal{K}^{[-1,0]}(\text{proj}…

Representation Theory · Mathematics 2024-06-21 Monica Garcia

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

Logic in Computer Science · Computer Science 2018-01-23 David McAllester

We attempt to generalize a congruence property of elliptic modular forms proved by Sturm to that of Haupttypus of Siegel modular forms of degree 2 with level. Namely, we give an explicit bound of Fourier coefficients required to determine…

Number Theory · Mathematics 2011-03-02 Toshiyuki Kikuta

We show that a class of algebras is closed under the taking of homomorphic images and direct products if and only if the class consists of all algebras that satisfy a set of (generally simultaneous) equations. For classes of regular…

Group Theory · Mathematics 2022-06-23 Peter M Higgins , Marcel Jackson

We establish an algebra-isomorphism between the complexified Grothendieck ring F of certain bimodule categories over a modular tensor category and the endomorphism algebra of appropriate morphism spaces of those bimodule categories. This…

Category Theory · Mathematics 2009-02-24 Jurgen Fuchs , Ingo Runkel , Christoph Schweigert

Given a simple vertex algebra A and a reductive group G of automorphisms of A, the invariant subalgebra A^G is strongly finitely generated in most examples where its structure is known. This phenomenon is subtle, and is generally not true…

Representation Theory · Mathematics 2020-08-10 Andrew R. Linshaw

We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…

Logic · Mathematics 2026-02-12 Lucy Ham , Marcel Jackson

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

We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…

Logic · Mathematics 2014-03-24 Pierre Gillibert

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 try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…

Logic · Mathematics 2016-01-15 Saharon Shelah

It is well known that classical varieties of $\Sigma$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $\Sigma$-algebras, i.e., classes presented by inequations…

Category Theory · Mathematics 2021-01-07 J. Adámek , M. Dostál , J. Velebil

Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…

Logic · Mathematics 2016-01-20 David Hobby

The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…

Algebraic Geometry · Mathematics 2024-10-24 Antoine Etesse

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

Logic in Computer Science · Computer Science 2023-06-22 Andrew Polonsky , Richard Statman

We introduce the concept of morphism of pseudogroups generalizing the \'etal\'e morphisms of Haefliger. With our definition, any continuous foliated map induces a morphism between the corresponding holonomy pseudogroups. The main theorem…

Geometric Topology · Mathematics 2013-11-15 Jesús A. Álvarez López , Xosé M. Masa

For predual categories C and D we establish isomorphisms between opfibrations representing local varieties of languages in C, local pseudovarieties of D-monoids, and finitely generated profinite D-monoids. The global sections of these…

Formal Languages and Automata Theory · Computer Science 2015-11-06 Liang-Ting Chen , Henning Urbat

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina