Related papers: Strings in abstract root systems

Let $q=p^r$ be a power of an odd prime $p$. We study binary sequences $\sigma=(\sigma_0,\sigma_1,\ldots)$ with entries in $\{0,1\}$ defined by using the quadratic character $\chi$ of the finite field $\mathbb{F}_q$: $$ \sigma_n=\left\{…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

The spectrum of a first-order sentence is the set of the cardinalities of its finite models. In this paper, we consider the spectra of sentences over binary relations that use at least three variables. We show that for every such sentence…

We generalize the definition and properties of root systems to complex reflection groups - roots become rank one projective modules over the ring of integers of a number field k. In the irreducible case, we provide a classification of root…

Let $\Lambda$ be a finite dimensional string algebra over a field with the quiver $Q$ such that the underlying graph of $Q$ is a tree, and let $|\Det(\Lambda)|$ be the number of the minimal right determiners of all irreducible morphisms…

We present a new lambda-calculus with explicit substitutions and named variables. Renaming of bound variables in this calculus is explicit (there is a special rewrite rule) and can be delayed. Contexts (environments) are not sets or lists…

Let $\Phi$ be a root system of type $E_6$, $E_7$, or $E_8$. Let $K$ be a field of characteristic $2$. Let $\delta$ be the maximal root of $\Phi$ and set $\Phi_0 = \{\alpha\in\Phi; \delta\perp\alpha\}$. We describe orbits of the group…

Splints of root system of simple lie algebras appears naturally on studies of embedding of reductive subalgebras. A splint can be used to construct a branching rules as implementation of this idea simplifies calculation of branching…

A set A=A_{k,n} in [n]\cup{0} is said to be an additive k-basis if each element in {0,1,...,kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple representations as k-sums, and given any function phi(n), with…

Let $\mathbf{k}$ be an algebraically closed field. In this article, inspired by the description of indecomposable objects in the derived category of a gentle algebra obtained by V. Bekkert and H. A. Merklen, we define string complexes for a…

A re-calculation of a known family of formulas of PI is carried out, revisiting the old Archimedes' algorithm. This allows to identify a general family equation and three new simple formulas of Pi in terms of the golden ratio PHI in the…

We study a categorical generalisation of tree automata, as $\Sigma$-algebras for a fixed endofunctor $\Sigma$ endowed with initial and final states. Under mild assumptions about the base category, we present a general minimisation algorithm…

Terms in the lambda-calculus can be represented as planar trees decorated with symbols for abstraction and application, and having variables as leaves. In this paper, we concentrate on the branches of such trees, rather than on the trees…

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…

Let $G$ be a finite group, $n$ a positive integer. $\pi(n)$ denotes the set of all prime divisors of $n$ and $\pi(G)=\pi(|G|)$. The prime graph $\Gamma(G)$ of $G$, defined by Grenberg and Kegel, is a graph whose vertex set is $\pi(G)$, two…

Let the base $\beta$ be a complex number, $|\beta|>1$, and let $A \subset \C$ be a finite alphabet of digits. The \emph{$A$-spectrum} of $\beta$ is the set $S_{A}(\beta) = \{\sum_{k=0}^n a_k\beta^k \mid n \in \mathbb{N}, \ a_k \in {A}\}$.…

An \emph{indeterminate string} $x = x[1..n]$ on an alphabet $\Sigma$ is a sequence of nonempty subsets of $\Sigma$; $x$ is said to be \emph{regular} if every subset is of size one. A proper substring $u$ of regular $x$ is said to be a…

In this thesis we develop the cohomology of diagrams of algebras and then apply this to the cases of the $\lambda$-rings and the $\Psi$-rings. A diagram of algebras is a functor from a small category to some category of algebras. For an…

We give a formal treatment of simple type theories, such as the simply-typed $\lambda$-calculus, using the framework of abstract clones. Abstract clones traditionally describe first-order structures, but by equipping them with additional…

This article introduces a new term "splint" and classifies the splints of the classical root systems. The motivation comes from representation theory of semisimple Lie algebras. In a few instances, splints play a role in determining…