RUcore, Rutgers University Community Repository
metadata only
Some results in computational and combinatorial geometry
In this thesis we present some new results in the field of discrete and computational geometry. The techniques and tools developed to achieve these results add to our understanding of important geometric objects like line arrangements, and geometric measures of depth. Given a set $S$ of $n$ poi
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
- Pascal tiling and congruences modulo N in Pascal's triangle#985703
- A Boothby-Wang construction in generalized contact geometry#1131472
- The Hall-Janko Simple Group and the Icosian Leech Lattice#1037525
- The Kaleidoscopic Filter, Part I : A Structural Resolution of Restricted Integer Partitions#1109782
- Discrete Mathematics with Applications#1179837
Record · ID 1017346
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