default search action
Mateusz Michalek
Person information
- affiliation: University of Konstanz, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Petteri Kaski, Mateusz Michalek:
A universal sequence of tensors for the asymptotic rank conjecture. CoRR abs/2404.06427 (2024) - [i10]Cosimo Flavi, Joachim Jelisiejew, Mateusz Michalek:
Symmetric powers: structure, smoothability, and applications. CoRR abs/2408.02754 (2024) - 2023
- [j19]Adam Czaplinski
, Mateusz Michalek
Uniform matrix product states from an algebraic geometer's point of view. Adv. Appl. Math. 142: 102417 (2023) - 2022
- [j18]Alessio D'Alì
Many Faces of Symmetric Edge Polytopes. Electron. J. Comb. 29(3) (2022) - [j17]Michal Lason
A Note on Seminormality of Cut Polytopes. SIAM J. Discret. Math. 36(1): 114-117 (2022) - 2021
- [j16]Mateusz Michalek
Maximum Likelihood Degree, Complete Quadrics, and ℂ*-Action. SIAM J. Appl. Algebra Geom. 5(1): 60-85 (2021) - [j15]Matthias Christandl
Border Rank Nonadditivity for Higher Order Tensors. SIAM J. Matrix Anal. Appl. 42(2): 503-527 (2021) - [i9]Roser Homs, Joachim Jelisiejew, Mateusz Michalek, Tim Seynnaeve
Bounds on complexity of matrix multiplication away from CW tensors. CoRR abs/2103.12598 (2021) - [i8]Paul Breiding, Fulvio Gesmundo, Mateusz Michalek, Nick Vannieuwenhoven:
Algebraic compressed sensing. CoRR abs/2108.13208 (2021) - 2020
- [j14]Laura Colmenarejo
Toric geometry of path signature varieties. Adv. Appl. Math. 121: 102102 (2020) - [i7]Matthias Christandl, Fulvio Gesmundo, Mateusz Michalek, Jeroen Zuiddam:
Border rank non-additivity for higher order tensors. CoRR abs/2007.05458 (2020)
2010 – 2019
- 2019
- [j13]Corey Harris, Mateusz Michalek
Computing images of polynomial maps. Adv. Comput. Math. 45(5): 2845-2865 (2019) - [j12]Lukas Katthän, Mateusz Michalek
When is a Polynomial Ideal Binomial After an Ambient Automorphism? Found. Comput. Math. 19(6): 1363-1385 (2019) - [j11]Mateusz Michalek, Tim Seynnaeve
A Tensor Version of the Quantum Wielandt Theorem. SIAM J. Matrix Anal. Appl. 40(3): 1125-1130 (2019) - [j10]Mateusz Michalek
Quantum Version of Wielandt's Inequality Revisited. IEEE Trans. Inf. Theory 65(8): 5239-5242 (2019) - [i6]Lek-Heng Lim, Mateusz Michalek, Yang Qi:
Best k-layer neural network approximations. CoRR abs/1907.01507 (2019) - [i5]J. M. Landsberg, Mateusz Michalek:
Towards finding hay in a haystack: explicit tensors of border rank greater than 2.02m in Cm ⊗ Cm ⊗ Cm. CoRR abs/1912.11927 (2019) - 2018
- [j9]Thomas Kahle
Obstructions to Combinatorial Formulas for Plethysm. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j8]Mateusz Michalek
Finite phylogenetic complexity of Zp and invariants for Z3. Eur. J. Comb. 59: 169-186 (2017) - [j7]Michal Lason
Non-Normal Very Ample Polytopes - Constructions and Examples. Exp. Math. 26(2): 130-137 (2017) - [j6]J. M. Landsberg, Mateusz Michalek
On the Geometry of Border Rank Decompositions for Matrix Multiplication and Other Tensors with Symmetry. SIAM J. Appl. Algebra Geom. 1(1): 2-19 (2017) - [i4]Lukas Katthän, Mateusz Michalek, Ezra Miller:
When is a polynomial ideal binomial after an ambient automorphism? CoRR abs/1706.03629 (2017) - 2016
- [j5]Winfried Bruns, Joseph Gubeladze, Mateusz Michalek
Quantum Jumps of Normal Polytopes. Discret. Comput. Geom. 56(1): 181-215 (2016) - [j4]Thomas Kahle
Plethysm and Lattice Point Counting. Found. Comput. Math. 16(5): 1241-1261 (2016) - [j3]Mateusz Michalek
Smooth monomial Togliatti systems of cubics. J. Comb. Theory A 143: 66-87 (2016) - [i3]J. M. Landsberg, Mateusz Michalek:
On the geometry of border rank algorithms for matrix multiplication and other tensors with symmetry. CoRR abs/1601.08229 (2016) - [i2]J. M. Landsberg, Mateusz Michalek:
A $2n^2-log(n)-1$ lower bound for the border rank of matrix multiplication. CoRR abs/1608.07486 (2016) - 2015
- [i1]J. M. Landsberg, Mateusz Michalek:
Abelian Tensors. CoRR abs/1504.03732 (2015) - 2013
- [j2]Mateusz Michalek
Constructive degree bounds for group-based models. J. Comb. Theory A 120(7): 1672-1694 (2013) - 2010
- [j1]Mateusz Michalek
A Short Proof of Combinatorial Nullstellensatz. Am. Math. Mon. 117(9): 821-823 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-30 00:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: