Showing 121 - 140 results of 4,674 for search '"conjectures"', query time: 0.09s Refine Results
  1. 121

    Patterns of primes in the Sato–Tate conjecture by Gillman, Nate, Kural, Michael, Pascadi, Alexandru, Peng, Junyao, Sah, Ashwin

    Published 2021
    “…Abstract Fix a non-CM elliptic curve $$E/\mathbb {Q}$$E/Q, and let $$a_E(p) = p + 1 - \#E(\mathbb {F}_p)$$aE(p)=p+1-#E(Fp) denote the trace of Frobenius at p. The Sato–Tate conjecture gives the limiting distribution $$\mu _{ST}$$μST of $$a_E(p)/(2\sqrt{p})$$aE(p)/(2p) within $$[-1, 1]$$[-1,1]. …”
    Get full text
    Article
  2. 122
  3. 123

    Endoscopic decompositions and the Hausel–Thaddeus conjecture by Maulik, Davesh, Shen, Junliang

    Published 2022
    “…This provides a complete description of the cohomology of the moduli space of stable <jats:inline-formula> <jats:alternatives> <jats:inline-graphic xmlns:xlink="http://www.w3.org/1999/xlink" mime-subtype="png" xlink:href="S205050862100007X_inline3.png" /> <jats:tex-math>$\mathrm {SL}_n$</jats:tex-math> </jats:alternatives> </jats:inline-formula>-Higgs bundles in terms of the tautological classes, and gives a new proof of the Hausel–Thaddeus conjecture, which was also proven recently by Gröchenig, Wyss and Ziegler via <jats:italic>p</jats:italic>-adic integration.…”
    Get full text
    Article
  4. 124
  5. 125
  6. 126
  7. 127
  8. 128

    On the multiple unicast network coding conjecture by Langberg, Michael, Medard, Muriel

    Published 2010
    “…In this paper, we study the multiple unicast network communication problem on undirected graphs. It has been conjectured by Li and Li [CISS 2004] that, for the problem at hand, the use of network coding does not allow any advantage over standard routing. …”
    Get full text
    Get full text
    Article
  9. 129
  10. 130

    How the Upper Bound Conjecture Was Proved by Stanley, Richard P.

    Published 2015
    “…We give a short history of how the Upper Bound Conjecture for Spheres was proved.…”
    Get full text
    Get full text
    Article
  11. 131

    The Kierstead's Conjecture and limitwise monotonic functions by Wu, Guohua, Zubkov, Maxim

    Published 2020
    “…In this paper, we prove Kierstead's conjecture for linear orders whose order types are ∑q∈QF(q), where F is an extended 0′-limitwise monotonic function, i.e. …”
    Get full text
    Journal Article
  12. 132

    Williamson matrices and a conjecture of Ito's by Bernhard, Schmidt.

    Published 2009
    “…Finally, we verify Ito‘s conjecture for all t\le 46.…”
    Get full text
    Get full text
    Journal Article
  13. 133

    A conjecture of Beauville and Catanese revisited by Pink, R, Roessler, D

    Published 2004
    “…Furthermore, we prove partial analogs of the conjecture of Beauville and Catanese in positive characteristic.…”
    Journal article
  14. 134

    On Thurston's Euler class-one conjecture by Yazdi, M

    Published 2020
    “…In 1976, Thurston proved that taut foliations on closed hyperbolic 3-manifolds have Euler class of norm at most one, and conjectured that conversely, any integral second cohomology class with norm equal to one is the Euler class of a taut foliation. …”
    Journal article
  15. 135

    Kummer's conjecture for cubic Gauss sums by Heath-Brown, D

    Published 2000
    “…This improves on the estimate established by Heath-Brown and Patterson in demonstrating the uniform distribution of the cubic Gauss sums around the unit circle. When $l=0$ it is conjectured that the above sum is asymptotically of order $X^{5/6}$, so that the upper bound is essentially best possible. …”
    Journal article
  16. 136

    Swampland conjectures and infinite flop chains by Brodie, CR, Constantin, A, Lukas, A, Ruehle, F

    Published 2021
    “…We investigate swampland conjectures for quantum gravity in the context of M-theory compactified on Calabi-Yau threefolds which admit infinite sequences of flops. …”
    Journal article
  17. 137
  18. 138

    The randomized k-server conjecture is false! by Bubeck, S, Coester, C, Rabani, Y

    Published 2023
    “…We prove a few new lower bounds on the randomized competitive ratio for the k-server problem and other related problems, resolving some long-standing conjectures. In particular, for metrical task systems (MTS) we asympotically settle the competitive ratio and obtain the first improvement to an existential lower bound since the introduction of the model 35 years ago (in 1987). …”
    Conference item
  19. 139

    A topological variation of the reconstruction conjecture by Pitz, M, Suabedissen, R

    Published 2016
    “…This paper investigates topological reconstruction, related to the reconstruction conjecture in graph theory. We ask whether the homeomorphism types of subspaces of a space X which are obtained by deleting singletons determine X uniquely up to homeomorphism. …”
    Journal article
  20. 140

    On Hrushovski’s proof of the Manin-Mumford conjecture by Pink, R, Rossler, D

    Published 2006
    “…The Manin-Mumford conjecture in characteristic zero was first proved by Raynaud. …”
    Conference item