Skip to content
DraconiticResearch
Search Sources API
179,152 studies31 sourcesUpdated 15 min ago

Combinatorics & discrete mathematics

3,771 studies383 in 7 days1,783 in 30 days

Filters
Type
Date
Clear

Latest

3,771 studies

  1. The Thue-Morse substitutions and self-similar groups and algebras
    Laurent Bartholdi, José Manuel Rodríguez Caballero, Ahmed Tanbir
    Algebra and Discrete MathematicsPeer-reviewedLicence not statedFull textCombinatorics & discrete mathematicsHAL
  2. An algorithm for uniform generation of unlabeled (Pólya) trees
    Laurent Bartholdi, Persi Diaconis
    Forum Math. SigmaPeer-reviewedCC BYFull textCombinatorics & discrete mathematicsHAL
  3. Horocyclic products of trees
    Laurent Bartholdi, Markus Neuhauser, Wolfgang Woess
    J. Eur. Math. Soc. (JEMS)Peer-reviewedLicence not statedFull text56 citedCombinatorics & discrete mathematicsHAL
  4. Lamps, factorizations, and finite fields
    Laurent Bartholdi
    The American Mathematical MonthlyPeer-reviewedLicence not statedFull textCombinatorics & discrete mathematicsHAL
  5. Get Permanent Results Faster by Counting Stars
    Radu Curticapean
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. On ill-distributed B3 and B4 sets
    André Hisatsuga, Rafael Miyazaki, Cosmin Pohoata
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  7. Uniform Sampling of Linear Codes with Prescribed Hull Dimension
    Keita Ishizuka
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. The proof of the Harary--Hill conjecture: a detailed exposition and an extension to rotation systems
    Gelasio Salazar
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. The Optimizer's Windfall: Bounding Hindsight Gain under Random Restrictions
    Xiaohui Bei, Wenhao Wu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. A nearly tight bound on the probability G(n,p) is even-degenerate
    Ting-Wei Chao, Bruce Reed
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  11. Proving the Komlós conjecture slowly
    Lawrence Hollom
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. Centralizers of maps as automorphism groups of Yang--Baxter solutions
    Gigel Militaru
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  13. Finite groups with all involutions fused
    Zheng Guo, Yan Zhou Zhu
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  14. Maximizing Crossword Grids with a Fixed Minimum Clue Length
    Kelly Isham, Abigail Schnitzer
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. Exact Agreement Expansion up to the Top via Non-polarity
    Tali Kaufman, Huy Tuan Pham
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. The strong fractional choice number can exceed the choice number
    Yangyan Gu, Rongxing Xu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  17. Asymptotically Optimal Weighted Edge Colorings via Local Bin Packing
    Rishikesh Gajjala, Arindam Khan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. An Erdős-Pach-Pollack-Tuza theorem for oriented diameter
    Jiangdong Ai, Bin Chen, Yaokun Feng
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. Counterexamples to Relaxed Multiplication in List Coloring
    Xiaolan Hu, Jiao Li
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. Reed-Muller Codes are Optimal Binary Linear 3-Query LCCs
    Oliver Janzer, Peter Manohar
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  21. Non-simple Arrangements of Lines and Pseudolines with Many Triangles
    Roman Parpalak, Denis Utkin
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. Optimal Configurations for Mordell's Problem
    Xiang Ji, Tiancheng Xu, Wensheng Yu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  23. An optimal χ-bound for {P7, diamond}-free graphs
    Kaiyang Lan, Hongyang Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. On local spectra of classical distance-regular graphs with b = 2
    Alexander L. Gavrilyuk, Janoš Vidali
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Buildings governed by twisted Bruhat orders
    Harvey Sykes
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv