Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 2 of 2
Full-Text Articles in Other Mathematics
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
HMC Senior Theses
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the graph of the polytope is at most n-d. This conjecture was disproven in 2010 by Francisco Santos Leal. However, a polynomial bound in n and d on the diameter of a polytope may still exist. Finding a polynomial bound would provide a worst-case scenario runtime for the Simplex Method of Linear Programming. However working only with polytopes in higher dimensions can prove challenging, so other approaches are welcome. There are many equivalent formulations of the Hirsch Conjecture, one of which is the …
Interpolation By Polynomials With Symmetries, Daniel Alpay, Izchak Lewkowicz
Interpolation By Polynomials With Symmetries, Daniel Alpay, Izchak Lewkowicz
Mathematics, Physics, and Computer Science Faculty Articles and Research
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, J- Hermitian, Hamiltonian and others.
The procedure is comprized of three stages, illustrated through the case where on $i\R$ the interpolating polynomials are to be positive semidefinite. We first, on the expense of doubling the degree, obtain a minimal degree interpolating polynomial P(s) which on $i\R$ is Hermitian. Then we find all polynomials Ψ(s), vanishing at the interpolation points which are positive semidefinite on $i\R$. Finally, using the fact that the set of positive semidefinite …