Skip to content
DraconiticResearch
Search Sources API
210,423 studies31 sourcesUpdated 22 min ago

Combinatorics & discrete mathematics

4,165 studies279 in 7 days1,725 in 30 days

Filters
Type
Date
Clear

Latest

4,165 studies

  1. On partially matchable subspaces in a field extension
    Mohsen Aliabadi, Jozsef Losonczy
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  2. An Exhaustive Census of Main-Diagonal Symmetric Costas Arrays of Orders 37-42
    Bogdan Dumitru, Cristian Budala
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  3. Covering 1024 syndromes with 50 columns
    Stephen Wu
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  4. Harmonic higher weight distributions, Simonis' approach of MacWilliams identity and moments
    Himadri Shekhar Chakraborty, Mehedi Hasan Tanver
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  5. Orientations without transitive arcs for cubic graphs and phylogenetic networks
    Janosch Döcker, Simone Linz
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  6. Determinantal random subgraphs
    Adrien Kassel, Thierry Lévy
    Combinatorial TheoryPeer-reviewedCC BY 4.0Full textCombinatorics & discrete mathematicsMathematical physicsProbabilityHAL
  7. Nonlocality of Cover-Time Changes Under Edge Addition
    Ian Meng Si
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  8. A large neighborhood search matheuristic for the two-dimensional guillotine flexible stock size cutting stock problem
    Khadija Hadj Salem, Alexis Robbes
    European Journal of Operational ResearchPeer-reviewedCC BY-NC-ND 4.0Full textCombinatorics & discrete mathematicsHAL
  9. Universal Plücker coordinates for the Wronski map and positivity in real Schubert calculus
    Steven N. Karp, Kevin Purbhoo
    Journal of the American Mathematical SocietyPeer-reviewedLicence not statedFull text11 citedCombinatorics & discrete mathematicsOpenAlex
  10. Coloring sparse random Cayley graphs
    Nathan Tung
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  11. Building sets, Chow rings, and their Hilbert series
    Christopher Eur, Luis Ferroni, Jacob P. Matherne +2
    Selecta MathematicaPeer-reviewedCC BYFull text13 citedCombinatorics & discrete mathematicsOpenAlex
  12. Decision-focused predictions via pessimistic bilevel optimization: complexity and algorithms
    Víctor Bucarey López, Sophia Calderón, Gonzalo Muñoz +1
    Computational Optimization and ApplicationsPeer-reviewedLicence not statedCombinatorics & discrete mathematicsHAL
  13. Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
    Joe Sawada, Jackson Sears, A. Trautrim +1
    Discrete Applied MathematicsPeer-reviewedLicence not statedFull text6 citedCombinatorics & discrete mathematicsOpenAlex
  14. Prime-order complements in planar graph Jacobians
    Anass Nifa
    HALPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsHAL
  15. Sequences of Bivariate Bicycle Codes from Covering Graphs
    Anonymous
    PRX QuantumPeer-reviewedCC BY18 citedCombinatorics & discrete mathematicsOpenAlex
  16. Finite-n Estimate of Dedekind Numbers by Layer-Ratio Monte Carlo
    Tian-Shun Chen, Hao Feng, Haozhe Wang +2
  17. Erdös–Pósa property of cycles that are far apart
    Vida Dujmović, Gwenaël Joret, Piotr Micek +1
    Journal of the London Mathematical SocietyPeer-reviewedLicence not statedFull text10 citedCombinatorics & discrete mathematicsOpenAlex
  18. Skew shapes, Ehrhart positivity, and beyond
    Luis Ferroni, Alejandro H. Morales, Greta Panova
    Proceedings of the London Mathematical SocietyPeer-reviewedCC BY13 citedCombinatorics & discrete mathematicsOpenAlex
  19. Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
    Michelle Delcourt, Luke Postle
    Journal of the London Mathematical SocietyPeer-reviewedCC BY-NC-ND46 citedCombinatorics & discrete mathematicsOpenAlex
  20. Machine Learning-Enhanced Tabu Search for Tactical Wireless Network Design
    Wissem Ahmed Zaid, Alain Hertz, Defeng Liu
    arXivPreprintCC0Full textCombinatorics & discrete mathematicsarXiv
  21. Galois groups of Apéry-like series modulo primes
    Xavier Caruso, Florian Fürnsinn, Daniel Vargas Montoya +1
    Bulletin of the Australian Mathematical SocietyPeer-reviewedLicence not statedAlgebra & number theoryCombinatorics & discrete mathematicsHAL
  22. GORENSTEIN FANO POLYTOPES ARISING FROM ORDER POLYTOPES AND CHAIN POLYTOPES
    Takayuki Hibi, Kazunori Matsuda, Akiyoshi Tsuchiya
    Journal of Commutative AlgebraPeer-reviewedLicence not statedFull text13 citedCombinatorics & discrete mathematicsOpenAlex
  23. Pancyclicity of highly connected graphs
    Shoham Letzter
    Journal of the European Mathematical SocietyPeer-reviewedCC BY10 citedCombinatorics & discrete mathematicsOpenAlex
  24. Support-Graph Reachability and Matrix-Composition Obstructions
    WuJun Chen
    Zenodo (CERN European Organization for Nuclear Research)PreprintCC BY7 citedCombinatorics & discrete mathematicsOpenAlex
  25. Nuancing the uniqueness of q-rationals
    Perrine Jouteur, Olga Paris-Romaskevich, Alexander Thomas