English
Related papers

Related papers: The subconstituent algebra of a bipartite distance…

200 papers

This paper is a contribution to the study of the subgroup structure of exceptional algebraic groups over algebraically closed fields of arbitrary characteristic. Following Serre, a closed subgroup of a semisimple algebraic group $G$ is…

Group Theory · Mathematics 2017-12-22 Adam R. Thomas

In this paper, we first show that for an acyclic gentle algebra A, the irreducible components of any moduli space of A-modules are products of projective spaces. Next, we show that the nice geometry of the moduli spaces of modules of an…

Representation Theory · Mathematics 2014-07-30 Andrew T. Carroll , Calin Chindris

Let $Q$ be a wild $n$-Kronecker quiver, i.e., a quiver with two vertices, labeled by 1 and 2, and $n\geq 3$ arrows from 2 to 1. The indecomposable regular modules with preprojective Gabriel-Roiter submodules, in particular, those…

Representation Theory · Mathematics 2010-04-27 Bo Chen

Let V be a simple vertex operator algebra and G a finite automorphism group. We give a construction of intertwining operators for irreducible V^G-modules which occur as submodules of irreducible V-modules by using intertwining operators for…

Quantum Algebra · Mathematics 2013-12-18 Kenichiro Tanabe

Let F be a finite field and G=GL(2n,F). In this paper, we explicitly describe a certain twisted Jacquet module of an irreducible cuspidal representation of G.

Representation Theory · Mathematics 2022-06-09 Kumar Balasubramanian , Abhishek Dangodara , Himanshi Khurana

For a graph $G$, let $f_2(G)$ denote the largest number of vertices in a $2$-regular subgraph of $G$. We determine the minimum of $f_2(G)$ over $3$-regular $n$-vertex simple graphs $G$. To do this, we prove that every $3$-regular multigraph…

Combinatorics · Mathematics 2019-03-22 Ilkyoo Choi , Ringi Kim , Alexandr Kostochka , Boram Park , Douglas B. West

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

Combinatorics · Mathematics 2014-03-18 Alexander L. Gavrilyuk , Jack H. Koolen

A graph is locally irregular if no two adjacent vertices have the same degree. The irregular chromatic index $\chi_{\rm irr}'(G)$ of a graph $G$ is the smallest number of locally irregular subgraphs needed to edge-decompose $G$. Not all…

Combinatorics · Mathematics 2016-04-04 Julien Bensmail , Martin Merker , Carsten Thomassen

Given a proper edge coloring $\varphi$ of a graph $G$, we define the palette $S_{G}(v,\varphi)$ of a vertex $v \in V(G)$ as the set of all colors appearing on edges incident with $v$. The palette index $\check s(G)$ of $G$ is the minimum…

Combinatorics · Mathematics 2023-06-22 C. J. Casselgren , Petros A. Petrosyan

The parameter $q(G)$ of an $n$-vertex graph $G$ is the minimum number of distinct eigenvalues over the family of symmetric matrices described by $G$. We show that all $G$ with $e(\overline{G}) = |E(\overline{G})| \leq \lfloor n/2 \rfloor…

Combinatorics · Mathematics 2024-11-21 Wayne Barrett , Shaun Fallat , Veronika Furst , Shahla Nasserasr , Brendan Rooney , Michael Tait

Let $\Gamma=\Gamma(A)$ denote a simple strongly connected digraph with vertex set $X$, diameter $D$, and let $\{A_0,A:=A_1,A_2,\ldots,A_D\}$ denote the set of distance-$i$ matrices of $\Gamma$. Let $\{R_i\}_{i=0}^D$ denote a partition of…

Combinatorics · Mathematics 2024-04-08 Giusy Monzillo , Safet Penić

A subset $X$ of vertices in a graph $G$ is a {\em diameter 2 subset} if the distance of any two vertices of $X$ is at most two {\em in $G[X]$}. Relaxing this notion, a subset $X$ of vertices in a graph $G$ is a {\em 2-reachable subset} if…

Combinatorics · Mathematics 2025-06-16 Andras Gyarfas , Gabor N. Sarkozy

For a graph $G$ of order $n$ and with eigenvalues $\lambda_1\geqslant\cdots\geqslant\lambda_n$, the HL-index $R(G)$ is defined as $R(G) ={\max}\left\{|\lambda_{\lfloor(n+1)/2\rfloor}|, |\lambda_{\lceil(n+1)/2\rceil}|\right\}.$ We show that…

Combinatorics · Mathematics 2013-12-11 Bojan Mohar , Behruz Tayfeh-Rezaie

Let $A$ be an Artin algebra, $M$ be a Gorenstein projective $A$-module and $B =$ End$_A M$, then $M$ is a $A$-$B$-bimodule. We use the restricted flat dimension of $M_B$ to give a characterization of the homological dimensions of $A$ and…

Representation Theory · Mathematics 2018-02-05 Aiping Zhang

Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…

Combinatorics · Mathematics 2017-10-06 Taichi Kousaka

A dominating set of a graph $G$ is a set $D\subseteq V_G$ such that every vertex in $V_G-D$ is adjacent to at least one vertex in $D$, and the domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. In…

Combinatorics · Mathematics 2019-08-13 Mateusz Miotk , Jerzy Topp , Paweł Żyliński

We study the representations of a class of non-commutative polynomial algebras truncated at degree 3, with one additional relation. We determine the irreducible components of their varieties of representations. We do this by showing that…

Representation Theory · Mathematics 2024-10-28 Marko Čmrlec

This paper studies the twisted representations of vertex operator algebras. Let V be a vertex operator algebra and g an automorphism of V of finite order T. For any m,n in (1/T)Z_+, an A_{g,n}(V)-A_{g,m}(V)-bimodule A_{g,n,m}(V) is…

Quantum Algebra · Mathematics 2007-05-23 Chongying Dong , Cuipo Jiang

Let $V$ be a vertex algebra and $g$ be an automorphism of $V$ of order $T$. For any $n, m \in (1/T)\mathbb{N}$, we construct an $\tilde{A}_{g,n}(V)\!-\!\tilde{A}_{g,m}(V)$-bimodule $\tilde{A}_{g,n,m}(V)$, where $\tilde{A}_{g,n}(V)$ denotes…

Quantum Algebra · Mathematics 2025-12-02 Shun Xu

This paper is the second in a series of papers characterizing the maximum packing of \( T \)-cuts in bipartite grafts, following the first paper (N.~Kita, ``Tight cuts in bipartite grafts~I: Capital distance components,''…

Combinatorics · Mathematics 2025-04-01 Nanao Kita