Skip to content
DraconiticResearch
Search Sources API
210,049 studies31 sourcesUpdated 1 h ago

Combinatorics & discrete mathematics

4,167 studies349 in 7 days1,768 in 30 days

Filters
Type
Date
Clear

Latest

4,167 studies

  1. On the gonality of Kneser graphs
    Luis A. Ballinas, Willoughby Caine, D. Blake Hopkins +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. An Improvement to the Upper Bound for Marton's Covering Conjecture
    Zhao Song, Song Yue
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Deficit bounds and equality cases in the Tu--Deng problem
    Kaimin Cheng
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. K-spherical horospherical averages on the Nagao quotient: tree combinatorics and exact discrepancy
    Sanghoon Kwon
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsDynamical systemsarXiv
  5. Palindromic Poincaré polynomials in Bn
    Gaston Burrull
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  6. Blow-ups of order types of positive density
    Ruy Fabila-Monroy, Benedikt Hahn, Jesús Leaños
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Limiting shape of alternating sign matrices
    Alexey Bufetov, Evgeny Obukhov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsProbabilityarXiv
  8. Pretty good quantum state transfer via transcendental edge weights
    Addison Ballif, Mark Kempton, James B. Larsen +3
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. Higher-order rich clubs and configuration models on general directed hypergraphs
    Jason P. Smith, Celia Hacker, Jānis Lazovskis +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  10. A two-stage algebraic framework for designing cryptographically strong S-boxes for secure image encryption
    Asima Razzaque, Hafiza Zara Mustafa, Dilshad Alghazzawi +1
    PLOS OnePeer-reviewedCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsStatisticsPLOS
  11. Improving sport horse selection using machine learning: Early prediction of elite-level show jumping performance
    Marco Zanchi, Clara Bordin, Michela Ablondi +4
    PLOS OnePeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsPLOS
  12. The Aldous chain on cladograms mixes in order n2 steps
    Valentin Féray, Lucas Teyssier
    HALPreprintCC0Full textCombinatorics & discrete mathematicsProbabilityHALarXiv
  13. Bounds for B-coloring planar and outerplanar graphs
    Ryan Martin, Miklós Ruszinkó, Gábor Sárközy
    Discrete MathematicsPeer-reviewedLicence not statedCombinatorics & discrete mathematicsHAL
  14. Optimal complete-feedback card guessing under nonincreasing valley weights: A proof of the Diaconis-Fulman-Holmes shelf-shuffling conjecture
    Congyi Luo
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  15. Extremal expectations in card guessing with partial feedback: proofs of two conjectures of Diaconis-Graham-Spiro
    Congyi Luo
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  16. An inverse problem on eigenfunction triple products
    Carl Schildkraut, Romain Speciel
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  17. Polynomial Length Cycles In Tough Graphs
    Levi Segal, Jacques Verstraete
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  18. Elementary proofs of congruences modulo 5 for overpartitions with restricted odd differences
    Bishnu Paudel, James A. Sellers, Haiyang Wang
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  19. Ramsey Obstructions to Disambiguation
    Romain Bourneuf, Antonin Kiladjian, Stéphan Thomassé
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. Independent domination in central graphs
    Abel Cabrera-Martínez, José Luis López-Carmona, Ismael Rios-Villamar +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  21. Matroids and isomorphism problems for Bestvina-Brady groups
    Yu-Chan Chang, Lorenzo Ruffoni
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  22. A Cheeger Inequality for Hypergraphs and Its Applications
    Raj Kamal, Amitabha Bagchi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. On symmetric partition lattices and probability interactions
    Jean Carlo Guella
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  24. Combinatorial slicing problems of polytopes: How (not) to reconstruct a polytope from its slices
    Anna Birkemeyer, Anouk E. Brose, Marie-Charlotte Brandenburg +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. A simpler proof of the Matrix Spencer Theorem
    Nikhil Bansal, Yunbum Kook
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv