Cover Image

Computing moment polytopes -- with a focus on tensors, entanglement and matrix multiplication

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Berg, Maxim van den, Christandl, Matthias, Lysikov, Vladimir, Nieuwboer, Harold, Walter, Michael, Zuiddam, Jeroen
Format:	Preprint
Published:	2025
Subjects:	Representation Theory Computational Complexity Symbolic Computation Algebraic Geometry Quantum Physics 20G05, 15A69, 14L24, 68W30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The moment polytope of matrix multiplication is not maximal
by: Berg, Maxim van den, et al.
Published: (2025)

Explicit non-free tensors
by: Berg, Maxim van den, et al.
Published: (2025)

Barriers for rectangular matrix multiplication
by: Christandl, Matthias, et al.
Published: (2020)

Asymptotic tensor rank is characterized by polynomials
by: Christandl, Matthias, et al.
Published: (2024)

Integer multiplication is at least as hard as matrix transposition
by: Harvey, David, et al.
Published: (2025)

Discreteness of asymptotic tensor ranks
by: Briët, Jop, et al.
Published: (2023)

On quantum functionals for higher-order tensors
by: Botero, Alonso, et al.
Published: (2026)

Fast interpolation and multiplication of unbalanced polynomials
by: Giorgi, Pascal, et al.
Published: (2024)

Recent Advances in Debordering Methods
by: Dutta, Pranjal, et al.
Published: (2025)

On the gradient of the coefficient of the characteristic polynomial
by: Ikenmeyer, Christian
Published: (2025)

First steps towards Computational Polynomials in Lean
by: Davenport, James Harold
Published: (2024)

Partial Degeneration of Tensors
by: Christandl, Matthias, et al.
Published: (2022)

A quasi-optimal lower bound for skew polynomial multiplication
by: Chen, Qiyuan, et al.
Published: (2024)

Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals
by: Garg, Abhibhav, et al.
Published: (2025)

Modular composition & polynomial GCD in the border of small, shallow circuits
by: Andrews, Robert, et al.
Published: (2025)

Hilbert's Nullstellensatz is in the Counting Hierarchy
by: Andrews, Robert, et al.
Published: (2026)

Constant-Depth Arithmetic Circuits for Linear Algebra Problems
by: Andrews, Robert, et al.
Published: (2024)

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases
by: Khichane, Sara, et al.
Published: (2026)

Fast polynomial computations with space constraints
by: Grenet, Bruno
Published: (2025)

Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
by: Dwivedi, Ashish, et al.
Published: (2024)

The next gap in the subrank of 3-tensors
by: Gesmundo, Fulvio, et al.
Published: (2023)

A Monadic Calculus with Episodic Flows
by: Henning, Sotirios
Published: (2024)

Relating the Computational and Logical Difficulty of Solving ODEs: From Polynomial to Discontinuous Right-Hand Sides
by: Bournez, Olivier, et al.
Published: (2026)

Complexity theory of orbit closure intersection for tensors: reductions, completeness, and graph isomorphism hardness
by: Lysikov, Vladimir, et al.
Published: (2024)

Beyond Worst-Case Analysis for Symbolic Computation: Root Isolation Algorithms
by: Ergür, Alperen A., et al.
Published: (2025)

Polynomial-Time Algorithms for Black-Box Distributive Expanded Groups
by: Anokhin, Mikhail
Published: (2025)

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings
by: Vu, Thi Xuan
Published: (2025)

A New Bound on Cofactors of Sparse Polynomials
by: Nahshon, Ido, et al.
Published: (2023)

On the complexity of Chow and Hurwitz forms
by: Doğan, Mahmut Levent, et al.
Published: (2022)

Algebraic metacomplexity and representation theory
by: Berg, Maxim van den, et al.
Published: (2024)

Quantifier Elimination Meets Treewidth
by: Wu, Hao, et al.
Published: (2026)

Identity Testing for Radical Expressions
by: Balaji, Nikhil, et al.
Published: (2022)

Border subrank of higher order tensors and algebras
by: Chang, Chia-Yu, et al.
Published: (2026)

Misfortunes of a mathematicians' trio using Computer Algebra Systems: Can we trust?
by: Durán, Antonio J., et al.
Published: (2013)

Towards Verified Polynomial Factorisation
by: Davenport, James H.
Published: (2024)

Symbolic Summation of Multivariate Rational Functions
by: Chen, Shaoshi, et al.
Published: (2022)

On Linear Representation, Complexity and Inversion of maps over finite fields
by: Anantharaman, Ramachandran, et al.
Published: (2020)

Generalised Burnside and Dixon algorithms for irreducible projective representations
by: Szabó, Attila
Published: (2025)

Decomposition of Symmetrical Classes of Central Configurations
by: Santos, Marcelo P., et al.
Published: (2025)

Runtime Repeated Recursion Unfolding in CHR: A Just-In-Time Online Program Optimization Strategy That Can Achieve Super-Linear Speedup
by: Fruehwirth, Thom
Published: (2023)