Related papers: Matrices of 3iet preserving morphisms
Standard subword tokenization methods fragment numbers inconsistently, causing large language models (LLMs) to lose positional and decimal structure - a primary driver of errors in arithmetic and scientific reasoning. We introduce Triadic…
It has been a long standing problem to find good symbolic codings for translations on the $d$-dimensional torus that enjoy the beautiful properties of Sturmian sequences like low factor complexity and good local discrepancy properties.…
We study the existence and left properness of transferred model structures for "monoid-like" objects in monoidal model categories. These include genuine monoids, but also all kinds of operads as for instance symmetric, cyclic, modular,…
This work is a contribution to the study of set of the representations of integers in a rational base number system. This prefix-closed subset of the free monoid is naturally represented as a highly non regular tree whose nodes are the…
In this paper, we determine representatives for the mutation classes of skew-symmetrizable 3x3 matrices and associated graphs using a natural minimality condition, generalizing and strengthening results of Beineke-Brustle-Hille and…
An infinite permutation is a linear ordering of the set of natural numbers. An infinite permutation can be defined by a sequence of real numbers where only the order of elements is taken into account. In the paper we investigate a new class…
The monoid of all partial injections on a finite set (the symmetric inverse semigroup) is of particular interest because of the well-known Wagner-Preston Theorem. In this article, we step forward the study of a submonoid of the symmetric…
We study stable subspaces of positive extremal maps of finite dimensional matrix algebras that preserve trace and matrix identity (so-called bistochastic maps). We have established the existence of the isometric-sweeping decomposition for…
The model of programs over (finite) monoids, introduced by Barrington and Th\'erien, gives an interesting way to characterise the circuit complexity class $\mathsf{NC^1}$ and its subclasses and showcases deep connections with algebraic…
By reformulating a learning process of a set system L as a game between Teacher and Learner, we define the order type of L to be the order type of the game tree, if the tree is well-founded. The features of the order type of L (dim L in…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…
In this paper we perform a rigorous mathematical analysis of the word2vec model, especially when it is equipped with the Skip-gram learning scheme. Our goal is to explain how embeddings, that are now widely used in NLP (Natural Language…
We study non-linear surjective mappings on subsets of ${\cal M}_n(F)$, which preserve the zeros of some fixed polynomials in noncommuting variables. Keywords: Matrix algebra, Multilinear polynomials, Preservers.
Genome rearrangements are events in which large blocks of DNA exchange pieces during evolution. The analysis of such events is a tool for understanding evolutionary genomics, based on finding the minimum number of rearrangements to…
Morphisms to finite semigroups can be used for recognizing omega-regular languages. The so-called strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic…
We introduce a class of fixed points of primitive morphisms among aperiodic binary generalized pseudostandard words. We conjecture that this class contains all fixed points of primitive morphisms among aperiodic binary generalized…
The Markov Theorem Without Stabilization (MTWS) (see math.GT/0310279) established the existence of a calculus of braid isotopies that can be used to move between closed braid representatives of a given oriented link type without having to…
In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to our best knowledge, is an open problem in literature.
Applied category theory often studies symmetric monoidal categories (SMCs) whose morphisms represent open systems. These structures naturally accommodate complex wiring patterns, leveraging (co)monoidal structures for splitting and merging…
Translation into morphologically-rich languages challenges neural machine translation (NMT) models with extremely sparse vocabularies where atomic treatment of surface forms is unrealistic. This problem is typically addressed by either…