Related papers: The Schur--Weyl graph and Thoma's theorem
The family of visibility algorithms were recently introduced as mappings between time series and graphs. Here we extend this method to characterize spatially extended data structures by mapping scalar fields of arbitrary dimension into…
We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…
The evaluation of graphs on 2-spheres is a central ingredient of the Turaev-Viro construction of three-dimensional topological field theories. In this article, we introduce a class of graphs, called extruded graphs, that is relevant for the…
A topological index of a graph $G$ is a real number which is preserved under isomorphism. Extensive studies on certain polynomials related to these topological indices have also been done recently. In a similar way, chromatic versions of…
Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$, $\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$, respectively. Recently, Caro, Davila and Pepper…
We deduce decompositions of natural representations of general linear groups and symmetric groups from combinatorial bijections involving tableaux. These include some of Howe's dualities, Gelfand models, the Schur-Weyl decomposition of…
Let W be a Weyl group. We define a class of irreducible representations of W that we call antispecial. They are in bijection with the constructible representations of W. We define an oriented graph structure on the set of antispecial…
Polynomial representations of general linear groups and modules over Schur algebras are compared. We work over an arbitrary commutative ring and show that Schur-Weyl duality is the key for an equivalence between both categories.
Pairs of graded graphs, together with the Fomin property of graded graph duality, are rich combinatorial structures providing among other a framework for enumeration. The prototypical example is the one of the Young graded graph of integer…
This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…
We introduce a graded homology theory for graded \'etale groupoids. For $\mathbb Z$-graded groupoids, we establish an exact sequence relating the graded zeroth-homology to non-graded one. Specialising to the arbitrary graph groupoids, we…
We prove that there is a unique graph with four edges which is the Gruenberg-Kegel graph of a solvable cut group. This contributes to the classification of the Gruenberg-Kegel graphs of solvable cut groups initiated in [A. B\"achle, A.…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
Given a family of graphs $\mathcal{F}$ and an integer $r$, we say that a graph is $r$-Ramsey for $\mathcal{F}$ if any $r$-colouring of its edges admits a monochromatic copy of a graph from $\mathcal{F}$. The threshold for the classic Ramsey…
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the…
Thrall's problem asks for the Schur decomposition of the higher Lie modules $\mathcal{L}_\lambda$, which are defined using the free Lie algebra and decompose the tensor algebra as a general linear group module. Although special cases have…
We classify the derived tame Schur and infinitesimal Schur algebras and describe indecomposable objects in their derived categories.
We review some recent advances in modular representation theory of symmetric groups and related Hecke algebras. We discuss connections with Khovanov-Lauda-Rouquier algebras and gradings on the blocks of the group algebras $F\Sigma_n$, which…
Courcelle's Theorem is an important result in graph theory, proving the existence of linear-time algorithms for many decision problems on graphs whose tree-width is bounded by a constant. The purpose of this text is twofold: to provide an…
An important property of chordal graphs is that these graphs are characterized by existence of perfect elimination orderings on their vertex sets. In this paper, we generalize the notion of perfect elimination orderings to signed graphs,…