Skip to content
DraconiticResearch
Search Sources API
206,698 studies31 sourcesUpdated 43 min ago

Combinatorics & discrete mathematics

4,165 studies347 in 7 days1,766 in 30 days

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Sparse coloring for isosceles-free grids: an AI-assisted proof case study
    Yukai Song
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. On the large-clique version of the Erdős-Sós theorem
    Kun Cheng, Yurui Tang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Twisted Bracelets for Sorting by Transpositions: the Transposition Diameter of S16
    Luiz A. G. Silva, Luis A. B. Kowada, Noraí R. Rocco +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. Sharp Antipode-Neighbor Bounds in Every Dimension
    Samuel Korsky
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  5. Hurwitz Stability of Generalized Turán Expressions of Polynomial Sequences
    Huihua Gao, Xin-Bei Liu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Restrictions of the dot action representation
    Hsin-Chieh Liao, Martha Precup, John Shareshian
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  7. Monochromatic Almost-Pythagorean Quadruples
    James Leng, Redmond McNamara, Andreas Mountakis
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsDynamical systemsarXiv
  8. A note on the asymmetric discretised ring theorem
    Willliam O'Regan
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  9. Generalizing the AA Problem for Finite Ordered Sets
    George Grätzer
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  10. The Zero Forcing Number of Graph Powers
    Aida Abiad, Mary Flagg, Sina Ghasemi Nezhad +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  11. Exact and asymptotic enumeration of unrestricted binary phylogenetic networks through automorphism weights
    Josep Batle
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. An Improved Upper Bound for Recovering Pairs
    Simone Costa
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  13. An example of an automatic sequence with non-regular abelian complexity
    Jean-Paul Allouche, Narad Rampersad, Michel Rigo +2
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  14. Spectral Incidence Bounds over Finite Fields
    Yao Zhi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  15. Matching algebras and their Dunkl subalgebras
    Darij Grinberg, Anatol Kirillov, Boris Shapiro
    arXivPreprintCC0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  16. Sets of equiangular lines in dimension $18$ constructed from A53 ⊕ A14
    Akihiro Munemasa, Ferenc Szöllősi, Kiyoto Yoshino
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Non-isomorphic graphs have distinct vertex-Ramsey classes
    Maria Axenovich, Patrick Schmitteckert
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. Signed seeds and G-gradings on cluster algebras
    Lauren Williams, Alan Yan
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  19. Counting Hamiltonian Sturm permutations: generating functions and Gaussian distributions
    Bernold Fiedler, Carlos Rocha
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. Grid Theory and Polynomiality in Dynamic Lot-Sizing
    El-Mehdi Mehiri, Nabil Absi, Elodie Suzanne
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  21. Counterexamples to the Strong Roberson Conjecture
    Arnar Á. Kristjánsson
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. Partitioning an S-packing coloring into broadcast dominating sets
    Boštjan Brešar, Jasmina Ferme, Wenjie Hu
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. On the Spectra of Generalized Token Graphs of Stars
    Cristina Dalfó, Miquel Àngel Fiol, Berenice Martínez-Barona +1
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  24. Schur positivity of three-legged spiders
    David G. L. Wang, Watson Z. Y. Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. k-Pairing: A Generalization of the Partition Pairing Theorems
    Xiaorui Niu, Diane Y. H. Shi
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv