Advanced search
Publication Cover
Experimental Mathematics Volume 29, 2020 - Issue 4
Submit an article Journal homepage
145
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Honey from the Hives: A Theoretical and Computational Exploration of Combinatorial Hives

John LombardUniversity of Washington, Seattle, WA98195, USACorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0003-1516-9362
ORCID Icon
Pages 361-382 | Published online: 18 Jun 2018

References

  • [Appleby and Whitehead 14] G. Appleby and T. Whitehead. “Honeycombs from Hermitian Matrix Pairs.” Disc. Math. Theor. Comp. Sci. (2014), 899–910. https://hal.inria.fr/hal-01207559.
  • [Benham 12] T. J. Benham. (2012). Uniform distribution over a convex polytope. School of Mathematics and Physics, University of Queensland. Matlab.
  • [Boumal et al. 14] N. Boumal, B. Mishra, P.-A. Absil, and R. Sepulchre. “Manopt, a Matlab toolbox for Optimization on Manifolds.” J, Machine Learn. Res. 15 (2014), 1455–1459.
  • [Buch 99] A. Buch. (1999). Littlewood–Richardson calculator.
  • [Cousins and Vempala 16] B. Cousins and S. Vempala. “A Practical Volume Algorithm.” Math, Program. Comput. 8(2) (2016), 133–160.
  • [Danilov and Koshevoy 03] V. I. Danilov and G. A. Koshevoy. “Discrete Convexity and Hermitian Matrices.” Procce, Steklov Instit. Math. 241 (2003), 58–78.
  • [Emiris and Fisikopoulos 14] I. Emiris and V. Fisikopoulos. (2014). Efficient random-walk method sfor approximating polytope volume. In Proceedings of the 30th Annual Symposium on Computational Geometry, p. 318. ACM.
  • [Ge et al. 14] C. Ge, F. Ma, and J. Zhang. (2014). A fast and practical method to estimate volumes of convex polytopes. CoRR, abs/1401.0120.
  • [Knutson and Tao 99] A. Knutson and T. Tao. “The Honeycomb Model of gln(C) Tensor Products i: Proof of the Saturation Conjecture.” J. Amer. Math. Soc. 12 (1999), 1055–1090.
  • [Littlewood and Richardson 34] D. E. Littlewood and A. R. Richardson. “Group Characters and Algebra.” Philos. Trans. Roy. Soci. Lond. 233 (1934), 99–141.
  • [Lovasz and Vempala 06] L. Lovasz and S. Vempala. “Simulated Annealing in Convex Bodies and an O*(n4) Volume Algorithm.” J. Comput. Syst. Sci 72(2) (2006), 392–417.
  • [Narayanan 06] H. Narayanan. “On the Complexity of Computing kostka Numbers and Littlewood–Richardson Coefficients.” J, Algeb. Combin, 24(3) (2006).
  • [Narayanan 14] H. Narayanan. “Estimating Certain Non-zero Littlewood-Richardson Coefficients.” Form. Power Ser. Algeb. Combin. (2014), 321–332. https://hal.inria.fr/hal-01207613.
  • [Nishimori et al. 06] Y. Nishimori, S. Akaho, and M. D. Plumbley. Riemannian Optimization Method on the Flag Manifold for Independent Subspace Analysis, pp. 295–302. Berlin, Heidelberg: Springer, 2006.
  • [Rassart 04] E. Rassart. “A Polynomiality Property for Littlewood–Richardson Coefficients.” J. Combin. Theo. A 107(2) (2004), 161–179.
  • [van Leeuwen 01] M. A. A. van Leeuwen. (2001). The Littlewood–Richardson rule, and related combinatorics, volume 11 of MSJ Memoirs, pp. 95–145. Mathematical Society of Japan.
  • [Wigner 55] E. Wigner. “Characteristic Vectors of Bordered Matrices with Infinite Dimensions.” Ann. Math. 62 (1955), 548–564.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.