BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Graph explorer

Pinwheels and bypasses

We give a necessary and sufficient condition for the addition of a collection of disjoint bypasses to a convex surface to be universally tight -- namely the nonexistence of a polygonal region which we call a virtual pinwheel.

5 nodes4 linksoverview previewPinwheels and bypasses
SearchCollections
5 nodes4 links
Pinwheels and bypasses5 visible / 5 total nodes / 7 links
Co-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipTopic signalWPinwheels and bypassespreprint / 2005AKo HondaResearcherAWilliam H. KazezResearcherAGordana MaticResearcherTmath.GT2393 works
PaperSignal 104 links

Pinwheels and bypasses

preprint / 2005

Open

Personal maps

Sign in to save graph views

Saved views keep the query, focus and filters attached to this map.

Sign in

Public snapshots

1 shared view(s)