English
Related papers

Related papers: Eilenberg Theorems for Free

200 papers

We present a novel dependent linear type theory in which the multiplicity of some variable-i.e., the number of times the variable can be used in a program-can depend on other variables. This allows us to give precise resource annotations to…

Programming Languages · Computer Science 2026-05-20 Maximilian Doré

We explore a relationship between the classical representation theory of a complex, semisimple Lie algebra \g and the resonance varieties R(V,K)\subset V^* attached to irreducible \g-modules V and submodules K\subset V\wedge V. In the…

Representation Theory · Mathematics 2016-11-17 Stefan Papadima , Alexander I. Suciu

This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.

Group Theory · Mathematics 2009-09-25 Robert Gilman

We extend Borel's theorem on the dominance of word maps from semisimple algebraic groups to some perfect groups. In another direction, we generalize Borel's theorem to some words with constants. We also consider the surjectivity problem for…

Group Theory · Mathematics 2018-04-26 Nikolai Gordeev , Boris Kunyavskii , Eugene Plotkin

The notion of multiplicity of a module first arose as consequence of Hilbert's work on commutative algebra, relating the dimension of rings with the degree of certain polynomials. For noncommutative rings, the notion of multiplicity first…

Rings and Algebras · Mathematics 2026-04-14 Jonas T. Hartwig , Erich C. Jauch , João Schwarz

The Grothendieck groups of the categories of finitely generated modules and finitely generated projective modules over a tower of algebras can be endowed with (co)algebra structures that, in many cases of interest, give rise to a dual pair…

Representation Theory · Mathematics 2014-10-24 Alistair Savage , Oded Yacobi

Motivated by a question and some enumerative conjectures of Richard Stanley, we explore the equivalence classes of words in the Weyl algebra, $\mathbf{k} \left< D,U \mid DU - UD = 1 \right>$. We show that each class is generated by the…

Combinatorics · Mathematics 2024-11-25 Darij Grinberg , Tom Roby , Stephan Wagner , Mei Yin

In this article we describe an algebraic framework which can be used in three related but different contexts: string topology, symplectic field theory, and Lagrangian Floer theory of higher genus. It turns out that the relevant algebraic…

Quantum Algebra · Mathematics 2022-12-06 Kai Cieliebak , Kenji Fukaya , Janko Latschev

How does the first order language of fields encode birational invariants of varieties?... This question is related to rational points on varieties and effectiveness in algebraic/arithmetic geometry.

Algebraic Geometry · Mathematics 2015-06-26 Florian Pop

It often happens that free algebras for a given theory satisfy useful reasoning principles that are not preserved under homomorphisms of algebras, and hence need not hold in an arbitrary algebra. For instance, if $M$ is the free monoid on a…

Logic in Computer Science · Computer Science 2023-09-28 Jonathan Sterling

We study polynomial identities of nonassociative algebras constructed by using infinite binary words and their combinatorial properties. Infinite periodic and Sturmian words were first applied for constructing examples of algebras with…

Rings and Algebras · Mathematics 2018-07-03 Dušan D. Repovš , Mikhail V. Zaicev

We introduce the concepts of dependence and independence in a very general framework. We use a concept of rank to study dependence and independence. By means of the rank we identify (total) dependence with inability to create more…

Logic in Computer Science · Computer Science 2021-09-27 Pietro Galliani , Jouko Väänänen

Diagrammatically speaking, grammatical calculi such as pregroups provide wires between words in order to elucidate their interactions, and this enables one to verify grammatical correctness of phrases and sentences. In this paper we also…

Computation and Language · Computer Science 2021-06-15 Bob Coecke , Vincent Wang

We provide a complete description of the Wadge hierarchy for deterministically recognisable sets of infinite trees. In particular we give an elementary procedure to decide if one deterministic tree language is continuously reducible to…

Logic in Computer Science · Computer Science 2015-07-01 Filip Murlak

The paper explains the connection between topological theories for one-manifolds with defects and values in the Boolean semiring and automata and their generalizations. Finite state automata are closely related to regular languages. To each…

Quantum Algebra · Mathematics 2022-03-07 Mee Seong Im , Mikhail Khovanov

This article considers some affine algebraic varieties attached to finite trees and closely related to cluster algebras. Their definition involves a canonical coloring of vertices of trees into three colors. These varieties are proved to be…

Quantum Algebra · Mathematics 2014-03-04 Frédéric Chapoton

In this survey article we discuss the question: to what extent is an algebraic variety determined by its ring of differential operators? In the case of affine curves, this question leads to a variety of mathematical notions such as the Weyl…

Algebraic Geometry · Mathematics 2007-05-23 Yuri Berest , George Wilson

Quantitative linguistics has provided us with a number of empirical laws that characterise the evolution of languages and competition amongst them. In terms of language usage, one of the most influential results is Zipf's law of word…

Physics and Society · Physics 2009-01-21 Alvaro Corral , Ramon Ferrer-i-Cancho , Gemma Boleda , Albert Diaz-Guilera , .

In order to better understand the structure of classical rings of invariants for binary forms, Dixmier proposed, as a conjectural homogeneous system of parameters, an explicit collection of invariants previously studied by Hilbert. We…

Representation Theory · Mathematics 2019-11-18 Abdelmalek Abdesselam

Let L contain only the equality symbol and let L^+ be an arbitrary finite symmetric relational language containing L . Suppose probabilities are defined on finite L^+ structures with ''edge probability'' n^{- alpha}. By T^alpha, the almost…

Logic · Mathematics 2016-09-06 John T. Baldwin , Saharon Shelah