相关论文: Matrices of 3iet preserving morphisms
We define a new class of ternary sequences that are 2-balanced. These sequences are obtained by colouring of Sturmian sequences. We show that the class contains sequences of any given letter frequencies. We provide an upper bound on factor…
We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices…
A classical (or quantum) second order superintegrable system is an integrable n-dimensional Hamiltonian system with potential that admits 2n-1 functionally independent second order constants of the motion polynomial in the momenta, the…
Any infinite uniformly recurrent word ${\bf u}$ can be written as concatenation of a finite number of return words to a chosen prefix $w$ of ${\bf u}$. Ordering of the return words to $w$ in this concatenation is coded by derivated word…
Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, \pi, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural…
The category $\operatorname{STROP}$ of commutative semirings, whose morphisms are transmissions, is a full and reflective subcategory of the category $\operatorname{STROP}_m$ of supertropical monoids. Equivalence relations on supertropical…
The currently fastest algorithm for regular expression pattern matching and membership improves the classical O(nm) time algorithm by a factor of about log^{3/2}n. Instead of focussing on general patterns we analyse homogeneous patterns of…
Repeated idempotent elements are commonly used to characterise iterable behaviours in abstract models of computation. Therefore, given a monoid $M$, it is natural to ask how long a sequence of elements of $M$ needs to be to ensure the…
Two words are $k$-binomially equivalent if each subword of length at most $k$ occurs the same number of times in both words. The $k$-binomial complexity of an infinite word is a counting function that maps $n$ to the number of $k$-binomial…
Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…
We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case,…
In this paper, we introduce monoidal rewriting systems (MRS), an abstraction of string rewriting in which reductions are defined over an arbitrary ambient monoid rather than a free monoid of words. This shift is partly motivated by logic:…
Large language models (LLMs) take sequences of subwords as input, requiring them to effective compose subword representations into meaningful word-level representations. In this paper, we present a comprehensive set of experiments to probe…
The seven binary quantum numbers that distinguish fundamental fermions have been shown to be conserved in decays and interactions. Here applications of this law are clarified to take account of odd (uct) and even (dsb) parity quarks…
The meanings and relationships of words shift over time. This phenomenon is referred to as semantic shift. Research focused on understanding how semantic shifts occur over multiple time periods is essential for gaining a detailed…
Let \(A=(A,\star)\) be a finite binary algebra, not necessarily associative. For each \(n\geq 1\), every full binary bracketing on \(x_1,\dots,x_n\) determines an \(n\)-ary term operation on \(A\), and hence an evaluation word obtained by…
We present a polynomial-time algorithm that discovers all maximal patterns in a point set, $D\subset\mathbb{R}^k$, that are related by transformations in a user-specified class, $F$, of bijections over $\mathbb{R}^k$. We also present a…
Embeddings of word structures into matrix semigroups provide a natural bridge between combinatorics on words and linear algebra. However, low-dimensional matrix semigroups impose strong structural restrictions on possible embeddings.…
This paper proves coherence results for categories with a natural transformation called \emph{intermutation} made of arrows from $(A\wedge B)\vee(C\wedge D)$ to ${(A\vee C)\wedge(B\vee D)}$, for $\wedge$ and $\vee$ being two biendofunctors.…
Large language models exhibit sophisticated capabilities, yet understanding how they work internally remains a central challenge. A fundamental obstacle is that training selects for behavior, not circuitry, so many weight configurations can…