12 research outputs found
A primal-dual formulation for certifiable computations in Schubert calculus
Formulating a Schubert problem as the solutions to a system of equations in
either Pl\"ucker space or in the local coordinates of a Schubert cell typically
involves more equations than variables. We present a novel primal-dual
formulation of any Schubert problem on a Grassmannian or flag manifold as a
system of bilinear equations with the same number of equations as variables.
This formulation enables numerical computations in the Schubert calculus to be
certified using algorithms based on Smale's \alpha-theory.Comment: 21 page
Reality and Computation in Schubert Calculus
The Mukhin-Tarasov-Varchenko Theorem (previously the Shapiro Conjecture) asserts that a Schubert problem has all solutions distinct and real if the Schubert varieties involved osculate a rational normal curve at real points. When conjectured, it sparked interest in real osculating Schubert calculus, and computations played a large role in developing the surrounding theory. Our purpose is to uncover generalizations of the Mukhin-Tarasov-Varchenko Theorem, proving them when possible. We also improve the state of the art of computationally solving Schubert problems, allowing us to more effectively study ill-understood phenomena in Schubert calculus.
We use supercomputers to methodically solve real osculating instances of Schubert problems. By studying over 300 million instances of over 700 Schubert problems, we amass data significant enough to reveal generalizations of the Mukhin-Tarasov- Varchenko Theorem and compelling enough to support our conjectures. Combining algebraic geometry and combinatorics, we prove some of these conjectures. To improve the efficiency of solving Schubert problems, we reformulate an instance of a Schubert problem as the solution set to a square system of equations in a higher- dimensional space.
During our investigation, we found the number of real solutions to an instance of a symmetrically defined Schubert problem is congruent modulo four to the number of complex solutions. We proved this congruence, giving a generalization of the Mukhin-Tarasov-Varchenko Theorem and a new invariant in enumerative real algebraic geometry. We also discovered a family of Schubert problems whose number of real solutions to a real osculating instance has a lower bound depending only on the number of defining flags with real osculation points.
We conclude that our method of computational investigation is effective for uncovering phenomena in enumerative real algebraic geometry. Furthermore, we point out that our square formulation for instances of Schubert problems may facilitate future experimentation by allowing one to solve instances using certifiable numerical methods in lieu of more computationally complex symbolic methods. Additionally, the methods we use for proving the congruence modulo four and for producing a
Symmetry groups, semidefinite programs, and sums of squares
We investigate the representation of symmetric polynomials as a sum of
squares. Since this task is solved using semidefinite programming tools we
explore the geometric, algebraic, and computational implications of the
presence of discrete symmetries in semidefinite programs. It is shown that
symmetry exploitation allows a significant reduction in both matrix size and
number of decision variables. This result is applied to semidefinite programs
arising from the computation of sum of squares decompositions for multivariate
polynomials. The results, reinterpreted from an invariant-theoretic viewpoint,
provide a novel representation of a class of nonnegative symmetric polynomials.
The main theorem states that an invariant sum of squares polynomial is a sum of
inner products of pairs of matrices, whose entries are invariant polynomials.
In these pairs, one of the matrices is computed based on the real irreducible
representations of the group, and the other is a sum of squares matrix. The
reduction techniques enable the numerical solution of large-scale instances,
otherwise computationally infeasible to solve.Comment: 38 pages, submitte
LIPIcs, Volume 261, ICALP 2023, Complete Volume
LIPIcs, Volume 261, ICALP 2023, Complete Volum
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications
Large space structures and systems in the space station era: A bibliography with indexes (supplement 04)
Bibliographies and abstracts are listed for 1211 reports, articles, and other documents introduced into the NASA scientific and technical information system between 1 Jul. and 30 Dec. 1991. Its purpose is to provide helpful information to the researcher, manager, and designer in technology development and mission design according to system, interactive analysis and design, structural concepts and control systems, electronics, advanced materials, assembly concepts, propulsion, and solar power satellite systems
Computer Aided Verification
This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications