Search arXivSearch

arXiv · 2607.18948

Border Bases and Border Basis Schemes

Abstract

This survey invites the readers on a journey spanning more than twenty years of research through the landscape of border basis schemes. During most of this period, I had the pleasure of working with Martin Kreuzer, and more recently with Le Ngoc Long. Along this journey, one encounters border bases, which are characterized by the remarkable property that their associated multiplication matrices commute pairwise. This property, in turn, provides a natural foundation for defining border basis schemes (BBS). These are beautiful schemes, elegantly defined by simple quadratic equations. However, the number of indeterminates in their coordinate rings can be huge. This necessitates a suitable re-embedding into a polynomial ring with fewer indeterminates. This task is accomplished in a more general setting, and the reward is reaped in the BBS scenario, where the notions of cotangent equivalence and exposed indeterminates play a fundamental role, for instance, in showing that planar Box BBS are affine cells. The center stage is taken by positive $P_0$-algebras and the unimodular matrix problem, which allows us to prove that regular algebras of this kind are free. Finally, we turn our attention to special BBS and interesting subschemes of BBS. Are there no more open problems? Fortunately, many remain, and a selection of these challenges marks not a final destination, but a new horizon, suggesting that this journey may continue in the near future. on the border of the soul bases of unseen photographs, schemes of ancient thoughts, slowly return into poems and theorems L. Robbiano, 2026}

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lorenzo Robbiano. 2026-09-15. Border Bases and Border Basis Schemes. https://arxiv.org/abs/2607.18948

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

KEEP EXPLORING

Related papers

On triviality of $\mathbb{A}^2$-forms admitting a nontrivial $\mathbb{G}_a$-action

T. Kambayashi had shown that $\mathbb{A}^2$-forms over separable field extensions are necessarily polynomial rings. However, there exist inseparable $\mathbb{A}^2$-forms which are not necessarily polynomial rings. In this paper, we give a structure theorem for $\mathbb{A}^2$-forms over arbitrary field extensions admitting a nontrivial $\mathbb{G}_a$-action. From this structure theorem we derive some conditions under which an $\mathbb{A}^2$-form becomes trivial. In particular, we prove that over a field $k$, a factorial $\mathbb{A}^2$-form having a $k$-rational point and a non-trivial $\mathbb{G}_a$-action is trivial and we also give examples demonstrating that none of these hypotheses can be discarded. As a consequence of the structure theorem, we obtain a generalization of the Zariski Cancellation Theorem for the affine plane over an arbitrary field.

math.AC

Symbolic powers of the ideal of$n$ general points in $P^{n-1}$

Problem L of Fröberg--Lundqvist--Oneto--Shapiro asks for the difference between the Hilbert series of ordinary and symbolic powers of the ideal of general points in projective space. We solve this completely for \(n\) general points of \(\PP^{n-1}\). Besides a closed formula for \[ \HS(S/I^m)-\HS(S/I^{(m)}), \] we determine all minimal monomial generators of \(I^{(m)}\), and describe the symbolic Rees algebra. We also show that containment \(I^{(m)}\subseteq I^r\) is detected solely by initial degrees. This gives the exact containment threshold, the Waldschmidt constant \(\walpha\), the resurgence \(\Res\), and the asymptotic resurgence \(\aRes\): \[ \walpha(I)=\frac{n}{n-1}, \qquad \Res(I)=\aRes(I)=\frac{2(n-1)}{n}. \] We also take the first step beyond \(n\) points: for \(n+1\) general points of \(\PP^{n-1}\) --- again a rigid, non-monomial configuration --- we identify the defining quadrics, resolve the case \(n=3\) completely (a complete intersection, with \(J^{(m)}=J^m\) for all \(m\) and resurgence \(1\)), and propose an exact Waldschmidt-constant formula \(\walpha=\frac{n+1}{n-1}\) for all \(n\), verified computationally in every case we could check.

math.AC