arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.07239math.COmath.RA
收藏

有限域上的多斜矩阵与Jacobi-Trudi行列式

Multislant matrices and Jacobi--Trudi determinants over finite fields

Omesh Dhar Dwivedi, Jonah Blasiak, Darij Grinberg

AI总结:

本文研究有限域上Jacobi-Trudi矩阵行列式为零的概率,对部分构成等差数列的分拆给出公式并推广了Anzis等人的猜想,同时证明带状斜分拆情形下行列式在有限域上均匀分布。

摘要:

计算代数簇上$\mathbb{F}_q$-值点的个数这一问题已从代数几何、拓扑和组合学等视角得到了深入研究。我们探讨了Anzis等人(2018)研究过的一个具有组合风味的版本,该问题与Kontsevich、Elkies和Haglund的工作类似。Anzis等人考虑了如下问题:若变量从有限域中均匀随机选取,Jacobi-Trudi矩阵的行列式为零的概率是多少?他们针对钩形、阶梯形和矩形等多种分拆给出了公式。我们对各部分构成等差数列的分拆给出了公式,验证并推广了他们的一个猜想。更一般地,我们计算了一类由具有特定性质的Toeplitz块构成的矩阵(“多斜矩阵”)的行列式为零的概率。我们进一步证明,若斜分拆为带状分拆,则斜Jacobi-Trudi矩阵的行列式在有限域上均匀分布。

英文摘要:

The problem of counting the $\mathbb{F}_q$-valued points of a variety has been well-studied from algebro-geometric, topological, and combinatorial perspectives. We explore a combinatorially flavored version of this problem studied by Anzis et al. (2018), which is similar to work of Kontsevich, Elkies, and Haglund. Anzis et al. considered the question: what is the probability that the determinant of a Jacobi-Trudi matrix vanishes if the variables are chosen uniformly at random from a finite field? They gave a formula for various partitions such as hooks, staircases, and rectangles. We give a formula for partitions whose parts form an arithmetic progression, verifying and generalizing one of their conjectures. More generally, we compute the probability of the determinant vanishing for a class of matrices (``multislant matrices'') made of Toeplitz blocks with certain properties. We furthermore show that the determinant of a skew Jacobi-Trudi matrix is equidistributed across the finite field if the skew partition is a ribbon.

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

↑