Related papers: Compression of root systems and the E-sequence
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…
We study subsets in possibly degenerate symplectic vector spaces over finite fields, which are stable under a given Coxeter/Weyl reflection group. These symplectic root systems provide crucial combinatorical data to classify…
We tackle several problems related to a finite irreducible crystallographic root system $\Phi$ in the real vector space $\mathbb E$. In particular, we study the combinatorial structure of the subsets of $\Phi$ cut by affine subspaces of…
Three-graded root systems can be arranged into nested sequences. One exceptional sequence provides a natural means to recover some structures and symmetries familiar in the context of particle physics.
Extended affine root systems appear as the root systems of extended affine Lie algebras. A subclass of extended affine root systems, whose elements are called ``minimal" turns out to be of special interest mostly because of the geometric…
Rooted phylogenetic networks are rooted acyclic digraphs. They are used to model complex evolution where hybridization, recombination and other reticulation events play important roles. A rigorous definition of network compression is…
An efficient advanced numerical model for mapping the distribution of the buried tree roots is presented. It not only simplify the complicate root branches to an easy manipulated model, but also grasp the main structure of tree roots…
In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…
We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We study the combinatorial and structural properties of the circle map sequences. We introduce an embedding procedure which gives a map from the hull(closure of the set of translates) to the sequence of embedding operations through which we…
In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a…
The notion of a "root base" together with its geometry plays a crucial role in the theory of finite and affine Lie theory. However, it is known that such a notion does not exist for the recent generalizations of finite and affine root…
Recent methods for learning vector space representations of words have succeeded in capturing fine-grained semantic and syntactic regularities using vector arithmetic. However, these vector space representations (created through large-scale…
This paper is devoted to proving an infinite sequence of relations for rooted tree maps. On the way, we also give a basis for the space of rooted tree maps.
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…
We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…
The interaction of a Lie algebra $\LL,$ having a weight space decomposition with respect to a nonzero toral subalgebra, with its corresponding root system forms a powerful tool in the study of the structure of $\LL.$ This, in particular,…
A combinatorial model of molecular conformational space that was previously developped (J. Gabarro-Arpa, Comp. Biol. and Chem. 27, (2003) 153-159), had the drawback that structures could not be properly embedded beacause it lacked explicit…