Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Intrinsic knotting (2)
- Intrinsic linking (2)
- Algebraic geometry (1)
- Arbitrary 3-manifolds (1)
- Authomorphism rigidity of graphs (1)
-
- Borsuk-Ulam theorem (1)
- Borsuk–Ulam theorem (1)
- Calabi–Yau threefolds (1)
- Complete graph (1)
- Embedded graphs (1)
- Fair division (1)
- Fan's lemma (1)
- Graphs (1)
- Gromov–Witten invariants (1)
- K-colorability (1)
- Lusternik–Schnirelman–Borsuk theorem (1)
- Nonnegativity (1)
- Polyhedral groups (1)
- Polynomial method (1)
- Sum of squares (1)
- Topological symmetry groups (1)
- Topological vertex (1)
- Triangulations (1)
- Tucker's lemma (1)
- Tucker’s lemma (1)
- Unique Hamiltonicity (1)
Articles 1 - 10 of 10
Full-Text Articles in Algebraic Geometry
Applications Of Convex And Algebraic Geometry To Graphs And Polytopes, Mohamed Omar
Applications Of Convex And Algebraic Geometry To Graphs And Polytopes, Mohamed Omar
All HMC Faculty Publications and Research
No abstract provided.
Strong Nonnegativity And Sums Of Squares On Real Varieties, Mohamed Omar, Brian Osserman
Strong Nonnegativity And Sums Of Squares On Real Varieties, Mohamed Omar, Brian Osserman
All HMC Faculty Publications and Research
Motivated by scheme theory, we introduce strong nonnegativity on real varieties, which has the property that a sum of squares is strongly nonnegative. We show that this algebraic property is equivalent to nonnegativity for nonsingular real varieties. Moreover, for singular varieties, we reprove and generalize obstructions of Gouveia and Netzer to the convergence of the theta body hierarchy of convex bodies approximating the convex hull of a real variety.
Complete Graphs Whose Topological Symmetry Groups Are Polyhedral, Erica Flapan, Blake Mellor, Ramin Naimi
Complete Graphs Whose Topological Symmetry Groups Are Polyhedral, Erica Flapan, Blake Mellor, Ramin Naimi
Pomona Faculty Publications and Research
We determine for which m the complete graph Km has an embedding in S3 whose topological symmetry group is isomorphic to one of the polyhedral groupsA4, A5 or S4.
Recognizing Graph Theoretic Properties With Polynomial Ideals, Jesus A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar
Recognizing Graph Theoretic Properties With Polynomial Ideals, Jesus A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar
All HMC Faculty Publications and Research
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Gröbner bases, toric algebra, convex programming, and real algebraic geometry.
The Local Gromov–Witten Invariants Of Configurations Of Rational Curves, Dagan Karp, Chiu-Chu Melissa Liu, Marcos Mariño
The Local Gromov–Witten Invariants Of Configurations Of Rational Curves, Dagan Karp, Chiu-Chu Melissa Liu, Marcos Mariño
All HMC Faculty Publications and Research
We compute the local Gromov–Witten invariants of certain configurations of rational curves in a Calabi–Yau threefold. These configurations are connected subcurves of the “minimal trivalent configuration”, which is a particular tree of ℙ1’s with specified formal neighborhood. We show that these local invariants are equal to certain global or ordinary Gromov–Witten invariants of a blowup of ℙ3 at points, and we compute these ordinary invariants using the geometry of the Cremona transform. We also realize the configurations in question as formal toric schemes and compute their formal Gromov–Witten invariants using the mathematical and physical theories of the …
Intrinsic Linking And Knotting Of Graphs In Arbitrary 3–Manifolds, Erica Flapan, Hugh Howards, Don Lawrence, Blake Mellor
Intrinsic Linking And Knotting Of Graphs In Arbitrary 3–Manifolds, Erica Flapan, Hugh Howards, Don Lawrence, Blake Mellor
Pomona Faculty Publications and Research
We prove that a graph is intrinsically linked in an arbitrary 3–manifold M if and only if it is intrinsically linked in S3. Also, assuming the Poincaré Conjecture, we prove that a graph is intrinsically knotted in M if and only if it is intrinsically knotted in S3.
A Constructive Proof Of Ky Fan's Generalization Of Tucker's Lemma, Timothy Prescott '02, Francis E. Su
A Constructive Proof Of Ky Fan's Generalization Of Tucker's Lemma, Timothy Prescott '02, Francis E. Su
All HMC Faculty Publications and Research
We present a proof of Ky Fan's combinatorial lemma on labellings of triangulated spheres that differs from earlier proofs in that it is constructive. We slightly generalize the hypotheses of Fan's lemma to allow for triangulations of Sn that contain a flag of hemispheres. As a consequence, we can obtain a constructive proof of Tucker's lemma that holds for a more general class of triangulations than the usual version.
The Closed Topological Vertex Via The Cremona Transform, Jim Bryan, Dagan Karp
The Closed Topological Vertex Via The Cremona Transform, Jim Bryan, Dagan Karp
All HMC Faculty Publications and Research
We compute the local Gromov-Witten invariants of the "closed vertex", that is, a configuration of three rational curves meeting in a single triple point in a Calabi-Yau threefold. The method is to express the local invariants of the vertex in terms of ordinary Gromov-Witten invariants of a certain blowup of CP^3 and then to compute those invariants via the geometry of the Cremona transformation.
Consensus-Halving Via Theorems Of Borsuk-Ulam And Tucker, Forrest W. Simmons, Francis E. Su
Consensus-Halving Via Theorems Of Borsuk-Ulam And Tucker, Forrest W. Simmons, Francis E. Su
All HMC Faculty Publications and Research
In this paper we show how theorems of Borsuk-Ulam and Tucker can be used to construct a consensus-halving: a division of an object into two portions so that each of n people believes the portions are equal. Moreover, the division takes at most n cuts, which is best possible. This extends prior work using methods from combinatorial topology to solve fair division problems. Several applications of consensus-halving are discussed.
Intrinsic Knotting And Linking Of Complete Graphs, Erica Flapan
Intrinsic Knotting And Linking Of Complete Graphs, Erica Flapan
Pomona Faculty Publications and Research
We show that for every m∈N, there exists an n∈N such that every embedding of the complete graph Kn in R3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r∈N such that every embedding of Kr in R3 contains a knot Q with |a2(Q)| ≥ m, where a2(Q) denotes the second coefficient of the Conway polynomial of Q.