English
Related papers

Related papers: Eilenberg Theorems for Free

200 papers

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

The category of internal coalgebras in a cocomplete category $\mathcal{C}$ with respect to a variety $\mathcal{V}$ is equivalent to the category of left adjoint functors from $\mathcal{V}$ into $\mathcal{C}$. This can be seen best when…

Category Theory · Mathematics 2020-03-19 Laurent Poinsot , Hans-E Porst

We define a new class of languages of $\omega$-words, strictly extending $\omega$-regular languages. One way to present this new class is by a type of regular expressions. The new expressions are an extension of $\omega$-regular expressions…

Logic in Computer Science · Computer Science 2023-06-22 Mikołaj Bojańczyk , Thomas Colcombet

A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical…

Combinatorics · Mathematics 2009-04-14 Vassiliki Farmaki

We introduce a method to derive theorems from Elementary Number Theory by means of relationships among formal languages. Using $\sigma$-algebras, we define what a proof of a number-theoretical statement by Language Theory means. We prove…

Logic · Mathematics 2017-09-28 José Manuel Rodríguez Caballero

It is known that each word of length $n$ contains at most $n+1$ distinct palindromes. A finite rich word is a word with maximal number of palindromic factors. The definition of palindromic richness can be naturally extended to infinite…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Francesco Dolce , Edita Pelantová

We count points over a finite field on wild character varieties of Riemann surfaces for singularities with regular semisimple leading term. The new feature in our counting formulas is the appearance of characters of Yokonuma-Hecke algebras.…

Algebraic Geometry · Mathematics 2016-05-24 Tamas Hausel , Martin Mereb , Michael Lennox Wong

Applying the classical Serre-Swan theorem, as this is extended to topological (non-normed) algebras, one attains a classification of elementary particles via their spin-structure. In this context, our argument is virtually based on a…

Mathematical Physics · Physics 2007-05-23 Anastasios Mallios

We give a proof and extension of two formulas of Frobenius and Stickelberger of Differential Calculus that they used in a fundamental paper concerning elliptic functions theory. Our main ingredient is the introduction of a bilinear form…

Classical Analysis and ODEs · Mathematics 2013-06-26 Roger Gay , Marcel Grangé , Ahmed Sebbar

Two formalisms, both based on context-free grammars, have recently been proposed as a basis for a non-uniform random generation of combinatorial objects. The former, introduced by Denise et al, associates weights with letters, while the…

Computation and Language · Computer Science 2012-05-04 Yann Ponty

We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…

Logic · Mathematics 2025-08-13 Andrew Apps

Differential algebraic geometry seeks to extend the results of its algebraic counterpart to objects defined by differential equations. Many notions, such as that of a projective algebraic variety, have close differential analogues but their…

Algebraic Geometry · Mathematics 2015-05-14 William D. Simmons

We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the…

Formal Languages and Automata Theory · Computer Science 2019-01-09 Dietrich Kuske , Georg Zetzsche

We ask some questions and make some observations about the (complete) theory T (infinity, V) of free algebras in V on infinitely many generators, where V is a variety in the sense of universal algebra. We focus on the case T(infinity, R)…

Logic · Mathematics 2020-04-28 Anand Pillay , Philipp Rothmaler

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

Logic in Computer Science · Computer Science 2026-05-19 Lukas Mulder , Damien Pous , Jana Wagemaker

The paper is devoted to two new results concerning varieties of Leibnitz algebras over a field of the zero characteristic. Here is proved the sufficient condition for finiteness colength of variety of Leibnitz algebras. Here is also defined…

Rings and Algebras · Mathematics 2014-05-20 A. V. Shvetsova , T. V. Skoraya

We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…

Rings and Algebras · Mathematics 2022-03-08 Jason P. Bell , Peter V. Danchev

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over…

Logic in Computer Science · Computer Science 2015-07-01 Mikolaj Bojanczyk , Igor Walukiewicz , Howard Straubing

We derive the algebraic relations of alternating and non-alternating finite harmonic sums up to the sums of depth~6. All relations for the sums up to weight~6 are given in explicit form. These relations depend on the structure of the index…

High Energy Physics - Phenomenology · Physics 2008-11-26 J. Blümlein

Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…

Differential Geometry · Mathematics 2026-05-19 Boris Kruglikov , Eivind Schneider
‹ Prev 1 8 9 10 Next ›