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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,014 studies

  1. Extremal permutations of ℤn with many good slopes and applications to quantum Latin squares
    Dipak K. Bhunia
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. An Odd-Arch Family of Perturbed Hofstadter Q-Recursions: Gaussian Profiles and Exact Frequency Laws
    Marco Mantovanelli
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. Irreducibility of Full Multivariate Partial-Twuality Polynomials
    Qingying Deng, Chaoyang Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. The Marvelous Meixner Polynomials: Second Kind, First Class
    Olga Holtz
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsProbabilityarXiv
  5. An FPRAS for Mixed Volumes
    Xiaoyu Chen, Kuikui Liu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  6. Graceful supertrees with at most 2m−diam(T) edges
    Obinna Okechukwu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  7. Threshold existence for random NAE-k-SAT and random hypergraph $2$-colourability
    Pavel Zakharov
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  8. Clique counts under degree and matching constraints
    Rajat Adak
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  9. Resonance varieties of Schubert arrangements
    Graham Denham, Prajwal Udanshive
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. Halving Partitions and Hyperbinary Expansions
    Max A. Alekseyev
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  11. Representability of Graphical Symplectic Matroids
    Sayantan Ganguly
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. On the growth of weak regular partitions in k-uniform hypergraphs
    H. Sheats, C. Terry
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  13. Fluid Limits and Upper Bounds for Randomized Greedy Matching
    Sayan Mukherjee
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  14. Coefficientwise Hankel-total positivity from a universal cumulant lifting
    Bao-Xuan Zhu
  15. Enumeration of plane hypermaps with a mixed boundary II
    Thomas Lejeune
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. Non-backtracking Laplacian for hypergraphs
    Eleonora Andreotti, Raffaella Mulas
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  17. The Value of Steiner Hubs in Two-Hop Distance Labeling
    Sichen Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  18. A matroid characterization of the combinatorially symmetric maximum nullity of a graph
    Louis Deaett, Veronika Furst, John Hutchens +1
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsarXiv
  19. A localized packing lemma for sets of bounded VC2-dimension
    C. Terry, J. Wolf
    arXivPreprintCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  20. On Sparse Graph Limits for Neural Combinatorial Optimization
    Thien Le, Melanie Weber
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  21. Claw-free perfect graphs are chromatic-choosable
    Suchismita Mishra, Narayanan Narayanan, Umesh Shankar
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. Maximal input entropy for binary two-deletion and two-insertion channels
    Haobo Ma, Wenlin Zhang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. Almost Gorenstein edge rings of bipartite graphs and their h-vectors
    Yuta Hatasa, Koji Matsushita
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  24. Spanning tree with bounded degree sum of two adjacent vertices
    Pham Hoang Ha
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Mutual-visibility colouring with two colours is NP-complete for every fixed diameter
    Siddhesh Chaubal
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv