Research paperCorrectedARR-2026-5XEX8EX0629R997Y · v2 · 2026-08-25

Euler-Reduced Tjurina Floors for Osculating-Absorbing Gauss Fibres

Lluis Eriksson

Abstract

Let h in C[[x_1,...,x_d]] have order at least s+1 and finite Tjurina algebra. Euler cancellation replaces h, without changing its Tjurina ideal, by a generator of order at least s+2. A finite-jet generator count then gives tau(h) at least E_{d,s}, the maximum over K of binom(d+K,d)-d binom(d+K-s,d)-binom(d+K-s-2,d). For plane germs this is the exact universal floor floor((3s^2+4s-3)/4), attained by classical ordinary multiple-point families. Applied to a point-span s-osculating-absorbing reduced fibre of the Gauss map in the complete O_X(m) embedding, the result gives length(Gamma_eta) at least E_{d,s} binom(d+m,d). For surfaces, a prescribed-jet construction realizes equality at an explicit sufficient degree. The work is over C; the higher-dimensional floor need not be sharp, the degree threshold is not claimed minimal, and no exhaustive priority, human peer-review, or formal-verification claim is made.

Deposit recordedFirst repository commit · full Git SHA recorded
PublishedGitHub release · tag ARR-2026-5XEX8EX0629R997Y-v2
Canonical PDF downloads3GitHub release downloads only; direct ARR PDF reads are not measured
Page viewsNot measuredPage views are not measured until ARR connects a privacy-reviewed, no-cookie analytics source.
Definitions and rankings →
Not yet rated

Verification record

Frontier-model screening
Not assessed
Source integrity
Pass
Bibliographic integrity
Partial
Reproducibility
Partial
Lean 4
Not applicable

Recorded under ARR-VERIFY-1.0. ARR verification and screening are not peer review.

Revision statement

Minor revision. Corrects the canonical source hash after Git line-ending normalization and records the preserved LF byte stream; mathematical content is unchanged.

Version history

The ARR identifier remains stable. Each version has its own immutable release, timestamp and version identifier.

  • v2 · minor revision · source snapshot available · viewing
  • v1 · source snapshot available

AI assistance statement

OpenAI Codex assisted with theorem exploration, proof development, adversarial repair, primary-literature and public-corpus triage, exact replay code, drafting, LaTeX production, visual QA, packaging, and deposit preparation. Separate Codex referee tasks audited exact source snapshots. These AI checks are not human peer review, formal verification, independent reproduction, or priority certification; the author remains responsible for every claim.

Frontier-model screening

Status: not_assessed. Any listed reports correspond to this exact version under ARR-SCREEN-1.0; no absent assessment is represented as a pass.

    Longitudinal frontier-model record

    Independent model assessments

    Read the scale and limits
    Not yet rated

    No eligible independent ARR-ASSESS-1.0 report is published for this exact version. Missing evidence is not scored as zero.

    No model reports are published for this version.

    A model assessment is not peer review or a correctness certificate. ARR preserves disagreement, exact-version provenance and later reassessments.

    Editorial disclosure

    Version v2 supersedes v1. Declared minor revision: Corrects the canonical source hash after Git line-ending normalization and records the preserved LF byte stream; mathematical content is unchanged. All assessments apply only when explicitly rerun and recorded for this exact version.