English
Related papers

Related papers: Free operated monoids and Rewriting systems

200 papers

In this thesis we explore natural procedures through which topological structure can be constructed from specific semigroups. We will do this in two ways: 1) we equip the semigroup object itself with a topological structure, and 2) we find…

Group Theory · Mathematics 2026-01-21 Luna Elliott

A group is Markov if it admits a prefix-closed regular language of unique representatives with respect to some generating set, and strongly Markov if it admits such a language of unique minimal-length representatives over every generating…

Group Theory · Mathematics 2015-10-21 Alan J. Cain , Victor Maltcev

This paper is based on three hours of lectures given by the first author in the "Focus Program on Analytic Function Spaces and their Applications" July 1 -- December 31, 2021, organized by the Fields Institute for Research in Mathematical…

Functional Analysis · Mathematics 2022-01-25 I. Chalendar , J. R. Partington

Rewriting is a formalism widely used in computer science and mathematical logic. The classical formalism has been extended, in the context of functional languages, with an order over the rules and, in the context of rewrite based languages,…

Logic in Computer Science · Computer Science 2019-06-12 Horatiu Cirstea , Pierre-Etienne Moreau

The left regular band structure on a hyperplane arrangement and its representation theory provide an important connection between semigroup theory and algebraic combinatorics. A finite semigroup embeds in a real hyperplane face monoid if…

Group Theory · Mathematics 2013-01-01 Stuart Margolis , Franco Saliola , Benjamin Steinberg

For a finite field of odd number of elements we construct families of permutation binomials and permutation trinomials with one fixed-point (namely zero) and remaining elements being permuted as disjoint cycles of same length. Binomials and…

Combinatorics · Mathematics 2023-06-28 Anitha G , P Vanchinathan

We present a construction method for complete sets of cyclic mutually unbiased bases (MUBs) in Hilbert spaces of even prime power dimensions. In comparison to usual complete sets of MUBs, complete cyclic sets possess the additional property…

Quantum Physics · Physics 2010-06-22 Oliver Kern , Kedar S. Ranade , Ulrich Seyfarth

In this paper, we propose the concept of an $\Omega$-Rota-Baxter system, which is a generalization of a Rota-Baxter system and an $\Omega$-Rota-Baxter algebra of weight zero. In the framework of operated algebras, we obtain a linear basis…

Rings and Algebras · Mathematics 2022-09-20 Yuanyuan Zhang , Huhu Zhang , Xing Gao

This chapter is an introduction to the Free Fermionic Formulation of String Theory, with emphasis on heterotic model building. After a brief review of bosonization in two dimensional conformal field theories, we discuss how internal bosonic…

High Energy Physics - Theory · Physics 2025-10-27 Ioannis Florakis , John Rizos

Quotient is a basic operation of formal languages, which plays a key role in the construction of minimal deterministic finite automata (DFA) and the universal automata. In this paper, we extend this operation to formal power series and…

Formal Languages and Automata Theory · Computer Science 2012-03-13 Yongming Li , Qian Wang , Sanjiang Li

We present a general algorithm for constructing a free resolution for unit groups of orders in semisimple rational algebras. The approach is based on computing a contractible $G$-complex employing the theory of minimal classes of quadratic…

K-Theory and Homology · Mathematics 2017-01-02 Sebastian Schönnenbeck

A complete set of d+1 mutually unbiased bases exists in a Hilbert spaces of dimension d, whenever d is a power of a prime. We discuss a simple construction of d+1 disjoint classes (each one having d-1 commuting operators) such that the…

Quantum Physics · Physics 2009-11-10 A. B. Klimov , L. L. Sanchez-Soto , H. de Guise

In this paper we develop the theory of operads, algebras and modules in cofibrantly generated symmetric monoidal model categories. We give J-semi model strucures, which are a slightly weaker version of model structures, for operads and…

Algebraic Topology · Mathematics 2007-05-23 Markus Spitzweck

It is proved that, given a (von Neumann) regular semigroup with finitely many left and right ideals, if every maximal subgroup is presentable by a finite complete rewriting system, then so is the semigroup. To achieve this, the following…

Group Theory · Mathematics 2017-06-23 Robert Gray , António Malheiro

The fundamental groups of most (conjecturally, all) closed 3-manifolds with uniform geometries have finite complete rewriting systems. The fundamental groups of a large class of amalgams of circle bundles also have finite complete rewriting…

Group Theory · Mathematics 2008-02-03 Susan Hermiller , Michael Shapiro

In this work we construct an extension for the category of 0-modules by analogy with [H.-J. Baues and G. Wirshing, Cohomology of small categories, J. Pure Appl. Algebra, 38(1985), 187-211]. The 0-cohomology functor becomes a derived functor…

Category Theory · Mathematics 2008-03-03 A. A. Kostin , B. V. Novikov

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

Rings and Algebras · Mathematics 2018-08-09 Konrad Schrempf

We consider algebras of rational power series over an alphabet $\Sigma$ with coefficients in a commutative semiring $K$ and characterize them as the free algebras in various classes of algebraic structures.

Formal Languages and Automata Theory · Computer Science 2011-04-14 Zoltan Esik , Werner Kuich

In this paper we present a procedure to build the set of irreducible numerical semigroups with a fixed Frobenius number. The construction gives us a rooted tree structure for this set. Furthermore, by using the notion of Kunz-coordinates…

Number Theory · Mathematics 2011-05-12 V. Blanco , J. C. Rosales

String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency…

Logic in Computer Science · Computer Science 2025-02-05 Aleksandar Milosavljevic , Robin Piedeleu , Fabio Zanasi
‹ Prev 1 8 9 10 Next ›