Related papers: Strings in abstract root systems

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…

An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…

Let $R$ be an indecomposable root system. It is well known that any root is part of a basis $B$ of $R$. But when can you extend a set of two or more roots to a basis $B$ of $R$? A $\pi$-system is a linearly independent set of roots, $C$,…

This note generalizes the Fibonacci primitive roots to the set of integers. An asymptotic formula for counting the number of integers with such primitive root is introduced here.

Let $\phi$ be a birational map of the complex projective plane. We know that $\phi$ can be written as a composition of automorphisms of $\mathbb{P}^2_\mathbb{C}$ and the standard quadratic birational map $\sigma$. This writing, that is…

Let $a$ be a real euclidean vector space of finite dimension and $\Sigma$ a root system in $a$ with a basis $\Delta$. Let $\Theta \subset \Delta$ and $M = M_{\Theta}$ be a standard Levi of a reductive group $G$ such that $a_\Theta = a_M /…

Let $\Pi$ be the fundamental group of a smooth variety X over $F_p$. Given a non-Archimedean place $\lambda$ of the field of algebraic numbers which is prime to p, consider the $\lambda$-adic pro-semisimple completion of $\Pi$ as an object…

We present an easily defined countable family of permutations of the natural numbers for which explicit rearrangements (i.e., the sums induced by the permutations) can be computed. The digamma function proves to be the key tool for the…

A permutation $\pi$ contains a permutation $\sigma$ as a pattern if it contains a subsequence of length $|\sigma|$ whose elements are in the same relative order as in the permutation $\sigma$. This notion plays a major role in enumerative…

We classify isomorphic classes of the homomorphisms of a root system $\Xi$ to a root system $\Sigma$ which do not change Cartan integers. We examine several types of isomorphic classes defined by the Weyl group of $\Sigma$, that of $\Xi$…

Let $ \Phi=(G, \varphi) $ be a connected complex unit gain graph ($ \mathbb{T} $-gain graph) on a simple graph $ G $ with $ n $ vertices and maximum vertex degree $ \Delta $. The associated adjacency matrix and degree matrix are denoted by…

The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…

For a terminal alphabet $\Sigma$ and an attribute alphabet $\Gamma$, a $(\Sigma, \Gamma)$-extractor is a function that maps every string over $\Sigma$ to a table with a column per attribute and with sets of positions of $w$ as cell entries.…

Let $\Phi$ be a root system of type $A_l$ or $D_l$. Let $K$ be a field of characteristic not $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…

$\mathop{\rm rp}\nolimits ({\mathbb B})$ denotes the reduced power ${\mathbb B}^\omega /\Phi$ of a Boolean algebra ${\mathbb B}$, where $\Phi$ is the Fr\'{e}chet filter $\Phi$ on $\omega$. We investigate iterated reduced powers…

Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…

Let $G$ be a finite group. We let $\f{m}(G)$ and $\sig(G)$ denote the number of maximal subgroups of $G$ and the least positive integer $n$ such that $G$ is written as the union of $n$ proper subgroups, respectively. In this paper we…

We will introduce a notion of normal subshifts. A subshift $(\Lambda,\sigma)$ is said to be normal if it satisfies a certain synchronizing property called $\lambda$-synchronizing and is infinite as a set. We have lots of purely infinite…

The concept of a skew root of a skew polynomial is used to introduce notions of algebraic closedness for $\sigma$-fields, that is, a field equipped with an endomorphism. It is shown that every $\sigma$-field can be embedded in algebraically…

A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with…