arXiv 0902.43672009-02math.COmath.RAmath.RT

Intersection matrices revisited

N. Ghareghani, E. Ghorbani, M. Mohammad-Noori

备注：: 17 pages, revised version

英文摘要：

Several intersection matrices of $s$-subsets vs. $k$-subsets of a $v$-set are introduced in the literature. We study these matrices systematically through counting arguments and generating function techniques. A number of new or known identities appear as natural consequences of this viewpoint; especially, appearance of the derivative operator $d/dz$ and some related operators reveals some connections between intersection matrices and the "combinatorics of creation-annihilation". As application, the eigenvalues of several intersection matrices including some generalizations of the adjacency matrices of the Johnson scheme are derived; two new bases for the Bose--Mesner algebra of the Johnson scheme are introduced and the associated intersection numbers are obtained as well. Finally, we determine the rank of some intersection matrices.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

强弦图作为树的交图（Farber 证明的重述）

Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)

本文重述了 Farber 关于强弦图可表示为加权树的相容子树交图的未发表证明，并给出一个直接将相容子树转化为强消去序的替代充分性证明。

2025-03-12cs.CGmath.CO

重温蜂窝与厄米矩阵之和

Honeycombs and Sums of Hermitian Matrices, Revisited

MIT（麻省理工学院）

该研究对Knutson和Tao定理给出新证明，通过提炼蜂窝与厄米三元组谱共有的四个基本性质，公理式论证二者关系，认为蜂窝是厄米三元组的‘模型生物’，为蜂窝与厄米矩阵的关联提供新见解。

2026-07-09math.COmath.RT

Singularity of random symmetric matrices revisited

Let $M_n$ be drawn uniformly from all $\pm 1$ symmetric $n \times n$ matrices. We show that the probability that $M_n$ is singular is at most $\exp(-c(n\log n)^{1/2})$, which represents a natural barrier in recent approaches to this problem. In addition to improving on the best-known previous bound of Campos, Mattos, Morris and Morrison of $\exp(-c n^{1/2})$ on the singularity probability, our method is different and considerably simpler.

2020-11-05math.COmath.PR

重温Burling图，第一部分：新刻画

Burling graphs revisited, part I: New characterizations

本文研究了Burling图，即Burling序列中图的诱导子图，提出了五种新的等价定义方法，包括三种几何方法、一种图论方法和一种公理化方法。

2023-09-07cs.DMmath.CO

Testing isomorphism of circular-arc graphs -- Hsu's approach revisited

Circular-arc graphs are intersection graphs of arcs on the circle. The aim of our work is to present a polynomial time algorithm testing whether two circular-arc graphs are isomorphic. To accomplish our task we construct decomposition trees, which are the structures representing all normalized intersection models of circular-arc graphs. Normalized models reflect the neighbourhood relation in circular-arc graphs and can be seen as their canonical representations; in particular, every intersection model can be easily transformed into a normalized one. Our work adapts and appropriately extends th…

2019-07-12cs.DSmath.CO

M-Ambiguity Sequences for Parikh Matrices and Their Periodicity Revisited

The introduction of Parikh matrices by Mateescu et al. in 2001 has sparked numerous new investigations in the theory of formal languages by various researchers, among whom is Serbanuta. Recently, a decade-old conjecture by Serbanuta on the M-ambiguity of words was disproved, leading to new possibilities in the study of such words. In this paper, we investigate how selective repeated duplications of letters in a word affect the M-ambiguity of the resulting words. The corresponding M-ambiguity of those words are then presented in sequences, which we term as M-ambiguity sequences. We show that ne…

2019-01-13math.CO

更多相关论文收起更多论文

Reconstructing surface triangulations by their intersection matrices

The intersection matrix of a finite simplicial complex has as each of its entries the rank of the intersection of its respective simplices. We prove that such matrix defines the triangulation of a closed connected surface up to isomorphism.

2014-02-24math.CO

Intersection Graphs of Oriented Hypergraphs and Their Matrices

For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are investigated including the incidence dual, the intersection graph (line graph), and the 2-section. A connection is then made between oriented hypergraphs and balanced incomplete block designs.

2015-09-07math.CO

Conference matrices with maximum excess and two-intersection sets

A two-intersection set with parameters $(j;α,β)$ for a block design is a $j$-subset of the point set of the design, which intersects every block in $α$ or $β$ points. In this paper, we show the existence of a two-intersection set with parameters $(2m^2-m+1;m^2-m,m^2)$ for the block design obtained from translations of the set of nonzero squares in the finite field of order $q=4m^2+1$. As an application, we give a construction of conference matrices with maximum excess based on the two-intersection sets.

2016-11-04math.CO

总交易、交集矩阵与Specht模块

Total trades, intersection matrices and Specht modules

本文研究总交易的表示理论，证明其为对称群的不可约表示，并基于Specht多项式构造总交易模块的基。

2025-11-28math.COmath.RT

1-相交关联矩阵秩的表示论计算：2元子集与n元子集

A representation-theoretic computation of the rank of $1$-intersection incidence matrices: $2$-subsets vs. $n$-subsets

该研究利用对称群表示论，在任意域上计算了2元子集与n元子集构成的1-相交关联矩阵$W_{2,n}^{1}(m)$的秩，并给出了一般相交关联矩阵$W_{k,n}^{i}(m)$具有大p秩的简单条件。

2023-05-05math.COmath.RT

A few weight systems arising from intersection graphs

We show that the adjacency matrices of the intersection graphs of chord diagrams satisfy the 2-term relations of Bar-Natan and Garoufalides [bg], and hence give rise to weight systems. Among these weight systems are those associated with the Conway and HOMFLYPT polynomials. We extend these ideas to looking at a space of {\it marked} chord diagrams modulo an extended set of 2-term relations, define a set of generators for this space, and again derive weight systems from the adjacency matrices of the (marked) intersection graphs. Among these weight systems are those associated with the Kauffman …

2002-05-29math.COmath.GT

三角张量与集合相交问题

Triangular tensors and set-intersection problems

本文定义了推广三角矩阵的三角张量概念并证明类似切片秩引理，利用切片秩框架为集合相交定理提供更简短证明，改进了部分Snevily定理，并为反向奇镇问题的推广给出新界限。

2025-11-04math.CO

广义Petersen图中覆盖半径1的完全正则码的交数组

Intersection Arrays of Completely Regular Codes of Covering Radius One in Generalized Petersen Graphs

Georgia State University（佐治亚州立大学）

研究广义Petersen图GP(n,k)中覆盖半径1的完全正则码的所有可能交数组，通过完美2-着色等价转化为商矩阵枚举，给出存在性的充要算术条件并构造显式周期着色。

2026-06-15math.CO

矩阵空间中的禁止交定理

Forbidden Intersection Theorems for Matrix Spaces

Massachusetts Institute of Technology（麻省理工学院）；Boston University（波士顿大学）；University of Memphis（孟菲斯大学）；Einstein Institute of Mathematics, Hebrew University（希伯来大学爱因斯坦数学研究所）

研究一般线性群中矩阵族避免特定维数核交的问题，证明当t小于常数倍n时，极大家族仅由t-共治族及其对偶构成，并给出Frankl-Rödl型构造表明t>n/2时行为改变。

2026-06-11math.CO

6维实Bruhat细胞交集的同伦类型

Homotopy Type of Intersections of Real Bruhat Cells in Dimension 6

Universidade Federal Fluminense（弗鲁米嫩塞联邦大学）；PUC-Rio（天主教里约热内卢大学）

研究实Bruhat细胞任意交集的同伦类型，对于6×6实矩阵，通过分析至多12个逆序的置换的连通分支，发现除σ=[563412]外所有分支可缩，而后者具有圆圈的伦型。

2026-06-24math.ATmath.COmath.GN

子集相交关系的整数对角形式

Integer diagonal forms for subset intersection relations

本文推广了 Wilson 和 Bier 的工作，描述了子集相交关系下关联矩阵及其在 Bose-Mesner 代数中线性张成矩阵的 Smith 群，给出了计算相关图临界群的有效算法，并首次给出了大小为 3 的 Kneser 和 Johnson 图相关矩阵的对角形式。

2024-11-18math.CO