English
Related papers

Related papers: Formal Languages and Infinite Groups

200 papers

This book explores an alternative to the current dominant paradigm where a discrete computer model is constructed as an attempt to approximate some continuum theory. We focus on a class of discrete computer models that are based on simple…

Logic in Computer Science · Computer Science 2017-04-14 Garry Pantelis

This article contains a basic introduction to the local study of finite groups, including a brief perspective on the theory of fusion systems and $p$-local finite groups. -- Este art\'iculo contiene una introducci\'on b\'asica al estudio…

Group Theory · Mathematics 2024-11-12 José Cantarero

We discuss algebraic and combinatorial aspects of the Hamiltonian normal form theory. The main objective is to describe the normal form near a singular point purely in terms of the original Hamiltonian, avoiding the normalization procedure.…

Dynamical Systems · Mathematics 2026-05-05 Dmitry Treschev

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…

Logic in Computer Science · Computer Science 2015-07-01 Mikołaj Bojańczyk , Bartek Klin , Sławomir Lasota

We give a brief introduction to the notion of an 'approximate group' and some of its numerous applications.

Group Theory · Mathematics 2020-03-30 Matthew Tointon

Modelling concept representation is a foundational problem in the study of cognition and linguistics. This work builds on the confluence of conceptual tools from G\"ardenfors semantic spaces, categorical compositional linguistics, and…

Computation and Language · Computer Science 2020-08-07 James Hefford , Vincent Wang , Matthew Wilson

In the theory of formal languages, the understanding of concatenation hierarchies of regular languages is one of the most fundamental and challenging topic. In this paper, we survey progress made in the comprehension of this problem since…

Formal Languages and Automata Theory · Computer Science 2017-10-13 Thomas Place , Marc Zeitoun

Building on our previous work on enriched universal algebra, we define a notion of enriched language consisting of function and relation symbols whose arities are objects of the base of enrichment. In this context, we construct atomic…

Category Theory · Mathematics 2025-01-06 Jiří Rosický , Giacomo Tendas

A survey of recent results about profinite groups, and results about infinite and finite groups where the theory of profinite groups plays a leading role.

Group Theory · Mathematics 2007-05-23 Dan Segal

On the one hand the algebras of linear operators here act on finite-dimensional vector spaces, and on the other hand the point of view is generally an analysts'. Also, one might think of algebras as being used to add more data to basic…

Classical Analysis and ODEs · Mathematics 2007-05-23 Stephen Semmes

We consider the natural Lie algebra structure on the (associative) group algebra of a finite group $G$, and show that the Lie subalgebras associated to natural involutive antiautomorphisms of this group algebra are reductive ones. We give a…

Representation Theory · Mathematics 2008-09-02 Ivan Marin

We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…

Logic · Mathematics 2017-05-26 Luca Mauri

The Laver tables are finite combinatorial objects with a simple elementary definition, which were introduced by R. Laver from considerations of logic and set theory. Although these objects exhibit some fascinating properties, they seem to…

Combinatorics · Mathematics 2018-10-02 Philippe Biane

We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…

Logic · Mathematics 2020-08-04 Sergey Slavnov

Currently it is widely accepted that the language of science is mathematics. This book explores an alternative idea where the future of science is based on the language of algorithms and programs. How such a language can actually be…

Logic in Computer Science · Computer Science 2020-11-06 Garry Pantelis

In this article, we present a fresh perspective on language, combining ideas from various sources, but mixed in a new synthesis. As in the minimalist program, the question is whether we can formulate an elegant formalism, a universal…

Computation and Language · Computer Science 2023-03-10 Loe Feijs

Formalizing creativity-related concepts has been a long-term goal of Computational Creativity. To the same end, we explore Formal Learning Theory in the context of creativity. We provide an introduction to the main concepts of this…

Artificial Intelligence · Computer Science 2024-05-06 Luís Espírito Santo , Geraint Wiggins , Amílcar Cardoso

We provide a self-contained introduction to the classical theory of universal-homogeneous models (also known as generic structures, rich models, or Fra\"iss\'e limits). In the literature, most treatments restrict consideration to embeddings…

Logic · Mathematics 2010-09-10 Silvia Barbina , Domenico Zambella

Dedekind domains and their class groups are notions in commutative algebra that are essential in algebraic number theory. We formalized these structures and several fundamental properties, including number theoretic finiteness results for…

Logic in Computer Science · Computer Science 2022-08-31 Anne Baanen , Sander R. Dahmen , Ashvni Narayanan , Filippo A. E. Nuccio

This article is a short review on the relationship between convergent matrix integrals, formal matrix integrals, and combinatorics of maps. We briefly summarize results developed over the last 30 years, as well as more recent discoveries.…

Mathematical Physics · Physics 2007-05-23 Bertrand Eynard