The \(k\)-orbit reconstruction and the orbit algebra
From MaRDI portal
Publication:1201909
DOI10.1007/BF00053380zbMath0769.05069MaRDI QIDQ1201909
Publication date: 17 January 1993
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Local properties of groups (20E25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (5)
Reconstructing under group actions. ⋮ Kernels of modular inclusion maps ⋮ Reconstructing infinite sets of integers ⋮ An Algebraic Formulation of the Graph Reconstruction Conjecture ⋮ Reconstructing subsets of \(\mathbb{Z}_n\)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orbits in finite incidence structures
- Subgroups inducing the same permutation representation
- An invariant theory approach to graph enumeration
- An extremal problem for Graham-Rothschild parameter words
- Quotients of Peck posets
- Balance equations for reconstruction problems
- Reconstructing graphs from their k-edge deleted subgraphs
- Rings of geometries. I
- Combinatorial reconstruction problems
- An incidence algebra for t-designs with automorphisms
- Graphical partially ordered sets
- Reconstruction of k-orbits of a permutation group
- On partitions and permutation groups on unordered sets
- Some results on conversion matrices
- Lattice constants matricial equations for conversion matrices
- Some aspects of groups acting on finite posets
- On a class of partially ordered sets and their linear invariants
- Transitivity of permutation groups on unordered sets
- The edge reconstruction hypothesis is true for graphs with more than n log n edges
- On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
- On incidence structures in finite classical groups
- Construction of \((k+1)\)-orbits of permutation groups from their \(k\)- orbits
- Intersection theorems and mod \(p\) rank of inclusion matrices
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- Intertwining automorphisms in finite incidence structures
- On the number of sets in a null t-design
- On the vector space of 0-configurations
- Transitivity of finite permutation groups on unordered sets
- Endliche \(k\)-homogene Permutationsgruppen
- On incidence matrices of finite projective and affine spaces
- A note on the line reconstruction problem
- Algebras of complexes
- The edge reconstruction of hamiltonian graphs
- On the minimum distance of combinatorial codes
- The transitive groups of degree up to eleven+
- On the problem of computing the subdegrees of transitive permutation groups
- On the Structure oft-Designs
- Incidence Matrices of Subsets—A Rank Formula
- Colour Schemes
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- Graph reconstruction—a survey
- A note on the edge reconstruction conjecture
- Lattice Constant Systems and Graph Theory
- The Burnside algebra of a finite group
- On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry
This page was built for publication: The \(k\)-orbit reconstruction and the orbit algebra
