Finite sets of $d$-planes in affine space
Mathias Lederer

TL;DR
This paper explores the combinatorial structure of the set of exponents of standard monomials for subvarieties of affine space composed of linear or affine subspaces, linking it directly to the geometry of the variety.
Contribution
It generalizes the classical finiteness algorithm from points to higher-dimensional affine subspaces, establishing a correspondence between $d$-planes in the exponent set and components of the variety.
Findings
Number of $d$-planes in $D(A)$ equals the number of components of $A
Determines the count of all $d$-planes parallel to a given subspace
Describes $D(A)$ via standard sets of intersections with hyperplanes
Abstract
Let be a subvariety of affine space whose irreducible components are -dimensional linear or affine subspaces of . Denote by the set of exponents of standard monomials of . We show that the combinatorial object reflects the geometry of in a very direct way. More precisely, we define a -plane in as being a set , where #J=d and for all . We call the -plane thus defined to be parallel to . We show that the number of -planes in equals the number of components of . This generalises a classical result, the finiteness algorithm, which holds in the case . In addition to that, we determine the number of all -planes in parallel to , for all .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Advanced Numerical Analysis Techniques · graph theory and CDMA systems
