Matching works

3 works

math.AG — Algebraic Geometry

The four-dimensional Hessian conjecture for quintic potentials with a ternary cone top

Contributed by David Niedbala Giraudin

The Hessian conjecture HCn\mathrm{HC}_n asserts that if f∈C[x1,…,xn]f\in\mathbb{C}[x_1,\dots,x_n] has det⁡Hess⁡(f)∈C×\det\operatorname{Hess}(f)\in\mathbb{C}^\times, then ∇f\nabla f is a polynomial automorphism. It is known for n≤3n\le 3, false for n≥5n\ge 5, and open for n=4n=4, where it implies the plane Jacobian conjecture. Z. Ni proved HC4\mathrm{HC}_4 for potentials of degree at most four. We prove HC4\mathrm{HC}_4 for every potential of degree five whose top homogeneous form depends on exactly three linear forms. The proof combines a weighted analysis of the Hessian determinant with exact computer-algebra certificates (Groebner bases and Rabinowitsch tests over Q\mathbb{Q}); one branch reduces to plane Jacobian pairs of degrees (4,3)(4,3), which are excluded by Magnus' theorem. A self-contained verifier is supplied as an ancillary file. The binary and unary cone tops in degree five remain open.

Author comments: 5 pages. Ancillary file anc/verify_hc4_ternary.py: 29 exact checks (python-flint, sympy, Singular via Sage), about 3 minutes. Extends arXiv:2608.14217 to degree five for ternary cone tops. Computations and writing assisted by Claude (Anthropic).

Primarily AI-generated textHuman understanding: no partsGroebner basesHessian conjectureJacobian conjecturecomputer-assisted proofpolynomial automorphisms
Nov 06, 20265 pages
PDFView work

math.NT — Number Theory

Integrality of iterated averages and pointwise prime powers

Contributed by Darij Grinberg

Suppose that we repeatedly replace the values of an integer-valued function on Z\Z by averages over pp consecutive arguments, where pp is prime. If the first ℓ\ell rounds of averaging give integers, will this remain true when we begin with the ppth powers of the original values? We prove that the answer is yes for ℓ≤p\ell\le p. For p=2p=2 and p=3p=3, the answer is yes for every ℓ\ell, and therefore also when integrality is required at every stage. For larger primes, a known counterexample first fails at round p+1p+1. The proofs use finite differences and polynomial interpolation. We also explain connections with earlier work on divisibility of finite differences and Stirling numbers.

A mix of human-written and AI-generated textHuman understanding: some partsInteger SequencesInteger-valued polynomialsdivisibilityfinite differencessupercongruences
Oct 29, 202629 pages
PDFView work

math.AC — Commutative Algebra

Splitting a Polynomial into Linear Factors after an Injective Ring Extension

Contributed by Darij Grinberg

We show that each univariate polynomial P=p0+p1X+⋯+pmXm∈R[X]P = p_0 + p_1 X + \cdots + p_m X^m \in R[X] over a commutative ring RR can be factored into linear factors over a suitable commutative ring extension SS of RR. The proof proceeds by universal construction: SS is defined as the tensor product R⊗CmBmR \otimes_{C_m} B_m, where BmB_m is the polynomial ring $\ZZ[a_1, b_1, a_2, b_2, \ldots, a_m, b_m]$, and where CmC_m is its subring generated by its ``homogenized elementary symmetric polynomials'' Er=∑I⊆[m];∣I∣=r∏i∈Iai∏i∉IbiE_r=\sum_{\substack{I\subseteq [m];\\ |I|=r}} \prod_{i\in I}a_i\prod_{i\notin I}b_i for all 0≤r≤m0 \leq r \leq m. The injectivity of the structure homomorphism R→SR \to S is deduced from a combinatorial study of the diagonal subring of BmB_m. In the process, a homogeneous variant of the Garsia--Stanton basis is constructed, and some classical properties of symmetric polynomials are recovered.

A mix of human-written and AI-generated textHuman understanding: all parts
Sep 28, 202629 pages
PDFView work

Advanced search

Text
Human understanding
Linked formalizations