PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 12, 2026Discrete Mathematics & Theoretical Computer Science0 citationsOpen Access

On an Erdős-Szekeres Game

LPLara PudwellValparaiso University

Key Points

  • The study investigates a two-player permutation game based on the Erdős-Szekeres Theorem, focusing on conditions for determining the winner.
  • Analyzed the game dynamics with parameters a and b.
  • Focused on scenarios where a ≥ b and b takes on values 2, 3, 4, or 5.
  • Formulated winning strategies for different parameter configurations.
  • Established clear winning strategies for each value of b.
  • Identified the conditions under which one player can guarantee a win.
  • Outlined the relationship between the values of a and b in determining outcomes.

Abstract

We consider a 2-player permutation game inspired by the celebrated Erdős-Szekeres Theorem. The game depends on two positive integer parameters a and b and we determine the winner and give a winning strategy when a b and b \2, 3, 4, 5\. 18 pages

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Lara Pudwell (2026) studied this question.

synapsesocial.com/papers/69b2579096eeacc4fcec6544https://doi.org/10.46298/dmtcs.14855
Ask AI
Helpful
Bookmark
Share
View Full Paper