English
Related papers

Related papers: A duality between pairs of split decompositions fo…

200 papers

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter at least three and standard module $V$. We introduce two direct sum decompositions of $V$. We call these the displacement decomposition for $\Gamma$ and the split…

Combinatorics · Mathematics 2007-05-23 Paul Terwilliger

We consider a $Q$-polynomial distance-regular graph $\Gamma$ with vertex set $X$ and diameter $D \geq 3$. For $\mu, \nu \in \lbrace \downarrow, \uparrow \rbrace$ we define a direct sum decomposition of the standard module $V=\C X$, called…

Combinatorics · Mathematics 2007-10-25 Joohyung Kim

Let $\Gamma$ be a dual polar graph with diameter $D \geqslant 3$, having as vertices the maximal isotropic subspaces of a finite-dimensional vector space over the finite field $\mathbb{F}_q$ equipped with a non-degenerate form (alternating,…

Combinatorics · Mathematics 2018-02-13 Jae-Ho Lee , Hajime Tanaka

We consider a 2-homogeneous bipartite distance-regular graph $\Gamma$ with diameter $D \geq 3$. We assume that $\Gamma$ is not a hypercube nor a cycle. We fix a $Q$-polynomial ordering of the primitive idempotents of $\Gamma$. This…

Combinatorics · Mathematics 2026-03-25 Paul Terwilliger

Given a graph $G$, a subgraph $H$ is isometric if $d_H(u,v) = d_G(u,v)$ for every pair $u,v\in V(H)$, where $d$ is the distance function. A graph $G$ is distance preserving (dp) if it has an isometric subgraph of every possible order. A…

Discrete Mathematics · Computer Science 2018-05-28 Emad Zahedi , Jason P. Smith

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

Let $K$ denote a field and let $V$ denote a vector space over $K$ with finite positive dimension. We consider a pair of linear transformations $A:V \to V$ and $A^*:V \to V$ that satisfy (i)--(iv) below: (i) Each of $A$, $A^*$ is…

Rings and Algebras · Mathematics 2007-05-23 Kazumasa Nomura , Paul Terwilliger

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

Combinatorics · Mathematics 2016-01-20 Jianmin Ma , Jack Koolen

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D\geq 1$. For a vertex $x$ of $\Gamma$ the corresponding subconstituent algebra $T=T(x)$ is generated by the adjacency matrix $A$ of $\Gamma$ and the dual adjacency…

Combinatorics · Mathematics 2026-03-25 Paul Terwilliger

We discuss the Grassmann graph $J_q(N,D)$ with $N \geq 2D$, having as vertices the $D$-dimensional subspaces of an $N$-dimensional vector space over the finite field $\mathbb{F}_q$. This graph is distance-regular with diameter $D$; to avoid…

Combinatorics · Mathematics 2022-04-20 Jae-Ho Lee

Let $\Gamma$ denote the Hamming graph $H(D,r)$ with $r \geq 3$. Consider the distance matrices $\{A_i\}_{i=0}^{D}$ of $\Gamma$. Fix a vertex $x$ of $\Gamma$, and consider the dual distance matrices $\{A_i^{*}\}_{i=0}^{D}$ of $\Gamma$ with…

Combinatorics · Mathematics 2018-01-18 Siwaporn Mamart

We introduce preordered semi-orthogonal decompositions (psod-s) of dg-categories. We show that homotopy limits of dg-categories equipped with compatible psod-s carry a natural psod. This gives a way to glue semi-orthogonal decompositions…

Algebraic Geometry · Mathematics 2020-05-07 Sarah Scherotzke , Nicolò Sibilla , Mattia Talpo

We introduce a notion of $Q$-algebra that can be considered as a generalization of the notion of $Q$-manifold (a supermanifold equipped with an odd vector field obeying $\{Q,Q\} =0$). We develop the theory of connections on modules over…

High Energy Physics - Theory · Physics 2009-11-07 Albert Schwarz

In this paper, we consider the decomposition of multigraphs under minimum degree constraints and give a unified generalization of several results by various researchers. Let $G$ be a multigraph in which no quadrilaterals share edges with…

Combinatorics · Mathematics 2020-09-07 Qinghou Zeng , Chunlei Zu

Let $\Gamma$ denote a finite, connected graph with vertex set $X$. Fix $x \in X$ and let $\varepsilon \ge 3$ denote the eccentricity of $x$. For mutually distinct scalars $\{\theta^*_i\}_{i=0}^\varepsilon$ define a diagonal matrix…

Combinatorics · Mathematics 2025-03-05 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

Let $\Gamma=\Gamma(2n,q)$ be the dual polar graph of type $Sp(2n,q)$. Underlying this graph is a $2n$-dimensional vector space $V$ over a field ${\mathbb F}_q$ of odd order $q$, together with a symplectic (i.e. nondegenerate alternating…

Combinatorics · Mathematics 2015-09-22 G. Eric Moorhouse , Jason Williford

We consider a type of distance-regular graph $\Gamma=(X, \mathcal R)$ called a bilinear forms graph. We assume that the diameter $D$ of $\Gamma$ is at least $3$. Fix adjacent vertices $x,y \in X$. In our first main result, we introduce an…

Combinatorics · Mathematics 2026-03-25 Paul Terwilliger , Jason Williford

We obtain the following characterization of $Q$-polynomial distance-regular graphs. Let $\G$ denote a distance-regular graph with diameter $d\ge 3$. Let $E$ denote a minimal idempotent of $\G$ which is not the trivial idempotent $E_0$. Let…

Combinatorics · Mathematics 2009-08-31 Aleksandar Jurisic , Paul Terwilliger , Arjana Zitnik

We introduce real-valued $(p,q)$-forms on weighted metric graphs with boundary similar to Lagerberg forms on polyhedral spaces. We compute the Dolbeault cohomology and prove Poincar\'e duality. Using Thuillier's thesis, the skeleton of a…

Algebraic Geometry · Mathematics 2021-11-11 Walter Gubler , Philipp Jell , Joseph Rabinoff

We study a relationship between $Q$-polynomial distance-regular graphs and the double affine Hecke algebra of type $(C^{\vee}_1,C_1)$. Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$. We assume that $\Gamma$…

Representation Theory · Mathematics 2016-05-03 Jae-Ho Lee
‹ Prev 1 2 3 10 Next ›