{"sections":[{"heading":"Why combinatorics creates a distinctive O-1A evidence problem","paragraphs":["Combinatorics is a branch of mathematics concerned with counting, arrangement, and structural properties of discrete objects — graphs, networks, matroids, permutations, and their generalizations. The field spans pure combinatorics with connections to algebra and number theory, probabilistic combinatorics and random graph theory, and algorithmic combinatorics with applications to theoretical computer science. This breadth creates an evidence challenge: a combinatorialist may publish in mathematics journals, theoretical computer science venues, and applied mathematics proceedings simultaneously, and the petition must present these as a coherent research program in a recognized discipline rather than fragmented contributions across unrelated technical fields. The cover letter must explain the field's structure before the evidence can be evaluated by a generalist adjudicator.","The publication landscape in combinatorics reflects the field's hybrid character. The Journal of Combinatorial Theory Series A and Series B are the flagship specialist journals, but significant combinatorics work also appears in the Annals of Mathematics, Inventiones Mathematicae, the Journal of the American Mathematical Society, Combinatorica, Advances in Combinatorics, and the Electronic Journal of Combinatorics. The petition must establish a hierarchy among these venues with concrete selectivity data, and the expert letters must explain why recognition across multiple journals represents breadth of impact rather than inability to place work at any single leading outlet. Adjudicators unfamiliar with mathematics cannot independently assess journal prestige and require explicit context in the cover letter.","Salary data is generally not useful for combinatorics O-1A petitions. Virtually all research-active combinatorialists hold faculty positions at doctoral-granting mathematics departments, and university mathematics salaries tend not to reach the 90th percentile benchmarks for postsecondary mathematics teachers under BLS OEWS occupational categories. A well-structured combinatorics petition does not include high salary evidence; instead, it builds the case across publications, awards, memberships, judging, and original contributions. The cover letter should state explicitly that high salary is not being claimed and that the petition satisfies the regulatory minimum through three or more of the other criteria enumerated under 8 C.F.R. § 214.2(o)(3)(iv)."]},{"heading":"Awards, prizes, and professional recognition","paragraphs":["The AMS-SIAM Pólya Prize, awarded every four years for outstanding contributions to combinatorics or an application of combinatorics, is the field's most targeted honor and provides direct awards criterion evidence. The Sloan Research Fellowship recognizes early-career combinatorialists within its annual cohort of young mathematicians and is often the strongest prize-level evidence available to a researcher who has not yet received the field's senior honors. The AMS David P. Robbins Prize, awarded for significant work that provides a novel perspective on a combinatorics problem, offers additional targeted recognition. Each award should be documented with the selection process, award frequency, and information about the pool of eligible researchers who did not receive it in the same cycle.","AMS Fellowship satisfies the memberships criterion for combinatorics O-1A petitions. The Combinatorial Mathematics Society of Australasia's Hall Medal and Euler Medal for distinguished contributions to combinatorics can serve as national or international recognition when their selection processes and community standing are documented carefully. For combinatorialists with connections to theoretical computer science, ACM Fellow status provides a well-recognized credential within government review contexts. The petition should document each fellowship or award's selection process, the percentage of eligible researchers who receive it, and independent confirmation of the award's standing within the relevant professional community. Recognition from multiple professional organizations in adjacent fields strengthens the totality of the evidence.","Plenary and invited addresses at the British Combinatorial Conference, SIAM's Discrete Mathematics meeting, or the International Congress of Combinatorics and Graph Theory provide evidence of community standing. A plenary invitation — not a contributed abstract accepted through a standard submission process — reflects the program committee's judgment that the petitioner's work merits a broad audience of specialists. The petition should document the conference program's history of plenary speakers, the organizing committee's composition, and a letter from an organizer explaining what a plenary invitation at this venue represents. The distinction between an invited and contributed address, and between an invited participant and a registered attendee, must be stated explicitly to a non-mathematician reviewing the record."]},{"heading":"Publications criterion for combinatorics researchers","paragraphs":["The Journal of Combinatorial Theory Series A and Series B maintain acceptance rates below fifteen percent and serve as the primary specialist journals for advanced combinatorics research. Series A covers algebraic combinatorics, enumerative combinatorics, and combinatorial geometry; Series B focuses primarily on graph theory. Publication in either series — particularly papers that resolve open problems or introduce new structural techniques — is strong scholarly articles criterion evidence. The petition should document the journals' impact factors, acceptance rates over a recent five-year window, and citation records for published papers demonstrating reception beyond the petitioner's home institution. An expert letter explaining what sustained publication in these journals represents within the combinatorics community is essential supporting material.","Combinatorica, published by Springer, is one of the field's oldest specialist journals and maintains rigorous editorial standards. The Electronic Journal of Combinatorics is open access but maintains competitive acceptance rates and editorial standards comparable to print journals — a point worth making explicitly since adjudicators may assume open-access publication implies lower selectivity. For combinatorics work with a computer science dimension, the SIAM Journal on Discrete Mathematics, IEEE Transactions on Information Theory, and the Journal of Graph Theory are appropriate additional venues. Publication across multiple high-tier journals demonstrates that the petitioner's work is recognized across the full range of the field's theoretical and applied communities rather than in a single niche subdiscipline.","Cross-citation analysis — identifying citations to the petitioner's work by researchers at institutions independent of the petitioner — is valuable for combinatorics petitions because the field is small enough that citation patterns are individually meaningful. A combinatorics result cited by researchers at four or five leading mathematics departments demonstrates reception that extends well beyond the original journal's peer review. MathSciNet, maintained by the AMS, provides more structured citation data for mathematics publications than Google Scholar, and the petition should use MathSciNet records where available. When a petitioner's result has been incorporated into subsequent major work by a recognized figure in the field, that citation should be highlighted as particularly strong evidence of the result's significance within the research community."]},{"heading":"NSF DMS grants and original contributions","paragraphs":["NSF DMS Combinatorics program grants are peer-reviewed by panels of active researchers evaluating proposals for mathematical significance and track record. Competitive awards typically range from $200,000 to $350,000 for three-year standard grants, with CAREER awards between $400,000 and $600,000. The petition should include the funded proposal's abstract from the NSF award database, the program's name within DMS, and an expert letter explaining what NSF Combinatorics program funding indicates about the funded researcher's standing. Grants that have been renewed or that have produced published results demonstrably connected to the funded proposal provide evidence that the petitioner's research program has delivered on its peer-reviewed scientific promise.","Original contributions in combinatorics often take the form of resolving longstanding open conjectures, introducing structural techniques subsequently adopted by other researchers, or establishing connections between combinatorics and an adjacent mathematical discipline that opens a new research direction. The petition must describe these contributions accessibly for a generalist adjudicator. A useful structure explains the specific problem solved, what was previously known and unknown, and what other researchers have built on the petitioner's result. When a petitioner has resolved a problem that appeared in multiple papers across several decades without a complete solution, the problem's research history can be documented briefly to demonstrate the contribution's recognized importance within the field's agenda.","When a petitioner's contributions span combinatorics and an adjacent field — discrete geometry, probabilistic combinatorics, or algebraic combinatorics and representation theory — the petition should present these as a coherent mathematical vision. Expert letters from researchers in both the combinatorics and the adjacent community demonstrate that the petitioner is recognized across multiple research communities, which strengthens the totality argument. USCIS adjudicators applying the totality standard look favorably on records showing recognition from a range of independent experts rather than praise concentrated among a small group with potential conflicts of interest. The cover letter should explain why the petitioner's interdisciplinary contributions represent a unified research program with significant results recognized across multiple communities."]},{"heading":"Judging, peer review, and expert recognition","paragraphs":["NSF DMS Combinatorics program panel service is the primary judging evidence for O-1A petitions from this field. Invitations come from program officers who maintain lists of expert reviewers, and selection is calibrated to cover the breadth of active subfields within combinatorics while avoiding conflicts with proposals under review. A letter from the NSF program officer confirming the petitioner's participation, the panel's role in funding decisions, and the expertise required for service is standard documentation. Petitioners who have served on multiple panels across different funding cycles demonstrate that their judgment is regularly sought by NSF for evaluating the most competitive research proposals in the field, which is itself a meaningful form of peer recognition.","Refereeing for top combinatorics journals — Journal of Combinatorial Theory, Combinatorica, and the SIAM Journal on Discrete Mathematics — provides supporting evidence when documented with an editor's letter confirming the referee relationship and explaining the journal's referee selection criteria. The most useful letters confirm that referees are selected from among recognized experts in the relevant subarea of combinatorics, not from a general pool of academics who have published in the field at any level. When an editor can state that the petitioner's refereeing assignments reflect the editor's specific reliance on the petitioner's judgment in a particular subdiscipline, the evidence becomes substantially more targeted and persuasive.","Workshop organization at the American Institute of Mathematics, the Banff International Research Station, or similar venues where combinatorics workshops are held by invitation provides additional recognition evidence. These organizational roles are extended based on scientific reputation and standing within the combinatorics community. The petition should document the funding sources for the workshop, the scientific focus, co-organizers' names and institutional affiliations, and any information about participant selection demonstrating the workshop was curated rather than open. Organizational service at this level converts community involvement into evidence of professional standing distinct from and complementary to the publications, grants, and awards forming the primary basis of the petition."]},{"heading":"Building a complete combinatorics O-1A petition","paragraphs":["A complete combinatorics O-1A petition typically relies on three to five criteria: publications in high-tier specialist journals, original contributions documented through expert letters and grant records, memberships or awards recognition, and judging panel service. The relative weight of each criterion depends on the petitioner's career stage. A senior faculty member with multiple NSF grants and AMS Fellowship has a different filing configuration than an early-career researcher with a strong publication record but no formal community recognition. The cover letter should identify the three criteria with the strongest evidence and present them as the primary basis of the petition, using the remaining evidence as corroborating material rather than as independent primary bases.","Expert letters are essential connective tissue for a combinatorics O-1A petition. The mathematical details distinguishing a petitioner's work — a new technique resolving an open problem, a construction proving a longstanding conjecture — require expert explanation that no adjudicator can independently evaluate. Letters from three to five senior combinatorialists at peer institutions should describe specific contributions, compare the petitioner's record to others at similar career stages, and explain why the work is recognized as distinguished rather than merely competent. Letter writers who hold named chairs, AMS Fellow status, or NSF CAREER awards add credibility through their own recognized standing and increase the persuasive weight of their technical assessments.","The common failure mode in combinatorics O-1A petitions is over-reliance on the petitioner's own description of their work without independent corroboration. Adjudicators issuing RFEs often note that the primary record lacks evidence from researchers with no professional connection to the petitioner. Building cross-institutional evidence — citations from independent institutions, letters from experts who did not train the petitioner or work in the same department — addresses this weakness directly. Every significant claim about the petitioner's recognition should be corroborated by at least one independent piece of evidence: a citation from an unaffiliated researcher, a letter from an expert at a different institution, or a documented conference or panel invitation whose selection process is explained in the record."]}],"article":{"title":"O-1A for Combinatorics Researchers: NSF DMS Grant Records, Journal of Combinatorial Theory Publications, and AMS Field Recognition","excerpt":"Combinatorics researchers building an O-1A petition must translate recognition structures — Journal of Combinatorial Theory publications, NSF DMS grants, and combinatorics conference keynotes — into evidence satisfying criteria designed for generalist adjudicators. The high salary criterion and critical role evidence are often the strongest elements of a combinatorics petition.","category":"O-1A Guide","date":"Sep 22, 2026","readTime":"8 min read"},"prev":{"title":"O-1A for Stochastic Processes Researchers: NSF DMS Grant Records, Stochastic Processes and Their Applications Publications, and Field Recognition","slug":"o-1a-for-stochastic-processes-researchers-nsf-dms-grant-records-stochastic-processes-and-their-applications-publications-and-field-recognition"},"next":{"title":"O-1A for Numerical Analysis Researchers: NSF DMS Grant Records, Numerische Mathematik Publications, and SIAM Field Recognition","slug":"o-1a-for-numerical-analysis-researchers-nsf-dms-grant-records-numerische-mathematik-publications-and-siam-field-recognition"},"related":[{"title":"O-1A for Knot Theory and Low-Dimensional Topology Researchers: NSF DMS Grant Records, Geometry and Topology Publications, and Field Recognition","slug":"o-1a-for-knot-theory-and-low-dimensional-topology-researchers-nsf-dms-grant-records-geometry-and-topology-publications-and-field-recognition"},{"title":"O-1A for Harmonic Analysis Researchers: NSF DMS Grant Records, Journal of Functional Analysis Publications, and AMS Field Recognition","slug":"o-1a-for-harmonic-analysis-researchers-nsf-dms-grant-records-journal-of-functional-analysis-publications-and-ams-field-recognition"},{"title":"O-1A for Stochastic Processes Researchers: NSF DMS Grant Records, Stochastic Processes and Their Applications Publications, and Field Recognition","slug":"o-1a-for-stochastic-processes-researchers-nsf-dms-grant-records-stochastic-processes-and-their-applications-publications-and-field-recognition"},{"title":"O-1A for Numerical Analysis Researchers: NSF DMS Grant Records, Numerische Mathematik Publications, and SIAM Field Recognition","slug":"o-1a-for-numerical-analysis-researchers-nsf-dms-grant-records-numerische-mathematik-publications-and-siam-field-recognition"},{"title":"O-1A for Representation Theory Researchers: NSF DMS Grant Records, Representation Theory and Compositio Mathematica Publications, and Field Recognition","slug":"o-1a-for-representation-theory-researchers-nsf-dms-grant-records-representation-theory-and-compositio-mathematica-publications-and-field-recognition"},{"title":"O-1A for Number Theorists: Publications, Grants, and Award Evidence","slug":"o-1a-for-number-theorists-publications-grants-and-award-evidence"}]}