Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 37 min ago

Combinatorics & discrete mathematics

4,014 studies257 in 7 days1,648 in 30 days

Filters
Type
Date
Clear

Latest

4,014 studies

  1. Full-Rank Constructions of Explicit Lossless Expanders and Good Small-Set qLTCs
    Yali Aharon-Holzman, Michael Ilan, Assaf Reiner +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Correlators of the Jacobi Unitary Ensemble on a General Interval and Hurwitz Numbers
    Matvey Sushkov
  3. The five vertex model on a rectangle
    Jan de Gier, Richard Kenyon, Michael Wheeler +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsProbabilityarXiv
  4. String attractors and bi-infinite words
    Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus
    HALPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsHAL
  5. Totally Equimodular Polyhedra: Diameters and Pivots
    Emiliano Lancini
    HALPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsHAL
  6. Museum visitors’ acceptance of digital services in China and Russia: Extending UTAUT2 with individual-level cultural values
    Jing Chen, Xiaobin Li, Chuanhua Zhu +1
    PLOS OnePeer-reviewedCC BYFull textCombinatorics & discrete mathematicsPLOSEurope PMCPMC
  7. Frontal alpha asymmetry and instructed satisfaction-rating changes after price presentation: An exploratory pilot study
    Passavorn Limmeechokchai, Bu-Nga Chaisuwan, Yodchanan Wongsawat +1
    PLOS OnePeer-reviewedCC BYFull textCombinatorics & discrete mathematicsProbabilityPLOSEurope PMCPMC
  8. A uniform double-factorial construction for consecutive-pattern packings
    Zoltán Nagy
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. On Gallai d-colored circulants
    Vladimir Gurvich, Mariya Naumova
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  10. The nonexistence of nine-point crescent configurations
    Yifei Wang
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  11. New lower bounds for kissing numbers in dimensions 32-35 and 37-39
    Qihong Lin
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  12. How the eigenvalue region of standardized Laplacians leaves the 2005 polygon
    Pavel Chebotarev
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  13. A Quasisymmetric Analogue of the Bruhat Order
    Ryan Bansal
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. The real eigenvalues of the non-backtracking Laplacian
    Raffaella Mulas, Leo Torres
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  15. Graphs versus loopless digraphs with a given degree sequence, and convergence of uniformly random graphs at every density
    Behzad Mehrdad
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  16. An Llog L theory of sparse graph convergence
    Behzad Mehrdad
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  17. Minimal cellular resolutions of complementary edge ideals
    Somayeh Moradi
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  18. On a hybrid trilinear Hilbert transform
    Cristina Benea, Frédéric Bernicot, Victor Lie
    arXivPreprintarXiv licenceFull textAlgebra & number theoryAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  19. A hitting-time version of Kotzig's conjecture in random graphs
    Stefan Glock, Lyuben Lichev, Amedeo Sgueglia
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. Characterizing k-Naples parking functions and refining bounds via obstructed parking functions
    Roger Tian
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  21. Enumeration of k-convex polyominoes by semi-perimeter
    Thomas Prellberg
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  22. Extremal zero-sum sequences without elements of maximal order
    Yongke Qu, Guoqing Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. On Guarding Line Arrangements
    Valentin Brimkov
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  24. Volume Doubling and Geometric Inequalities on Graphs with Bakry-Émery Curvature
    Yanlong Ding, Shiping Liu, Chiyu Zhou
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyProbabilityarXiv
  25. A complete characterization of graphs with second largest eigenvalue at most (√5−1)/2
    Chaohui Chen, Hangxi Cha, Haiying Shan +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv