Reconstructing under group actions.
From MaRDI portal
Publication:855305
DOI10.1007/s00373-006-0675-yzbMath1162.20303OpenAlexW2120661453MaRDI QIDQ855305
Alexander D. Scott, Andrew John Radcliffe
Publication date: 5 January 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0675-y
Permutations, words, matrices (05A05) Representation theory of groups (20C99) Permutation groups (20B99)
Related Items (3)
Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ The combinatorial \(k\)-deck ⋮ Discrete phase retrieval in musical structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stories about groups and sequences
- A congruence theorem for trees
- A family of non-reconstructible hypergraphs
- Reconstruction of k-orbits of a permutation group
- A census of non-reconstructable digraphs. I: Six related families
- Reconstruction of infinite graphs
- The \(k\)-orbit reconstruction and the orbit algebra
- On the nonreconstructibility of combinatorial geometries
- Reconstructing subsets of \(\mathbb{Z}_n\)
- The \(k\)-orbit reconstruction for Abelian and Hamiltonian groups
- Reconstructing subsets of reals
- On a reconstruction problem for sequences
- Reconstructing sequences
- On the reconstruction index of permutation groups: semiregular groups.
- The falsity of the reconstruction conjecture for tournaments
- Graph reconstruction—a survey
- On the reconstruction of linear codes
- Finite Subsets of the Plane are 18-Reconstructible
- The Reconstructibility of Finite Abelian Groups
- A Decomposition for Combinatorial Geometries
This page was built for publication: Reconstructing under group actions.