旗流形上的一些真实与不真实的计数几何
Some real and unreal enumerative geometry for flag manifolds
AI总结:
本文提出一种构造计数几何实解的方法,给出实解数量下界,应用于旗流形证明两类问题可全实解、一类无实解,源于数值同伦延拓算法。
摘要:
我们提出了一种通用方法,用于构造计数几何中某些问题的实解,该方法给出了最大实解数量的下界。我们将此方法应用于证明旗流形上的两类新的计数几何问题可能所有解都是实的,并修改此方法以证明另一类问题可能没有实解,这是一个新现象。该方法源于一种数值同伦延拓算法,该算法适用于格拉斯曼流形上的特殊舒伯特演算,原则上为寻找这些其他计数问题的显式解提供了最优数值同伦算法。
英文摘要:
We present a general method for constructing real solutions to some problems in enumerative geometry which gives lower bounds on the maximum number of real solutions. We apply this method to show that two new classes of enumerative geometric problems on flag manifolds may have all their solutions be real and modify this method to show that another class may have no real solutions, which is a new phenomenon. This method originated in a numerical homotopy continuation algorithm adapted to the special Schubert calculus on Grassmannians and in principle gives optimal numerical homotopy algorithms for finding explicit solutions to these other enumerative problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。