Digital Commons @ Michigan Tech
metadata only
Projective planes, coverings and a network problem
A study to investigate the projective planes, coverings and a network problem is presented. The maximum mass of weighted k-arcs in projective planes of order q when q is a prime power is determined. It is observed that a problem concerning packet switched networks leads to a natural combinatorial de
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Faster All-Pairs Shortest Paths via Circuit Complexity#409019
- One-Shot and Concurrent Hitting Times for Grover-Coined Quantum Walks on Cubelike Graphs#927788
- Chain rule symmetry for singular SPDEs from multi-indices to decorated trees#984582
- Online Matching in Convex Bipartite Graphs#972009
- Further Comments on Yablo's Construction#785054
Record · ID 1048222
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive