English
Related papers

Related papers: Transitions between root subsets associated with C…

200 papers

In a recent paper, Barot and Marsh presented an explicit construction of presentation of a finite Weyl group by any seed of corresponding cluster algebra, i.e. by any diagram mutation-equivalent to an orientation of a Dynkin diagram with…

Combinatorics · Mathematics 2019-10-25 Anna Felikson , Pavel Tumarkin

We introduce and study "2-roots", which are symmetrized tensor products of orthogonal roots of Kac--Moody algebras. We concentrate on the case where $W$ is the Weyl group of a simply laced Y-shaped Dynkin diagram $Y_{a,b,c}$ having $n$…

Representation Theory · Mathematics 2023-04-11 R. M. Green , Tianyuan Xu

In the present paper we study twisted foldings of root systems which generalize usual involutive foldings corresponding to automorphisms of Dynkin diagrams. Our motivating example is the Lusztig projection of the root system of type $E_8$…

Algebraic Geometry · Mathematics 2019-11-25 Martina Lanini , Kirill Zainoulline

Bispanning graphs are undirected graphs with an edge set that can be decomposed into two disjoint spanning trees. The operation of symmetrically swapping two edges between the trees, such that the result is a different pair of disjoint…

Combinatorics · Mathematics 2016-05-12 Timo Bingmann

For a finite group $G$, let $B$ be an equivalence (equality, conjugacy or order) relation on $G$ and let $A$ be a (power, enhanced power or commuting) graph with vertex set $G$. The $B$ super $A$ graph is a simple graph with vertex set $G$…

Group Theory · Mathematics 2022-10-27 Sandeep Dalal , Sanjay Mukherjee , Kamal Lochan Patra

For a group $H$ and a non empty subset $\Gamma\subseteq H$, the commuting graph $G=\mathcal{C}(H,\Gamma)$ is the graph with $\Gamma$ as the node set and where any $x,y \in \Gamma$ are joined by an edge if $x$ and $y$ commute in $H$. We…

Group Theory · Mathematics 2017-12-11 Umar Hayat , Álvaro Nolla de Celis , Fawad Ali

Cayley-Dickson doubling procedure is used to construct the root systems of some celebrated Lie algebras in terms of the integer elements of the division algebras of real numbers, complex numbers, quaternions and octonions. Starting with the…

High Energy Physics - Theory · Physics 2009-11-11 Mehmet Koca , Ramazan Koc , Muataz Al-Barwani

This paper introduces a new systematic algorithm for constructing periodic Euclidean weaving diagrams with combinatorial arguments. It is shown that such a weaving diagram can be considered as a specific type of four-regular periodic planar…

Combinatorics · Mathematics 2022-06-24 Mizuki Fukuda , Motoko Kotani , Sonia Mahmoudi

A domain exchange map (DEM) is a dynamical system defined on a smooth Jordan domain which is a piecewise translation. We explain how to use cut-and-project sets to construct minimal DEMs. Specializing to the case in which the domain is a…

Dynamical Systems · Mathematics 2021-03-19 Ian Alevy , Richard Kenyon , Ren Yi

A new formulation of Calogero-Moser models based on root systems and their Weyl group is presented. The general construction of the Lax pairs applicable to all models based on the simply-laced algebras (ADE) are given for two types which we…

High Energy Physics - Theory · Physics 2009-10-31 A. J. Bordner , E. Corrigan , R. Sasaki

We introduce a signed variant of (valued) quivers and a mutation rule that generalizes the classical Fomin-Zelevinsky mutation of quivers. To any signed valued quiver we associate a matrix that is a signed analogue of the Cartan counterpart…

Representation Theory · Mathematics 2025-12-03 Joseph Grant , Davide Morigi

Let \Gamma be a Dynkin diagram of type A,D,E and let R denote the corresponding root system. In this paper we give a categorical construction of R from \Gamma. Instead of choosing an orientation of \Gamma and studying representations of the…

Representation Theory · Mathematics 2012-05-29 Alexander Kirillov , Jaimal Thind

The microscopic model in which nodes interacting with each other are statistical systems is introduced. The nodes conditions are connected with a string of distinct microscopic configurations and depend on external parameters (pressure and…

Statistical Mechanics · Physics 2007-05-23 V. Stepanov

Time-continuous dynamical systems defined on graphs are often used to model complex systems with many interacting components in a non-spatial context. In the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a…

Molecular Networks · Quantitative Biology 2010-07-02 Markus Kirkilionis , Luca Sbano

Two classes of avalanche-finite matrices and their critical groups (integer cokernels) are studied from the viewpoint of chip-firing/sandpile dynamics, namely, the Cartan matrices of finite root systems and the McKay-Cartan matrices for…

Combinatorics · Mathematics 2016-03-01 Georgia Benkart , Caroline Klivans , Victor Reiner

In this paper, we combine group-theoretic and combinatorial techniques to study $\wedge$-transitive digraphs admitting a cartesian decomposition of their vertex set. In particular, our approach uncovers a new family of digraphs that may be…

Combinatorics · Mathematics 2014-07-02 Joy Morris , Pablo Spiga

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

Combinatorics · Mathematics 2018-06-01 V. I. Zhukov

Motivated by work of Kac and Lusztig, we define a root system and a Weyl groupoid for a large class of semisimple Yetter-Drinfeld modules over an arbitrary Hopf algebra. The obtained combinatorial structure fits perfectly into an existing…

Quantum Algebra · Mathematics 2008-07-08 I. Heckenberger , H. -J. Schneider

A family of periodic perturbations of an attracting robust heteroclinic cycle defined on the two-sphere is studied by reducing the analysis to that of a one-parameter family of maps on a circle. The set of zeros of the family forms a…

Dynamical Systems · Mathematics 2025-01-03 Isabel S. Labouriau , Alexandre A. P Rodrigues

For a simple drawing $D$ of the complete graph $K_n$, two (plane) subdrawings are compatible if their union is plane. Let $\mathcal{T}_D$ be the set of all plane spanning trees on $D$ and $\mathcal{F}(\mathcal{T}_D)$ be the compatibility…