Identifiability of points and rigidity of hypergraphs under algebraic constraints
From MaRDI portal
Cites work
- Abstract 3-Rigidity and Bivariate C₂¹-Splines II: Combinatorial Characterization
- Algebraic compressed sensing
- Algebraic identifiability of Gaussian mixtures
- Algebraic matroids in action
- All secant varieties of the Chow variety are nondefective for cubics and quaternary forms
- Almost all subgeneric third-order Chow decompositions are identifiable
- An algorithm for generic and low-rank specific identifiability of complex tensors
- Bronowski's conjecture and the identifiability of projective varieties
- Characterizing generic global rigidity
- Combinatorial conditions for the unique completability of low-rank matrices
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Completion of tree metrics and rank 2 matrices
- Conditions for Unique Graph Realizations
- Connected rigidity matroids and unique realizations of graphs
- Equivalent realisations of a rigid graph
- Flexible circuits in the d‐dimensional rigidity matroid
- Frameworks, Tensegrities, and Symmetry
- Generalised rigid body motions in non-Euclidean planes with applications to global rigidity
- Generic forms of low Chow rank
- Generic global rigidity
- Generic global rigidity in _p-space and the identifiability of the p-Cayley-Menger varieties
- Generic Global Rigidity in Complex and Pseudo-Euclidean Spaces
- Global rigidity: The effect of coning
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 17636 (Why is no real title available?)
- scientific article; zbMATH DE number 952952 (Why is no real title available?)
- scientific article; zbMATH DE number 773851 (Why is no real title available?)
- Identifiability of homogeneous polynomials and Cremona transformations
- Infinitesimal rigidity for non-Euclidean bar-joint frameworks
- Linear Transformations that Preserve the Permanent
- Maximal matroids in weak order posets
- Moment identifiability of homoscedastic Gaussian mixtures
- Near-optimal sample complexity for convex tensor completion
- Non-defectivity of Grassmannians of planes
- Non-secant defectivity via osculating projections
- On a packing and covering problem
- On Generic Identifiability of 3-Tensors of Small Rank
- On generic identifiability of symmetric tensors of subgeneric rank
- On graphs and rigidity of plane skeletal structures
- Realizations of volume frameworks
- Rigidity and reconstruction in matroids of highly connected graphs
- Rigidity of random subgraphs and eigenvalues of stiffness matrices
- Sparse hypergraphs and pebble game algorithms
- Spectra of graphs
- The algebraic combinatorial approach for low-rank matrix completion
- The Hitchhiker guide to: secant varieties and tensor decomposition
- The Rigidity of Graphs
- Unique low rank completability of partially filled matrices
- Uniquely realisable graphs in analytic normed planes
- Uniqueness of low-rank matrix completion by rigidity theory
- Volume rigidity and algebraic shifting
- Weakly defective varieties
- Which graphs are rigid in \(\ell_p^d\)?
- Über die Gliederung ebener Fachwerke.
This page was built for publication: Identifiability of points and rigidity of hypergraphs under algebraic constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310684)
