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

Decomposition Lemmas

We define two recursive functions obtained by decomposition of a given interval into four close parts and prove two lemmas which determine features of these functions.

5 nodes5 linksoverview previewDecomposition Lemmas
SearchCollections
5 nodes5 links
Decomposition Lemmas5 visible / 5 total nodes / 6 links
Related contextCo-authorshipAuthorshipAuthorshipTopic signalTopic signalWDecomposition Lemmaspreprint / 2013AMark KorenblitResearcherAVadim E. LevitResearcherTmath.CO8936 worksTDiscrete Mathematics1775 works
PaperSignal 104 links

Decomposition Lemmas

preprint / 2013

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)