Related papers: On the structure of regular $B_2$-type crystals

We present a simple combinatorial model for the characters of the irreducible integrable highest weight modules for complex symmetrizable Kac-Moody algebras. This model can be viewed as a discrete counterpart to the Littelmann path model.…

A simple graph-product type construction shows that for all natural numbers $r \ge q$, there exists an edge-coloring of the complete graph on $2^r$ vertices using $r$ colors where the graph consisting of the union of arbitrary $q$ color…

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…

Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…

We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…

The tableau model for Kirillov-Reshetikhin (KR) crystals, which are finite dimensional crystals corresponding to certain affine Lie algebras, is commonly used for its ease of crystal operator calculations. However, its simplicity makes…

In the recent papers with Masaki Kashiwara, the author introduced the notion of symmetric crystals and presented the Lascoux-Leclerc-Thibon-Ariki type conjectures for the affine Hecke algebras of type $B$. Namely, we conjectured that…

In this paper, we introduce the notion of abstract crystals for quantum generalized Kac-Moody algebras and study their fundamental properties. We then prove the crystal embedding theorem and give a characterization of the crystals…

We introduce the notion of dual perfect bases and dual perfect graphs. We show that every integrable highest weight module $V_q(\lambda)$ over a quantum generalized Kac-Moody algebra $U_{q}(\mathcal{g})$ has a dual perfect basis and its…

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…

We relate star colouring of even-degree regular graphs to the notions of locally constrained graph homomorphisms to the oriented line graph $ \vec{L}(K_q) $ of the complete graph $ K_q $ and to its underlying undirected graph $ L^*(K_q) $.…

We study the combinatorics of crystal graphs given by highest weight representations of types $A_{n}, B_{n}, C_{n}$, and $D_{n}$, uncovering new relations that exist among crystal operators. Much structure in these graphs has been revealed…

The Lascoux-Leclerc-Thibon-Ariki theory asserts that the K-group of the representations of the affine Hecke algebras of type A is isomorphic to the algebra of functions on the maximal unipotent subgroup of the group associated with a Lie…

We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…

A graph $G$ is $k$-{\em critical} if it has chromatic number $k$, but every proper subgraph of $G$ is $(k-1)$--colorable. Let $f_k(n)$ denote the minimum number of edges in an $n$-vertex $k$-critical graph. Recently the authors gave a lower…

A 2-edge-coloured graph $G$ is called {\bf locally complete} if for each vertex $v$, the vertices adjacent to $v$ through edges of the same colour induce a complete subgraph in $G$. Locally complete 2-edge-coloured graphs have nice…

This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…

The Blume-Emery-Griffiths model with a random crystal field is studied in a random graph architecture, in which the average connectivity is a controllable parameter. The disordered average over the graph realizations is treated by replica…

A "folklore conjecture, probably due to Tutte" (as described in [P.D. Seymour, Sums of circuits, Graph theory and related topics (Proc. Conf., Univ. Waterloo, 1977), pp. 341-355, Academic Press, 1979]) asserts that every bridgeless cubic…

Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…