Related papers: Strings in abstract root systems

A fragment of second-order lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be non-interleaved and stratified, i.e., the types are assigned levels, and a…

An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…

Let $\Gamma$ and $\Lambda$ be artin algebras such that $\Gamma$ is a split-by-nilpotent extension of $\Lambda$ by a two sided ideal $I$ of $\Gamma.$ Consider the so-called change of rings functors $G:={}_\Gamma\Gamma_\Lambda\otimes_\Lambda…

A group $G$ is called root graded if it has a family of subgroups $G_\alpha$ indexed by roots from a root system $\Phi$ satisfying natural conditions similar to Chevalley groups over commutative unital rings. For any such group there is a…

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Finite automata (FA) are a fundamental computational abstraction that is widely used in practice for various tasks in computer science, linguistics, biology, electrical engineering, and artificial intelligence. Given an input word, an FA…

We introduce the notion of $\alpha$-numbers and formal intercept of sturmian words, and derive from this study general factorisations formula for sturmian words. Sturmian words are defined as infinite words with lowest unbound complexity,…

Suppose that $\chi_\lambda$ and $\chi_\mu$ are distinct irreducible characters of the symmetric group $S_n$. We give an algorithm that, in time polynomial in $n$, constructs $\pi\in S_n$ such that $\chi_\lambda(\pi)$ is provably different…

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements, and let $m_1$ and $m_2$ be positive integers. Given polynomials $f_1(x), f_2(x) \in \mathbb{F}_q[x]$ with $\textrm{deg}(f_i(x)) \leq m_i$, for $i = 1, 2$, and such that the…

Long before we learn to construct the field of rational numbers (out of the ring of integers) at university, we learn how to calculate with fractions at school. When it comes to "numbers", we are used to a commutative multiplication, for…

We show that a strongly $\lambda$-spirallike function of order $\alpha$ can be extended to a $\sin(\pi\alpha/2)$-quasiconformal automorphism of the complex plane for $-\pi/2<\lambda<\pi/2$ and $0<\alpha<1$ with $|\lambda|<\pi\alpha/2.$ In…

A pseudo-Anosov surface automorphism $\phi$ has associated to it an algebraic unit $\lambda_\phi$ called the dilatation of $\phi$. It is known that in many cases $\lambda_\phi$ appears as the spectral radius of a Perron-Frobenius matrix…

A formula $\phi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\phi$ is provable in $S$ together with all true arithmetical $\Pi_{n}$-sentences taken as additional axioms. While in general the set of all $n$-provable…

We study varieties of certain ordered $\Sigma$-algebras with restricted completeness and continuity properties. We give a general characterization of their free algebras in terms of submonads of the monad of $\Sigma$-coterms. Varieties of…

In a previous work, "pure data" is proposed as an axiomatic foundation for mathematics and computing, based on "finite sequence" as the foundational concept rather than based on logic or type. Within this framework, objects with…

For a set $\Gamma$, a function $\lambda:\Gamma\to \Gamma$ and a non-trivial abelian group $K$, the generalized shift $\sigma_\lambda:K^\Gamma\to K^\Gamma$ is defined by $(x_i)_{i\in \Gamma}\mapsto (x_{\lambda(i)})_{i\in\Gamma}$. In this…

In this paper we propose a new, more appropriate definition of regular and indeterminate strings. A regular string is one that is "isomorphic" to a string whose entries all consist of a single letter, but which nevertheless may itself…

A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…

We define a general notion of centrally $\Gamma$-graded sets and groups and of their graded products, and prove some basic results about the corresponding categories: most importantly, they form braided monoidal categories. Here, $\Gamma$…

The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Hence $\Phi_n(x)$ is trivially zero at primitive $n^{th}$ roots of unity. Using finite Fourier analysis we derive a formula for…