Related papers: Graphs and Reflection Groups
We study reflection-symmetric realisations of symmetric graphs in the plane that allow a continuous symmetry and edge-length preserving deformation. To do so, we identify a necessary combinatorial condition on graphs with…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…
We introduce the notion of "binary" positive and complex geometries, giving a completely rigid geometric realization of the combinatorics of generalized associahedra attached to any Dynkin diagram. We also define open and closed "cluster…
We study modular and integral flow polynomials of graphs by means of subgroup arrangements and lattice polytopes. We introduce an Eulerian equivalence relation on orientations, flow arrangements, and flow polytopes; and we apply the theory…
From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…
We investigate restricted Lie algebras arising as analogues of (twisted) right-angled Artin groups and right-angled Coxeter groups over fields of characteristic two. These algebras are defined via quadratic relations determined by decorated…
The Feynman amplitude associated to a graph is a period of a certain motive. The sum of these motive classes over all connected graphs with no multiple edges or tadpoles and n vertices is defined in the Grothendieck ring of varieties. This…
The theory of generalized Weyl algebras is used to study the $2\times 2$ reflection equation algebra $\mathcal{A}=\mathcal{A}_q(\operatorname{M}_2)$ in the case that $q$ is not a root of unity, where the $R$-matrix used to define…
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$…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…
We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of considering the cycle space of a graph which is an abelian…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
Given a graph $H$ on vertex set $\{1,2,\cdots, n\}$ and a function $f:[0,1]^2 \rightarrow \mathbb{R}$, define \begin{align*} \|f\|_{H}:=\left\vert\int \prod_{ij\in E(H)}f(x_i,x_j)d\mu^{|V(H)|}\right\vert^{1/|E(H)|}, \end{align*} where $\mu$…
Let W be a finite group generated by unitary reflections and A be the set of reflecting hyperplanes. We will give a characterization of the logarithmic differential forms with poles along A in terms of anti-invariant differential forms. If…
Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
This paper classifies and constructs explicitly all the irreducible representations of affine Hecke algebras of rank two root systems. The methods used to obtain this classification are primarily combinatorial and are, for the most part, an…
We establish geodesic normal forms for the general series of complex reflection groups G(de,e,n) by using the presentations of Corran-Picantin and Corran-Lee-Lee of G(e,e,n) and G(de,e,n) for d > 1, respectively. This requires the…