Metric intersection problems in Cayley graphs and the Stirling recursion
From MaRDI portal
Publication:2375922
DOI10.1007/s00010-013-0196-8zbMath1267.05109arXiv1202.4493OpenAlexW2136943661MaRDI QIDQ2375922
Johannes Siemons, Teeraphong Phongpattanacharoen
Publication date: 25 June 2013
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.4493
Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Metric intersection problems in Cayley graphs and the Stirling recursion ⋮ Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(r\)-Stirling numbers
- On the maximum of \(r\)-Stirling numbers
- Vertex reconstruction in Cayley graphs
- Error graphs and the reconstruction of elements in groups
- A unified approach to generalized Stirling numbers
- Decomposition of certain products of conjugacy classes of \(S_ n\)
- Reconstruction of objects from a minimum number of distorted patterns
- Katriel's operators for products of conjugacy classes of \(\mathfrak S_n\)
- Products of conjugacy classes in groups
- Metric intersection problems in Cayley graphs and the Stirling recursion
- On some optimization problems in molecular biology
- Efficient reconstruction of sequences
- Efficient reconstruction of sequences from their subsequences of supersequences
- The group of generalized Stirling numbers