Fox's conjecture famously asserts that the absolute values of the coefficients of the Alexander polynomial of alternating links are trapezoidal. In the setting of MOY graphs, where a different notion of Alexander polynomial appears, the equivalent result to Fox's conjecture is known to hold. In this paper, we relate the two polynomials in the case of special alternating links. More precisely, we show that their degrees, first, and last coefficient agree, and that the MOY polynomial coefficients always dominate the classical Alexander polynomial.
We define an invariant of alternating links---a homogeneous, four-variable Laurent polynomial---that encodes the symmetrized Alexander polynomial, the signature, and other topological data. Along the way, we extend a spanning tree formulation of the Alexander polynomial due to Murasugi and Stoimenow from special altern...
Fox's conjecture predicts that the absolute values of the coefficients of the Alexander polynomial of an alternating link form a trapezoidal sequence. K\'alm\'an, M\'esz\'aros, and Postnikov gave a new proof of trapezoidality for special alternating links using a polynomial associated with flat vector arrangements. We...
We establish Chudnovsky's Conjecture and, more generally, Demailly's Conjecture for any finite set of points in $\mathbb{P}^n_k$, where $k$ is an algebraically closed field of characteristic 0. The key idea of passing to positive characteristic, as well as the broad plan of the proof, was suggested by ChatGPT-5.6 Sol....
We prove stronger forms of two conjectures of Berkovich and Dhar concerning a coefficientwise inequality and pairs of hooks of length two in bounded partitions. The coefficientwise inequality implies the corresponding inequality for hook pairs. In particular, for each fixed size and common bound on the largest part, th...
Albertson's conjecture states that every graph of chromatic number r has crossing number at least that of the complete graph K_r. We prove the conjecture for all r. The proof combines new clique-sensitive edge bounds for critical graphs, maximum-clique sampling, and a reserved immersion construction. For graphs of orde...
We prove that the colored Jones polynomial of a knot does not determine the Links--Gould polynomial (associated with the 4-dimensional representation of the Lie superalgebra $\mathfrak{sl}(2|1)$) with two different approaches: the first is to find a concrete genus 2 mutation pair with different Links--Gould polynomials...
