Reconstruction of hypermatrices from subhypermatrices
From MaRDI portal
Publication:6637145
DOI10.1016/j.jcta.2024.105966MaRDI QIDQ6637145
Publication date: 13 November 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Other combinatorial number theory (11B75)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reconstruction of sequences
- On a reconstruction problem for sequences
- Reconstructing sequences
- Reconstruction from subsequences.
- On the primitive circle problem
- An improvement of a Borwein-Erdélyi-Kós result
- Subpolynomial trace reconstruction for random strings and arbitrary deletion probability
- New lower bounds for trace reconstruction
- The two-dimensional Prouhet-Tarry-Escott problem
- The difference between consecutive primes. II
- Trace Reconstruction Revisited
- Reconstruction of matrices from submatrices
- On the Littlewood Problem Modulo a Prime
- Littlewood-type problems on subarcs of the unit circle
- Littlewood-Type Problems on [0,1]
- Efficient reconstruction of sequences
- The Prouhet-Tarry-Escott problem for Gaussian integers
- Trace reconstruction with exp(O(n 1/3 )) samples
- Ulam's Conjecture and Graph Reconstructions
- Efficient reconstruction of sequences from their subsequences of supersequences
- Separating words and trace reconstruction
This page was built for publication: Reconstruction of hypermatrices from subhypermatrices