Related papers: The Schur--Weyl graph and Thoma's theorem
We introduce sequentially $S_r$ modules over a commutative graded ring and sequentially $S_r$ simplicial complexes. This generalizes two properties for modules and simplicial complexes: being sequentially Cohen-Macaulay, and satisfying…
We give a cohomological criterion for certain decomposition of Borel graphs, which is an analog of Dunwoody's work on accessibility of groups. As an application, we prove that a Borel graph $(X,G)$ with uniformly bounded degrees of…
The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an…
A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…
We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…
We introduce a new class of graded rings extending the class of generalized Weyl algebras. These rings are orders in crossed products of the most general type, and we introduce their basic structure theory. We provide an extensive list of…
Let $V$ be a vertex algebra of countable dimension, $G$ a subgroup of ${\rm Aut} V$ of finite order, $V^{G}$ the fixed point subalgebra of $V$ under the action of $G$, and ${\mathscr S}$ a finite $G$-stable set of inequivalent irreducible…
In this thesis we prove Schur-positivity of certain graph families. In addition, we exlpor existence of cyclic descent extensions on several families of Schur-positive sets.
Voloshyn introduced rational Weyl group elements in connection with rational normal forms on complex reductive groups and conjectured that, in type $D_r$ with $r$ odd, their number is $2^r-1$. We prove a stronger structural statement. For…
We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph. This leads to a characterization of chordal graphs…
We prove a Schur-Weyl duality between the quantum enveloping algebra of $\mathfrak{gl}_m$ and certain quotient algebras of Ariki-Koike algebras, which we give explicitly. The duality involves several algebraically independent parameters and…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
The Gruenberg-Kegel graph $\Gamma(G)$ associated with a finite group $G$ has as vertices the prime divisors of $|G|$, with an edge from $p$ to $q$ if and only if $G$ contains an element of order $pq$. This graph has been the subject of much…
We propose a new approach to study the Kronecker coefficients by using the Schur-Weyl duality between the symmetric group and the partition algebra. We explain the limiting behavior and associated bounds in the context of the partition…
The Erd\H{o}s, Gr\"unwald, and Weiszfeld theorem is a characterization of those infinite graphs which are Eulerian. That is, infinite graphs that admit infinite Eulerian paths. In this article we prove an effective version of the Erd\H{o}s,…
We consider the set of all graphs on n labeled vertices with prescribed degrees D=(d_1, ..., d_n). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within…
We commence by constructing the mirabolic quantum Schur algebra, utilizing the convolution algebra defined on the variety of triples of two $n$-step partial flags and a vector. Subsequently, we employ a stabilization procedure to derive the…
Integrated Gradients (IG) is a common explainability technique to address the black-box problem of neural networks. Integrated gradients assumes continuous data. Graphs are discrete structures making IG ill-suited to graphs. In this work,…