惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

博客园_首页
C
Check Point Blog
B
Blog RSS Feed
G
Google Developers Blog
H
Help Net Security
博客园 - Franky
Blog — PlanetScale
Blog — PlanetScale
H
Hackread – Cybersecurity News, Data Breaches, AI and More
量子位
Recent Announcements
Recent Announcements
B
Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
D
DataBreaches.Net
小众软件
小众软件
T
The Blog of Author Tim Ferriss
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
MongoDB | Blog
MongoDB | Blog
Y
Y Combinator Blog
T
Tailwind CSS Blog
J
Java Code Geeks
MyScale Blog
MyScale Blog
雷峰网
雷峰网
有赞技术团队
有赞技术团队
博客园 - 聂微东

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
The Euler Stratification for $\mathbb{P}^1 \times \mathbb...
Serkan Hoşten, Vadym Kurylenko, Elke Neuhaus, Nikolas Rieke · 2026-03-20 · via math.CO updates on arXiv.org

We study the Euler characteristic of a hypersurface in $(\mathbb{C}^*)^2 \times (\mathbb{C}^*)^n$ defined by a polynomial whose monomial support corresponds to lattice points in $Δ_1 \times Δ_1 \times Δ_n$ as the coefficients of the defining polynomial vary. Each member of this hypersurface family corresponds to a three-way independence model from algebraic statistics, and the (signed) Euler characteristic is equal to the maximum likelihood degree (ML degree) of the model. We show in the case of $Δ_1 \times Δ_1 \times Δ_1$ this Euler characteristic depends only on the vanishing patterns of the factors of the principal $A$-determinant, but this fails for $Δ_1 \times Δ_1 \times Δ_n$ with $n \geq 2$. We prove that, for all $n\geq 1$, all positive integers up to the maximum possible ML degree can be realized as the Euler characteristic. Furthermore, we completely determine the Euler stratification for $\mathbb{P}^1 \times \mathbb{P}^1 \times \mathbb{P}^1$ and provide partial information for $\mathbb{P}^1 \times \mathbb{P}^1 \times \mathbb{P}^2$.