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

Combinatorics & discrete mathematics

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

Filters
Type
Date
Clear

Latest

4,165 studies

  1. New integer sequence OEIS A392714 counts Wronskians: fast evaluation via late-growing permutations
    Kian C. Shah, Arthemy V. Kiselev
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Random Cayley sum hypergraphs and k-fold sumsets
    Jihyo Chae, Hyunwoo Lee
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  3. Spectral Erdős--Gallai Theorems for the 𝒜α-Tensor of the s-Clique Hypergraph
    Xiaoqi Liu, Haiying Shan
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. The Distance Laplacian and Distance Signless Laplacian Spectra of 𝒞-Graphs
    Santanu Mandal, Pallabi Manna
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  5. The Keevash--Mubayi simplex-cluster conjecture
    Yongjiang Wu, Lihua Feng
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  6. Character expansions and affine Jacobi-Trudi identities
    Ilse Fischer, Moritz Gangl, Álvaro Gutiérrez +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  7. Regular K3-Irregular Graphs of Every Regularity at Least Nine
    Zhanhe Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  8. A symmetric counterexample to Strang's conjecture for bivariate C1 cubic splines on triangulations
    Pratyush Potu
  9. Generating and generalizing MSTD sets through Markov processes
    Frank He, Karol Daniewski, Steven J. Miller
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  10. Cayley graph diameters for fixed cycle types are eventually quasipolynomial
    Andrei Smolensky
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  11. Optimal Bounds on Spanning Tree Embeddings
    Csongor Beke, Vladimir Bošković, Nina Kamčev +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  12. Can one hear the shape of a lattice random walk?
    Pieter Belmans, Sergey Galkin, Swarnava Mukhopadhyay
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsProbabilityarXiv
  13. A cubical approach to homology theories for hypergraphs
    Syed Hadi Ali Zaidi, Samira Sahar Jamil
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  14. Polynomial-in-r bounds for forbidden traces of uniform hypergraphs
    Pei Wu
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  15. On Hypergraph Colorings and Completely Independent Spanning Trees in Chordal Graphs
    Mohammed Lalou, Nader Mbarek, Abdallah Skender +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  16. Hedetniemi's Conjecture for Uncountable Complementary Graphs
    Lajos Soukup
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsLogic & foundationsarXiv
  17. From stylic monoid to Catalan monoid
    Itamar Stein
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  18. An independent computer-assisted proof of the Chen-Raspaud conjecture for k=4
    Marysia Nazarczuk
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  19. Diagonal Specht ideals and their varieties
    Anna Escofet, Cordian Riener, Hugues Verdure
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  20. Unimodality of Forest Independence Polynomials
    Wei Li, Kevin Vallier, Tong Zhang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  21. Topological and Geometric Perspectives on Homomorphism Indistinguishability
    Josse van Dobben de Bruyn, Jérémie Marquès, David E. Roberson +3
    arXivPreprintCC BY-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. A forbidden-induced-subgraph characterization of beautiful graphs
    Henning Wunderlich
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  23. Carlet's cyclic-additive conjecture for the Kasami monomials
    Gábor P. Nagy, Douglas S. McNeil, Attila Vajda
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  24. Encoding level-3 semi-directed phylogenetic networks by quarnets and quinnets
    Niels Holtgrefe, Katharina T. Huber, Leo van Iersel +1
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. Shuffle Squares in Differentiable Words
    Michał Zwierzyński
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv