76
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Positive Plücker tree certificates for non-realizability

References

  • Alon, N. (1986). The number of polytopes, configurations and real matroids. Mathematika, 33: 62–71.
  • Adiprasito, K., Padrol, A. (2017). The universality theorem for neighborly polytopes. Combinatorica, 37: 129–136.
  • Bokowski, J., and Sturmfels, B.(1989). Computational synthetic geometry, volume 1355. Berlin: Springer-Verlag.
  • Brandt, M., and Wiebe, A. (2019). The slack realization space of a matroid. Algebr. Comb. 2(4):663–681.
  • William, J., Cook, W. H., Cunningham, W. R. P., Schrijver, A. (2009). Combinatorial optimization. New York: Wiley.
  • IBM ILOG Cplex. Cplex.
  • Criado, F., Santos, F. (2019). Topological prismatoids and small simplicial spheres of large diameter. Experimental Mathematics. 10.1080/10586458.2019.1641766.
  • Dressler, M., Iliman, S., de Wolff, T. (2017). A Positivstellensatz for sums of nonnegative circuit polynomials. SIAM J. Appl. Algebra Geom. 1(1): 536–555.
  • Dershowitz, N., Jouannaud, J-P. (1990). Rewrite systems. In Handbook of Theoretical Computer Science, Vol. B, pp. 243–320. Amsterdam: Elsevier.
  • De Loera, J. A., Malkin, P. N., Parrilo, P. A. (2012). Computation with polynomial equations and inequalities arising in combinatorial optimization. In Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17–21, 2008, pp. 447–481. New York: Springer.
  • Gawrilow, E., Joswig, M. (2000). polymake: a framework for analyzing convex polytopes. In Polytopes—combinatorics and computation (Oberwolfach, 1997), Vol. 29 of DMV Sem, pp. 43–73. Basel: Birkhäuser.
  • Gouveia, J., Macchia, A., Thomas, R. R., Wiebe, A. (2019). The slack realization space of a polytope. SIAM J. Discrete Math. 33(3): 1637–1653.
  • Gouveia, J., Macchia, A., Wiebe, A. (1986). Combining realization space models of polytopes, 2020, 2001.11999.
  • Goodman, J. E., Pollack, R. Upper bounds for configurations and polytopes in Rd. Discrete Comput. Geom., 1: 219–227.
  • Gurobi Optimization, LLC. (2021). Gurobi Optimizer Reference Manual.
  • Juhnke-Kubitzke, M., Murai, S. (2018). Balanced generalized lower bound inequality for simplicial polytopes. Sel. Math., New Ser., 24(2): 1677–1689.
  • Juhnke-Kubitzke, M., Murai, S., Novik, I., Sawaske, C. (2018). A generalized lower bound theorem for balanced manifolds. Math. Z., 289(3/4): 921–942.
  • Jockusch, W. (1995). An infinite family of nearly neighborly centrally symmetric 3-spheres. J. Comb. Theory, Ser. A, 72(2): 318–321.
  • Kalai, G. (1988). Many triangulated spheres. Discrete Comput. Geom. 3(1/2):1–14. doi:10.1007/BF02187893
  • Knuth, D. E., Bendix, P. B. (1970). Simple word problems in universal algebras. In Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), pp. 263–297. Oxford: Pergamon.
  • Matoušek, J., Gärtner, B. (2007). Understanding and using linear programming. Berlin: Springer.
  • Mnev, N. E. (1988). The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In Topology and Geometry, Rohlin Semin. 1984–1986. Lect. Notes Math. 1346, 527–543.
  • Miller, E., Sturmfels, B. (2005). Combinatorial Commutative Algebra, Vol. 227. New York: Springer.
  • Maclagan, D., Sturmfels, B. (2015). Introduction to Tropical Geometry, Volume 161. Providence, RI: American Mathematical Society (AMS).
  • Munkres, J. R. (1984). Elements of Algebraic Topology. Addison–Wesley.
  • Novik, I. (2020). personal communication.
  • Nevo, E., Santos, F., Wilson, S. (2016). Many triangulated odd-dimensional spheres. Math. Ann. 364(3/4): 737–762. doi:10.1007/s00208-015-1232-x
  • Novik, I., Zheng, H. (2020). Highly neighborly centrally symmetric spheres. Adv. Math. 370: 15. Id/No 107238. doi:10.1016/j.aim.2020.107238
  • Novik, I., Zheng, H. (2020). New families of highly neighborly centrally symmetric spheres. arXiv:2005.01155.
  • Padrol, A. (2013). Many neighborly polytopes and oriented matroids. Discrete Comput. Geom. 50(4): 865–902.
  • Pfeifle, J., Pilaud, V., Santos, F. (2012). Polytopality and Cartesian products of graphs. Isr. J. Math. 192: 121–141. doi:10.1007/s11856-012-0049-5
  • Pfeifle, J., Ziegler, G. M. (2004). Many triangulated 3-spheres. Math. Ann. 330(4): 829–837.
  • Richter-Gebert, J.¨, Ziegler, G.¨ M. (1995). Realization spaces of 4-polytopes are universal. Bull. Am. Math. Soc., New Ser. 32(4):403–412.
  • Santos, F. (2012). A counterexample to the Hirsch conjecture. Ann. Math. (2), 176(1): 383–412. doi:10.4007/annals.2012.176.1.7
  • Schrijver, A. (1998). Theory of Linear and Integer Programming. Chichester: Wiley.
  • Shemer, I. (1982). Neighborly polytopes. Isr. J. Math. 43: 291–314. doi:10.1007/BF02761235
  • Shor, P. W. (1991). Stretchability of pseudolines is NP-hard. In A dual forest algorithm for the assignment problem, pp. 531–554.
  • Stanley, R. P. (1975). The upper bound conjecture and Cohen-Macaulay rings. Stud. Appl. Math., 54: 135–142.
  • Sturmfels, B. (2002). Solving Systems of Polynomial Equations, Volume 97. Providence, RI: American Mathematical Society.
  • Venturello, L. (2019). Balanced triangulations on few vertices and an implementation of cross-flips. Electron. J. Comb., 26(3):research paper p3.61, 25.
  • Wiebe, A. (2020). personal communication.
  • Zheng, H. (2020). Ear decomposition and balanced neighborly simplicial manifolds. Electron. J. Comb., 27(1):research paper p1.10, 17.
  • Zheng, H. (2020). personal communication.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.