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

Counting interesting elections

We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.

4 nodes3 linksoverview previewCounting interesting elections
SearchCollections
4 nodes3 links
Counting interesting elections4 visible / 4 total nodes / 4 links
Co-authorshipAuthorshipAuthorshipTopic signalWCounting interesting electionspreprint / 2010ALara K. PudwellResearcherAEric S. RowlandResearcherTmath.CO8936 works
PaperSignal 103 links

Counting interesting elections

preprint / 2010

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)