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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. Tiling 3D by Translates of a Single Polycube is Undecidable
    Erik D. Demaine, Stefan Langerman
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  2. Subspace Uncertainty and Sharp Sampling Thresholds on the Boolean Cube
    Thomas Weinberger
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  3. On the Nazarov-Sklyanin Lax operator for Macdonald functions
    Ryan Mickler
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. Measurable obstructions for unmeasurable colourings
    James Davies
    arXivPreprintarXiv licenceFull textAnalysis & PDEsCombinatorics & discrete mathematicsGeometry & topologyarXiv
  5. A unified approach to infinite log-concavity of combinatorial sequences
    Matthew H. Y. Xie, Candice X. T. Zhang, Philip B. Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Topological inequalities for conic-line arrangements with some prescribed singularities
    Marco Golla, Piotr Pokora
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsGeometry & topologyarXivHAL
  7. Lower bounds for Ramsey numbers: R(6,8)≥ 135 and R(8,10)≥ 345
    Fritz Cremer
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  8. Sharp linear Turán remainders for cycle and edge extremality
    Jifu Lin, Xiaolin Wang, Guangmiao Yu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  9. Constructing pathological symmetric abstract rigidity matroids
    Sean Dewar, Joannes Vermant
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. Further bounds in the polynomial Szemerédi theorem
    Bartłomiej Bychawski, Bartosz Głowacki, Ivan Spyrydonov
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  11. Fractional majority coloring of digraphs: bounds and inapproximability
    Walid Ben-Ameur, Alessandro Maddaloni
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. On the Number of Hamiltonian Cycles in a Boolean Cube
    A. L. Perezhogin, V. N. Potapov
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  13. Covering radius of rank-metric codes via covering lifts and clubs
    Giuseppe Marino, Alessandro Neri, Alessia Vallefuoco
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. Formally Certifying the Vertex Set of a Polyhedron Faster than Informal Enumeration
    Xavier Allamigeon, Yazid Id-Sahra, Pierre-Yves Strub
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsOptimisation & controlarXiv
  15. Breaking linearity in the sum-rank metric: MSRD codes from switched σ-rational normal curves
    Daniele Bartoli, Giovanni Giuseppe Grimaldi, Giovanni Longobardi
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  16. Arithmetic Progressions in Midpoint Colourings
    Tomasz Kościuszko
    arXivPreprintCC BY-SA 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  17. Partition regular linear equations over Sidon sets
    Dev Ranjan Pandey
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  18. Noncrossing combinatorics of quasi-Coxeter elements
    Eugenio Cainelli, Giovanni Paolini, Riccardo Zaccaria
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  19. A counterexample to the Erdős--Sós bipartite-link conjecture
    Tianchi Yang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  20. Cycle structures and parities of linearized permutation polynomials
    Huajun Bian, Shaoshi Chen, Dabin Zheng
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  21. Product approximations for uniform spanning trees and determinantal processes
    András Mészáros, Yuval Peled
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  22. An asymptotic bound for the Bermond--Thomassen Conjecture
    Jørgen Bang-Jensen, Guanghui Wang, Yun Wang
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. A proof of the Berkovich-Dhar conjecture modulo five
    Shutao Jiang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  24. On the local average order of dominating sets
    Tingyun Chen, Weihua He, Hong-Jian Lai +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  25. Spanning Even Linear Forests with Isolated Edges Share the Anti-Ramsey Numbers of Perfect Matchings
    Ali Ghalavand
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv