English
Related papers

Related papers: Some matrices associated with the split decomposit…

200 papers

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

Optimization and Control · Mathematics 2023-10-02 Levent Tunçel , Stephen A. Vavasis , Jingye Xu

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

If V(R) is the vertex set of a symmetric cycle R in the tope graph of a simple oriented matroid M, then for any tope T of M there exists a unique inclusion-minimal subset Q(T,R) of V(R) such that T is the sum of the topes of Q(T,R). If for…

Combinatorics · Mathematics 2017-03-30 Andrey O. Matveev

Networks are frequently studied algebraically through matrices. In this work, we show that networks may be studied in a more abstract level using results from the theory of matroids by establishing connections to networks by decomposition…

Combinatorics · Mathematics 2015-11-17 Konstantinos Papalamprou , Leonidas Pitsoulis

Let $\Gamma$ denote a distance-regular graph with vertex set $X$ and diameter $D \geq 3$. Fix a vertex $x \in X$. Let the field $\mathbb{F}$ be either $\mathbb{R}$ or $\mathbb{C}$. Let $\operatorname{Mat}_X(\mathbb{F})$ denote the…

Combinatorics · Mathematics 2025-11-25 Blas Fernández , Jae-Ho Lee , Jongyook Park

Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…

Combinatorics · Mathematics 2008-04-11 Stefko Miklavic

Let $\Gamma$ be a $Q$-polynomial distance-regular graph of diameter $d\geq 3$. Fix a vertex $\gamma$ of $\Gamma$ and consider the subgraph induced on the union of the last two subconstituents of $\Gamma$ with respect to $\gamma$. We prove…

Combinatorics · Mathematics 2020-08-28 Sebastian M. Cioabă , Jack H. Koolen , Paul Terwilliger

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph, with vertex set $X$ and diameter $D\geq 3$. The standard module $V$ has a basis $\lbrace {\hat x} \vert x \in X\rbrace$, where ${\hat x}$ denotes column $x$ of the identity matrix…

Combinatorics · Mathematics 2024-05-28 Kazumasa Nomura , Paul Terwilliger

Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…

Discrete Mathematics · Computer Science 2021-01-25 Michel Habib , Lalla Mouatadid , Eric Sopena , Mengchuan Zou

We present matrices as graded BiHom-algebras and consider various characteristics of their decompositions. Specifically, we introduce a notion of connection in the support of the grading and use it to construct a family of canonical graded…

Rings and Algebras · Mathematics 2025-05-06 Jiacheng Sun , Shuanhong Wang , Haoran Zhu

Let $\Gamma$ denote an undirected, connected, regular graph with vertex set $X$, adjacency matrix $A$, and ${d+1}$ distinct eigenvalues. Let ${\mathcal A}={\mathcal A}(\Gamma)$ denote the subalgebra of Mat$_X({\mathbb C})$ generated by $A$.…

Combinatorics · Mathematics 2020-09-14 M. A. Fiol , Safet Penjić

We consider a distance-regular graph $\Gamma=(X, \mathcal R)$ called the bilinear forms graph $H_q(D,N-D)$; we assume $N>2D\geq 6$ and $q \not=2$. We show that $\Gamma$ satisfies the following strengthened version of the balanced set…

Combinatorics · Mathematics 2026-01-28 Paul Terwilliger , Jason Williford

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

Symbolic Computation · Computer Science 2024-08-29 Yuki Ishihara , Kazuhiro Yokoyama

We study the direct sum of q-matroids by way of their cyclic flats. Using that the rank function of a q-matroid is fully determined by the cyclic flats and their ranks, we show that the cyclic flats of the direct sum of two q-matroids are…

Combinatorics · Mathematics 2023-02-23 Heide Gluesing-Luerssen , Benjamin Jany

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

The Jantzen sum formula for cyclotomic v-Schur algebras yields an identity for some q-analogues of the decomposition matrices of these algebras. We prove a similar identity for matrices of canonical bases of higher-level Fock spaces. We…

Representation Theory · Mathematics 2007-05-23 Xavier Yvonne

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $\Gamma$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix…

Combinatorics · Mathematics 2024-05-08 Jack H. Koolen , Jae-Ho Lee , Ying-Ying Tan

We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…

Symbolic Computation · Computer Science 2021-02-15 Mark Giesbrecht , Hui Huang , George Labahn , Eugene Zima

We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let $\Gamma$ be a graph with vertex set $V$, diameter $D$, adjacency matrix $A$, and…

Combinatorics · Mathematics 2015-08-18 V. Diego , M. A. Fiol

In this tutorial, exponentiation and factorization (decomposition) formulas are derived and discussed for common matrix operators that arise in studies of classical dynamics, linear and nonlinear optics, and special relativity. To…

Optics · Physics 2025-08-26 C. J. McKinstrie , M. V. Kozlov