Search arXivSearch

arXiv · 2509.16420

The discrete Laplace asymptotic method and its application to the 3XOR satisfiability problem

Abstract

A standard way to calculate the asymptotic behavior of integrals of the form \int_Wg(x)e^{-nh(x)}dx is the (continuous) Laplace asymptotic method. However, also discrete sums like \sum_{x\in W\capΛ_n}g_n(x)e^{-nh_n(x)} have similar behavior, when Λ_n is a discrete grid which becomes infinitely fine, and the functions g_n and h_n converge to g and h respectively. We go even further, and also derive the asymptotic formula for sums of the form \sum_{x\in W\capΛ_n}S_n(x), where the summand S_n asymptotically behaves as g_ne^{-nh_n}. The motivation, and also an immediate application, will be filling in all details in the classical breakthrough paper of Dubois and Mandler from 2002, which gives the solvability (phase transition) threshold of the 3XOR-SAT problem using the second moment method. Various analytical arguments there were lightly described, but the appendix of this paper combines recent results to fill all of them in. We would expect our theorems on asymptotics to apply to other (especially combinatorial) problems as well. For example, they seem effective on 3XOR-GAME problems.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jared A. Hughes, J. William Helton, Peter Schlosser. 2025-09-19. The discrete Laplace asymptotic method and its application to the 3XOR satisfiability problem. https://arxiv.org/abs/2509.16420

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO