Latest Research in Advanced Combinatorial Mathematics

Top Research Topics in Advanced Combinatorial Mathematics

• Combinatorics — 51 papers
• Advanced Combinatorial Mathematics — 14 papers
• Logic — 14 papers
• Computability, Logic, AI Algorithms — 10 papers
• Benford’s Law and Fraud Detection — 9 papers
• Limits and Structures in Graph Theory — 8 papers
• Number Theory — 8 papers
• Complexity and Algorithms in Graphs — 7 papers
• Logic, programming, and type systems — 6 papers
• Advanced Graph Theory Research — 6 papers

Highest-Cited Papers

1. An Upper Bound of (3√3/2 + o(1))^d for the Chromatic Number of Euclidean Space (3 citations)
2. Measure-Zero vs. Meager: Two Inequivalent Notions of Smallness — E8 Intelligence Research
3. Topological Mapping of NP-Complete Complexity Classes onto Fractal Manifolds: A Framework for Direct P vs NP Resolution
4. Depth-one disjoint-type guessing and Kunen's interval-hitting principle
5. Topological Mapping of NP-Complete Complexity Classes onto Fractal Manifolds: A Framework for Direct P vs NP Resolution
6. A Permutation Grid with 155 Rook Placements
7. Additive Augmentation Gaps Do Not Force Log-Concavity
8. Orbit Computation by Satisfiability: Structural Invariants and their Boundaries
9. A Permutation Grid with 155 Rook Placements
10. An independent exact verification of the 2026 counterexample to Goemans' unsplittable-flow cost conjecture, with the violation constant it forces
11. The R.E. Degrees: Joins, Missing Meets, and Fickleness — E8 Intelligence Research
12. Sharp stability for cross $t$-intersecting families of permutations in the linear range
13. The Clock [3600,60,1] and the (25,12)-System: A Structural Comparison
14. A sharp inverse theorem for the quadratic large sieve
15. The extensible no-four-on-a-circle problem
16. Rich Sequences and Decidability of Arithmetic Theories
17. Lean-Certified Infinite Counterexamples to Written on the Wall II Conjecture 194
18. Generalized $p$-ary $\cPS$ Bent Functions
19. Generically stable Keisler measures
20. When games follow Fibonacci from Isbell’s construction to priority parsimonious games via Horadam sequences