Bounds on the Mod 2 Homology of Random 2-Dimensional Determinantal Hypertrees

IF 1 2区数学 Q1 MATHEMATICS Combinatorica Pub Date : 2025-03-14 DOI:10.1007/s00493-025-00142-6

András Mészáros

引用次数: 0

Abstract

As a first step towards a conjecture of Kahle and Newman, we prove that if $T_n$ is a random 2-dimensional determinantal hypertree on n vertices, then

$$\begin{aligned} \frac{\dim H_1(T_n,\mathbb {F}_2)}{n^2} \end{aligned}$$

converges to zero in probability. Confirming a conjecture of Linial and Peled, we also prove the analogous statement for the 1-out 2-complex. Our proof relies on the large deviation principle for the Erdős–Rényi random graph by Chatterjee and Varadhan.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

求助全文

约1分钟内获得全文去求助

来源期刊

Combinatorica 数学-数学

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： COMBINATORICA publishes research papers in English in a variety of areas of combinatorics and the theory of computing, with particular emphasis on general techniques and unifying principles. Typical but not exclusive topics covered by COMBINATORICA are - Combinatorial structures (graphs, hypergraphs, matroids, designs, permutation groups). - Combinatorial optimization. - Combinatorial aspects of geometry and number theory. - Algorithms in combinatorics and related fields. - Computational complexity theory. - Randomization and explicit construction in combinatorics and algorithms.

期刊最新文献

The Signed Varchenko Determinant for Complexes of Oriented Matroids Improved Lower Bound Towards Chen–Chvátal Conjecture Gadget Construction and Structural Convergence Bounds on the Mod 2 Homology of Random 2-Dimensional Determinantal Hypertrees Supersaturation Beyond Color-Critical Graphs