Related papers: Abelian Primitive Words
We shall prove that an automorphism of a simple abelian variety is primitive if and only if it is of infinite order.
We consider partial words with a unique position starting a power. We show that over a $k$ letter alphabet, a partial word with a unique position starting a square can contain at most $k$ squares. This is in contrast to full words which can…
In order to design strong paradigms for isolating lexical access and semantics, we need to know what a word is. Surprisingly few linguists and philosophers have a clear model of what a word is, even though words impact basically every…
Trapezoidal words are finite words having at most n+1 distinct factors of length n, for every n>=0. They encompass finite Sturmian words. We distinguish trapezoidal words into two disjoint subsets: open and closed trapezoidal words. A…
Solving math word problems requires deductive reasoning over the quantities in the text. Various recent research efforts mostly relied on sequence-to-sequence or sequence-to-tree models to generate mathematical expressions without…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
Non-native speakers show difficulties with spoken word processing. Many studies attribute these difficulties to imprecise phonological encoding of words in the lexical memory. We test an alternative hypothesis: that some of these…
We announce a number of conjectures associated with and arising from a study of primes and irrationals in $\mathbb{R}$. All are supported by numerical verification to the extent possible.
We investigate effective properties of uncountable free abelian groups. We show that identifying free abelian groups and constructing bases for such groups is often computationally hard, depending on the cardinality. For example, we show,…
We investigate the least number of palindromic factors in an infinite word. We first consider general alphabets, and give answers to this problem for periodic and non-periodic words, closed or not under reversal of factors. We then…
A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with primitives to support modeling of complex, structured probability distributions. Each of these languages…
We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a…
There are two natural and well-studied approaches to temporal ontology and reasoning: point-based and interval-based. Usually, interval-based temporal reasoning deals with points as a particular case of duration-less intervals. A recent…
Abelian groups having partial orderings compatible with their binary operations have long been studied in the literature. In particular, lattice-ordered abelian groups constitute a universal-algebraic variety, and thus form a category which…
We prove surjectivity of certain word maps on finite non-abelian simple groups. More precisely, we prove the following: if N is a product of two prime powers, then the word map sending (x,y) to the product of the Nth powers of x and y is…
Based on an analysis of the inference rules used, we provide a characterization of the situations in which classical provability entails intuitionistic provability. We then examine the relationship of these derivability notions to uniform…
This paper presents a unified algebraic study of a family of logics related to Abelian logic (Ab), the logic of Abelian lattice-ordered groups. We treat Ab as the base system and refer to its expansions as superabelian logics. The paper…
We revisit the question of classification of balanced circular words and focus on the case of a ternary alphabet. We propose a $3$-dimensional generalisation of the discrete approximation representation of Christoffel words. By considering…
In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…
The description of resources in game semantics has never achieved the simplicity and precision of linear logic, because of a misleading conception: the belief that linear logic is more primitive than game semantics. We advocate instead the…