◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Tony Zeng

4 papers hereh-index 17 citations5 works total

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

author position
  • sole author3
  • last author1

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

fields
  • math.CO2
  • math.MG1
  • math.NT1

identity via Semantic Scholar / OpenAlex

activity
20202026
most citedMaximum distances in the four-digit Kaprekar process

3 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.MG2026

A stellated tetrahedron that is probably not Rupert

Tony Zeng

A convex polyhedron is Rupert if a hole can be cut into it (making its genus 1) such that an identical copy of the polyhedron can pass through the hole. Resolving a conjecture of…

math.CO2026

Juniper Green and the Gallai-Edmonds Decomposition

Tony Zeng

Juniper Green is a simple combinatorial game invented by Rob Porteous and popularized by Ian Stewart. It was originally designed to familiarize school children with the concepts of…

math.CO2023

Graph decomposition via edge edits into a union of regular graphs

Tony Zeng

Suppose a finite, unweighted, combinatorial graph G=(V,E) is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. G…

math.NT2020★ 3 cited

Maximum distances in the four-digit Kaprekar process

Pat Devlin, Tony Zeng

For natural numbers x and b, the classical Kaprekar function is defined as Kb​(x)=D−A, where D is the rearrangement of the base-b digits of x in descending order 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.