{
  "schema_version": 1,
  "problem_number": "OWR-15428-014",
  "title": "Partial Results on the Degree of the Algebraic Boundary in Rank-One Tensor Completion",
  "author": {
    "name": "Alper Ferudun",
    "affiliation": "Mercury Software GmbH",
    "url": "https://github.com/AlperTheKing"
  },
  "abstract": "Kahle, Kubjas, Kummer and Rosen showed that for a set E of observed entries of a d_1 × ⋯ × d_n tensor with |E| = Σ_j (d_j − 1) that meets every maximal slice and has a full-dimensional completable region (we call such E admissible), the algebraic boundary of the set of partial tensors that are restrictions of joint distributions of independent random variables consists of coordinate hyperplanes and one irreducible hypersurface H. They asked for deg H as a function of n, d_1, …, d_n and E. We give a partial answer. For the corner patterns, the cells that differ from a fixed cell in exactly one coordinate, H is defined by an explicit irreducible discriminant and deg H = n(n − 1) in every format. In general deg H ≤ m!/∏_j (d_j − 1)! with m = |E|, with equality for some patterns. We call E saturated if the maximal minors of its incidence matrix are coprime; this is weaker than unimodularity of that matrix. If E is saturated, the complex completions of a generic partial tensor are the W roots of one Laurent polynomial equation Φ_x(τ) = 1, and we prove q·deg H = W* + deg Den, where W* ≤ W counts the critical values of Φ_x that are not identically zero, q ≥ 1, and Den is a constant multiple of the q-th power of the lowest-degree form of the equation of H. For W = 2 this gives an explicit formula; for matrices deg H = 2 + 2p, where p is the number of observed entries that share their row and their column with other observed entries. For saturated patterns in binary formats we obtain deg H ≤ W + Σ_e μ_e with explicit tropical multiplicities. With exact computer certificates this determines deg H for all admissible patterns in the six formats 2 × 2, 3 × 3, 3 × 4, 2 × 2 × 2, 2 × 2 × 3 and 2 × 2 × 2 × 2. In a modular census of 2343 patterns, which is not a proof, all saturated patterns have q = 1 and W* = W, and the tropical bound is sharp; we do not prove this in general. For patterns that are not saturated we have only the general bound and one certified example. This is an unrefereed note.",
  "result_type": "COMPLETE_SCOPED_PROOF",
  "categories": [
    "math.AG",
    "math.ST",
    "math.CO"
  ],
  "keywords": [
    "rank-one tensor completion",
    "independence model",
    "completable region",
    "algebraic boundary",
    "degree of a hypersurface",
    "discriminant",
    "Newton polygon",
    "Oberwolfach Reports",
    "OWR-15428-014",
    "math.AG",
    "math.ST",
    "math.CO",
    "open mathematics"
  ],
  "manuscript_version_date": "2026-09-30",
  "publication_date": "2026-09-30",
  "publication_date_kind": "first public online release",
  "version": "1.0",
  "date_modified": "2026-09-30",
  "presentation_revision_only": false,
  "doi_archived_file_version": "1.0",
  "status": "unrefereed preprint",
  "canonical_url": "https://eulersolve.org/papers/owr-15428-014/",
  "pdf_url": "https://eulersolve.org/papers/owr-15428-014/paper.pdf?v=c1c0e258c8c7",
  "doi": "10.5281/zenodo.23049796",
  "zenodo_record_url": "https://zenodo.org/records/23049796",
  "license": "https://creativecommons.org/licenses/by/4.0/",
  "scope_caveat": "Partial answer to the degree question of Kahle–Kubjas–Kummer–Rosen (OWR 20/2017, Problem 3.15): the degree of the boundary hypersurface is determined for corner patterns in every format, for all admissible matrix patterns, for saturated patterns with two complex completions, and for all admissible patterns in six small formats (the last by exact computer certificates); a general upper bound is proved. A general formula remains open; the conjectured tropical formula rests only on a modular census. Several ingredients are due to Kubjas–Rosen and Cai–Recke–Yahl. Unrefereed.",
  "files": {
    "paper.pdf": {
      "sha256": "c1c0e258c8c77910a430e47502a775dbfaabc876d64fc4b79e8fcb411f67c083"
    },
    "source.zip": {
      "sha256": "32fb5060479603f2202b5a7316d28fac973ceb1457b76b27c03607575ffea700"
    },
    "verification_report.md": {
      "sha256": "551cf59086658cd7da30174f3a95bc885323ce3fc1fee8934e87aa5252715964"
    }
  },
  "ai_use_disclosure": "AI-assisted tools supported research, computation, proof development, and manuscript preparation. The author remains responsible for all claims and the final text."
}