Related papers: The Schur--Weyl graph and Thoma's theorem
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
In continuation of our recent work arXiv:2006.07312, we classify the extremal traces on infinite diagram algebras that appear in the context of Schur-Weyl duality for Banica and Speicher's easy groups. We show that the branching graphs of…
We introduce the notion of a "graded topological space": a topological space endowed with a sheaf of abelian groups which we think of as a sheaf of gradings. Any object living on a graded topological space will be graded by this sheaf of…
We develop and study the generalization of rational Schur algebras to the super setting. Similar to the classical case, this provides a new method for studying rational supermodules of the general linear supergroup $GL(m|n)$. Furthermore,…
The threshold network model is a type of finite random graphs. In this paper, we introduce a generalized threshold network model. A pair of vertices with random weights is connected by an edge when real-valued functions of the pair of…
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…
Vertex operator realizations of symplectic and orthogonal Schur functions are studied and expanded. New proofs of determinant identities of irreducible characters for the symplectic and orthogonal groups are given. We also give a new proof…
In a recent paper, we studied the interaction between the automorphism group of a graph and its Tutte polynomial. More precisely, we proved that certain symmetries of graphs are clearly reflected by their Tutte polynomials. The purpose of…
We define the Schur-Agler class in infinite variables to consist of functions whose restrictions to finite dimensional polydisks belong to the Schur-Agler class. We show that a natural generalization of an Agler decomposition holds and the…
In this paper we consider bi-Cohen-Macaulay graphs, and give a complete classification of such graphs in the case they are bipartite or chordal. General bi-Cohen-Macaulay graphs are classified up to separation. The inseparable…
For a graph G and integer r \geq 1 we denote the family of independent r-sets of V(G) by I^{(r)}(G). A graph G is said to be r-EKR if no intersecting subfamily of I^{(r)}(G) is larger than the largest such family all of whose members…
A Kirchhoff graph is a vector graph with orthogonal cycles and vertex cuts. An algorithm has been developed that constructs all the Kirchhoff graphs up to a fixed edge multiplicity. This algorithm is used to explore the structure of prime…
Let $G$ be a complex linear algebraic group, $\mathfrak{g}=\Lie(G)$ its Lie algebra and $e\in\mathfrak{g}$ a nilpotent element. Vust's theorem says that in case of $G=\GL(V)$, the algebra $\mbox{End}_{G_e}(V^{\otimes d})$, where $G_e\subset…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of…
The GG-width of a class of graphs GG is defined as follows. A graph G has GG-width k if there are k independent sets N1,...,Nk in G such that G can be embedded into a graph H in GG such that for every edge e in H which is not an edge in G,…
For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…
This paper presents the Persistent Weisfeiler-Lehman Random walk scheme (abbreviated as PWLR) for graph representations, a novel mathematical framework which produces a collection of explainable low-dimensional representations of graphs…
The 2-switch-degree of $G$ is the number of distinct 2-switches acting on a graph $G$. In this work we study structural properties of the 2-switch-degree, with a focus on split graphs. Our approach is motivated by the Tyshkevich…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…