◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Thomas Jenrich

8 papers hereh-index 265 citations11 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author8

Across the 8 of 8 papers where every author was matched, so the position is known.

fields
  • math.CO5
  • cs.DM1
  • math.HO1
  • math.MG1

identity via Semantic Scholar / OpenAlex

activity
20112023
most citedA 64-dimensional two-distance counterexample to Borsuk's conjecture

8 citations · 10 across the 8 of their papers we have counts for

collaborators
Showing 2011 · cs.DMShow all

1 paper · 2 filters

cs.DM2011

Guaranteed successful strategies for a square achievement game on an n by n grid

Thomas Jenrich

At some places (see the references) Martin Erickson describes a certain game: "Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of a…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.