English
Related papers

Related papers: A Note On Square-free Sequences and Anti-unificati…

200 papers

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Formal Languages and Automata Theory · Computer Science 2024-06-04 Juha Honkala

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

Group Theory · Mathematics 2025-04-14 Jorge Almeida

Generalized Feller theory provides an important analog to Feller theory beyond locally compact state spaces. This is very useful for solutions of certain stochastic partial differential equations, Markovian lifts of fractional processes, or…

Probability · Mathematics 2023-08-09 Christa Cuchiero , Tonio Möllmann , Josef Teichmann

Let $\mathbb{N}$ be a set of the natural numbers. Symmetric inverse semigroup $R_\infty$ is the semigroup of all infinite 0-1 matrices $[g_{ij}]$ with at most one 1 in each row and each column such that $g_{ii}=1$ on the complement of a…

Representation Theory · Mathematics 2025-08-20 Artem Dudko , Nikolay I. Nessonov

An $f$-subgroup is a linear recurring sequence subgroup, a multiplicative subgroup of a field whose elements can be generated (without repetition) by a linear recurrence relation, with characteristic polynomial $f$. It is called…

Combinatorics · Mathematics 2021-03-26 Henk D. L. Hollmann , Medet Zhanbulatuly

A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…

Group Theory · Mathematics 2022-04-27 Noah Caplinger , Nick Salter

We study isometric representations of the semigroup $\mathbb{Z}_+\backslash \{1\}$. Notion of an inverse representation is introduced and a complete description (up to unitary equivalence) of such representations is given. Also, we study a…

Operator Algebras · Mathematics 2013-03-05 Suren A. Grigoryan , Vardan H. Tepoyan

A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine…

Combinatorics · Mathematics 2026-05-20 Ming-Hsuan Kang , Shin-Hsun Chou

This work presents a formalization of analogy on numbers that relies on generalized means. It is motivated by recent advances in artificial intelligence and applications of machine learning, where the notion of analogy is used to infer…

Artificial Intelligence · Computer Science 2024-07-29 Yves Lepage , Miguel Couceiro

We introduce an algebra of instruction sequences by presenting a semigroup C in which programs can be represented without directional bias: in terms of the next instruction to be executed, C has both forward and backward instructions and a…

Programming Languages · Computer Science 2009-11-07 Jan A. Bergstra , Alban Ponse

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…

Combinatorics · Mathematics 2018-04-06 Yaroslav Shitov

Isomorphism is central to the structure of mathematics and has been formalized in various ways within dependent type theory. All previous treatments have done this by replacing quantification over sets with quantification over groupoids of…

Logic in Computer Science · Computer Science 2020-05-13 David McAllester

This is the third part of a cycle of papers devoted to the construction of a finitely presented infinite nil-semigroup satisfying the identity $x^9 = 0$. This construction answers the problem of L. N. Shevrin and M. V. Sapir, posed, for…

Rings and Algebras · Mathematics 2022-06-23 Ilya A. Ivanov-Pogodaev , Alexey Ya. Kanel-Belov

Around 1980 commutator theory was generalized from groups to arbitrary algebras using the socalled term condition commutator. The semigroups that are abelian with respect to this commutator were classified by Warne (1994). We study what…

Group Theory · Mathematics 2025-05-15 Peter Mayr

Transductions are binary relations of finite words. For rational transductions, i.e., transductions defined by finite transducers, the inclusion, equivalence and sequential uniformisation problems are known to be undecidable. In this paper,…

Formal Languages and Automata Theory · Computer Science 2016-03-01 Emmanuel Filiot , Ismaël Jecker , Christof Löding , Sarah Winter

A program is a finite piece of data that produces a (possibly infinite) sequence of primitive instructions. From scratch we develop a linear notation for sequential, imperative programs, using a familiar class of primitive instructions and…

Programming Languages · Computer Science 2013-04-17 Jan A. Bergstra , Alban Ponse

This article is devoted to the classification of anti-dendriform algebras that are associated with associativity. They are characterized as algebras with two operations whose sum is associative. In particular, the paper is devoted to…

Rings and Algebras · Mathematics 2024-04-02 K. Abdurasulov , J. Adashev , Z. Normatov , Sh. Solijonova

The present work stemmed from the study of the problem of harmonic analysis on the infinite-dimensional unitary group U(\infty). That problem consisted in the decomposition of a certain 4-parameter family of unitary representations, which…

Representation Theory · Mathematics 2016-03-10 Vadim Gorin , Grigori Olshanski

We introduce a framework for proving statements about linear operators by verification of ideal membership in a free algebra. More specifically, arbitrary first-order statements about identities of morphisms in preadditive semicategories…

Logic · Mathematics 2024-03-13 Clemens Hofstadler , Clemens G. Raab , Georg Regensburger

This paper presents both a method and a result. The result presents a closed formula for the sum of the first $m+1,m \ge 0,$ squares of the sequence $F^{(k)}$ where each member is the sum of the previous $k$ members and with initial…

Number Theory · Mathematics 2022-05-03 Russell Jay Hendel