Skip to content
DraconiticResearch
Search Sources API
220,795 studies31 sourcesUpdated 18 min ago

Mathematics

38,329 studies2,609 in 7 days15,187 in 30 days

Filters
Type
Date
Clear

Latest

38,329 studies

  1. Recovery of Rough Sources in the Inverse Monge-Ampère Problem
    Gunther Uhlmann, Philipp Zimmermann
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  2. Anchored multiple testing: a transparent use of e-closure to improve FDR procedures
    Aaditya Ramdas
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  3. Long intervals of consecutive composite values of polynomials
    Artyom Radomskii
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. A Converse to the Archimedes Sphere Theorem
    Mohammad Ghomi, Ralph Howard, Mijia Lai
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  5. Refinements on the Restriction and Kakeya problems range in ℝ4
    Tiago Moreira
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsCombinatorics & discrete mathematicsarXiv
  6. GPU-Accelerated Bregman Douglas-Rachford Splitting for Discrete Optimal Transport
    Yifan Xu, Shiqian Ma
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  7. A gluing construction of Z-extremal Kähler metrics and new examples of Bismut Hermitian-Einstein $3$-folds
    Vestislav Apostolov, Abdellah Lahdili, Kuan-Hui Lee +1
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  8. Constraints on admissible behavior of GMRES applied to tridiagonal Toeplitz systems
    Fei Chen, Kirk M. Soodhalter
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  9. Arc Kayles is PSPACE-complete
    Édouard Bonnet
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  10. A proof of the Cartan-Hadamard conjecture for small volumes under a Ricci curvature lower bound
    Marcos Agnoletto, Márcio Fabiano Da Silva, Stefano Nardulli +1
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  11. Generalized Bratteli diagrams without probability tail invariant measures
    Andrew Barsky, Sergey Bezuglyi
    arXivPreprintCC BY 4.0Full textDynamical systemsProbabilityarXiv
  12. Existence of regular sets in circulant quartic graphs: a complete characterization
    A. Abdollahi, J. Bagherian, F. Jafari +3
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  13. The list size of random linear and LDPC codes at capacity
    Shashwat Silas
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  14. The LQ Digital Mode Family: Protocol Architecture and Reference Specification for Weak-Signal Communications
    Luis Quesada
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  15. Total positivity in coordinate algebras
    G. Lusztig
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  16. Interior curvature estimates for convex solutions of a prescribed curvature quotient equation
    Bin Wang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  17. Notes on the Kuznetsov component of cubic sevenfolds
    Peize Liu
    arXivPreprintCC BY-SA 4.0Full textAlgebra & number theoryarXiv
  18. Analysis and structure-preserving discretization of the Heat-GLM system
    Firas Dhaouadi, Laura Río-Martín, Michael Dumbser
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  19. A study on Type-2 isomorphic circulant graphs. Part 8: Isomorphism series, digraph and graph of Cn(R)
    V. Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  20. Anti-Zariski pairs
    Peng Ren, Eugenii Shustin
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  21. A Study on Type-2 Isomorphic Circulant Graphs: Part 7: C432(R), C6750(S) - each has 2 types of Type-2 isomorphic circulant graphs
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  22. A study on Type-2 isomorphic circulant graphs. PART 9: Computer programs to show Type-1 & -2 isomorphic circulant graphs
    Vilfred Kamalappan, Wilson Peraprakash
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  23. A study on Type-2 isomorphic circulant graphs. Part 6: Abelian groups (T2n,m(Cn(R)), ∘) and (Vn,m(Cn(R)), ∘)
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  24. A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs C54(R)
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  25. A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96
    Vilfred Kamalappan
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv