Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.23622

Engineered Complete Intersections: Algorithmic Aspects

Alexander Esterov·Rafael Mohr·Yulia Mukhina
View original source ↗Read source document ↗Export metadata ↓

Abstract

Engineered Complete Intersections (ECI's) are a class of sparse polynomial systems frequently arising in a number of contexts, both in pure mathematics (e.g. enumerative geometry) and applications (e.g. chemical reaction networks). Based on theoretical results given by the first author, we give several contributions. First we give a new effective technique to tropicalize such systems by generalizing the classical notion of mixed subdivisions introduced by Huber and Sturmfels (1995) to ECI's with the particular goal to efficiently count solutions of square systems of equations in ECI form. We further design a tropical homotopy continuation algorithm for computing such mixed subdivisions, inspired by Jensen (2016), Malajovich (2017) and Daisey and Ren (2024). Our techniques can be used to numerically solve such systems by coupling them with the algorithms introduced by Helminck, Henriksson and Ren (2024). Finally, we give an algorithm to compute Newton polytopes of eliminants of ECI's. This gives a new way to compute, for example, Newton polytopes of so-called $A$-discriminants. Coupled with evaluation-interpolation paradigms our algorithm gives an efficient approach to compute such eliminants. We implemented our algorithms in the form of a software package which we use to demonstrate their practical feasibility on a range of examples.

Explore related subjects

cs.SCmath.AG

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Esterov, Rafael Mohr, Yulia Mukhina. 2026-07-26. Engineered Complete Intersections: Algorithmic Aspects. https://arxiv.org/abs/2607.23622

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Diversity of EML-type operators

The discovery of the EML operator, sufficient to evaluate the standard explicit purely transcendental elementary functions, has led to considerable interest and discussion across multiple scientific disciplines. However, most authors have focused on the binary EML itself, while numerous similar variants with slightly different properties are now known. This article attempts to close this gap by enumerating and classifying them. We also take this opportunity to clarify common misconceptions related to the EML operator. The principal goal, symbolic regression within an architecture as close as possible to proven neural networks which combine matrix multiplication with a single univariate non-linear activation function, remains beyond reach. Instead, we propose a M\"obius layer, with rational functions replacing matrix operations, and showcase the recently discovered activation function eml(x,1/x), which allows exp(x) and ln(x) to be recovered separately, and hence all elementary functions to be evaluated within a rational generalization of the neural network.

cs.SC↗
arXiv2026

Physical Law Ecology: mapping multi-mechanism ecologies as the zeroth step of data-driven scientific discovery

Every data-driven equation discovery method assumes (implicitly and without verification) that the target system obeys a single governing law ($K{=}1$). Here we show that this assumption is the primary bottleneck limiting scientific discovery in multi-mechanism systems, and introduce Physical Law Ecology, a framework that makes $K^*$ (the number of coexisting independent mechanisms) itself the first quantity to be determined from data. The framework automatically mines a pool of topologically distinct candidate equations, constructs a continuous dominance weight field across parameter space, and discovers analytic evolution laws governing mechanism succession---with optional monotonicity constraints encoding irreversible physics. Across four unrelated systems (elastomer mechanics, pool boiling, galactic dynamics, and droplet evaporation), BIC consistently identifies $K^*{=}3$ independent governing topologies. Applied to 163 SPARC galaxies (3,269 spatially resolved measurements), the framework autonomously recovers three gravitational laws whose coexistence provides evidence against the single-universal-acceleration hypothesis of MOND ($p<10^{-34}$). In engineering applications, multi-law weighted prediction reduces error by 67-72\% over single-equation baselines while retaining full interpretability. By establishing the determination of $K^*$ as the zeroth step of scientific discovery-prior to and independent of equation search---this work opens a direction orthogonal to existing symbolic regression: not finding better equations, but mapping the ecology of mechanisms that govern complex systems.

cs.SC↗