Daftar masalah matematika yang belum terpecahkan: Perbedaan antara revisi

Dari Wikipedia bahasa Indonesia, ensiklopedia bebas
Konten dihapus Konten ditambahkan
InternetArchiveBot (bicara | kontrib)
Rescuing 8 sources and tagging 0 as dead.) #IABot (v2.0.8
Dedhert.Jr (bicara | kontrib)
Hanya menambahkan informasi dari versi bahasa Inggris ke Indonesia. Namun, informasi yang diambil tidak cukup dikarenakan waktu yang terbatas sehingga ada beberapa bagian artikel yang belum diterjemahkan
Tag: menambah tag nowiki VisualEditor
Baris 119: Baris 119:


=== [[Analisis matematis|Analisis]] ===
=== [[Analisis matematis|Analisis]] ===
[[Berkas:Gamma-area.svg|pra=https://id.wikipedia.org/wiki/Berkas:Gamma-area.svg|jmpl|Luas dari daerah berwarna biru konvergen dengan [[konstanta Euler–Mascheroni]], yang dapat atau tidak dapat menjadi sebuah bilangan rasional.]]
[[Berkas:Gamma-area.svg|jmpl|Luas dari daerah berwarna biru konvergen dengan [[konstanta Euler–Mascheroni]], yang dapat atau tidak dapat menjadi sebuah bilangan rasional.]]


* [[Empat konjektur eksponensial]] pada transenden setidaknya salah satu dari empat eksponensial gabungan irasional<ref name="waldschmidt">{{citation|pages=14, 16|url=https://books.google.com/books?id=Wrj0CAAAQBAJ&pg=PA14|title=Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables|first=Michel|last=Waldschmidt|publisher=Springer|year=2013|isbn=9783662115695}}</ref>
* [[Empat konjektur eksponensial]] pada transenden setidaknya salah satu dari empat eksponensial gabungan irasional<ref name="waldschmidt">{{citation|pages=14, 16|url=https://books.google.com/books?id=Wrj0CAAAQBAJ&pg=PA14|title=Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables|first=Michel|last=Waldschmidt|publisher=Springer|year=2013|isbn=9783662115695}}</ref>
Baris 227: Baris 227:
* [[Konjektu Yau pada eigenniiai pertama]]
* [[Konjektu Yau pada eigenniiai pertama]]
* [[Masalah kurva tertutup]]: Carilah syarat perlu dan cukup (eksplisit) yang menentukan ketika, diberikan dua fungsi berkalai dengan periode yang sama, kurva integral tertutup.<ref>{{citation|last=Barros|first=Manuel|jstor=2162098|journal=[[Proceedings of the American Mathematical Society]]|pages=1503–1509|title=General Helices and a Theorem of Lancret|volume=125|issue=5|year=1997|doi=10.1090/S0002-9939-97-03692-7|doi-access=free}}</ref>
* [[Masalah kurva tertutup]]: Carilah syarat perlu dan cukup (eksplisit) yang menentukan ketika, diberikan dua fungsi berkalai dengan periode yang sama, kurva integral tertutup.<ref>{{citation|last=Barros|first=Manuel|jstor=2162098|journal=[[Proceedings of the American Mathematical Society]]|pages=1503–1509|title=General Helices and a Theorem of Lancret|volume=125|issue=5|year=1997|doi=10.1090/S0002-9939-97-03692-7|doi-access=free}}</ref>
==== [[Geometri diskret]] ====
[[Image:Kissing-3d.png|thumb|right|250px|IDalam tiga dimensi, [[bilangan ciuman]]<nowiki/>nya adalah 12, karena 12 bola satuan taktumpang tindih dapat ditaruh menjadi kontak dengan sebuah bola satuan pusat. (Disini, pusat-pusat bola luar membentuk puncak [[Ikosahedron reguler|ikosahedron regular]].) Bilangan ciuman hanya dikenal persis dalam dimensi 1, 2, 3, 4, 8 dan 24.]]
* Menyelesaikan [[masalah akhir yang bahagia]] untuk sembarang <math>n</math><ref>{{citation
| last1 = Morris | first1 = Walter D.
| last2 = Soltan | first2 = Valeriu
| doi = 10.1090/S0273-0979-00-00877-6
| issue = 4
| journal = Bull. Amer. Math. Soc.
| mr = 1779413
| pages = 437–458
| title = The Erdős-Szekeres problem on points in convex position—a survey
| volume = 37
| year = 2000| doi-access = free
}}; {{citation
| last = Suk | first = Andrew
| arxiv = 1604.08657
| doi = 10.1090/jams/869
| journal = J. Amer. Math. Soc.
| title = On the Erdős–Szekeres convex polygon problem
| year = 2016
| volume=30
| issue = 4
| pages=1047–1053| s2cid = 15732134
}}</ref>
* Mencari batasan atas dan bawah yang cocok untuk [[Himpunan-k (geometri)|himpunan-''k'']] dan membagi garis<ref>{{citation
| last = Dey | first = Tamal K. | author-link = Tamal Dey
| doi = 10.1007/PL00009354
| journal = Discrete Comput. Geom.
| mr = 1608878
| pages = 373–382
| title = Improved bounds for planar ''k''-sets and related problems
| volume = 19
| issue = 3
| year = 1998| doi-access = free
}}; {{citation
| last = Tóth | first = Gábor
| doi = 10.1007/s004540010022
| issue = 2
| journal = Discrete Comput. Geom.
| mr = 1843435
| pages = 187–194
| title = Point sets with many ''k''-sets
| volume = 26
| year = 2001| doi-access = free
}}.</ref>
* [[Hadwiger conjecture (combinatorial geometry)|Konjektur Hadwiger]] pada peliputan benda cembung ''n''-dimensi dengan paling banyak <math>2^n</math> salinan yang lebih kecil?<ref>{{citation|title=Results and Problems in Combinatorial Geometry|first1=V.|last1=Boltjansky|first2=I.|last2=Gohberg|publisher=Cambridge University Press|year=1985|contribution=11. Hadwiger's Conjecture|pages=44–46}}.</ref>
* [[Masalah segitiga Kobon]] pada segitiga dalam garis urutan garis<ref>{{MathWorld|urlname=KobonTriangle|title=Kobon Triangle}}</ref>
* [[Masalah Kusner]] yang paling banyak <math>2d</math> titik dapat berjarak sama dalam ruang <math>L^1</math><ref>{{citation
| last = Guy | first = Richard K. | authorlink = Richard K. Guy
| issue = 3
| journal = [[American Mathematical Monthly]]
| mr = 1540158
| pages = 196–200
| title = An olla-podrida of open problems, often oddly posed
| jstor = 2975549
| volume = 90
| year = 1983
| doi = 10.2307/2975549 }}</ref>
* [[Masalah McMullen]] pada himpunan transformasi dengan cara proyeksi dari dua titik menjadi [[posisi cekung]]<ref>{{citation
| last = Matoušek | first = Jiří | author-link = Jiří Matoušek (mathematician)
| doi = 10.1007/978-1-4613-0039-7
| isbn = 978-0-387-95373-1
| mr = 1899299
| page = 206
| publisher = Springer-Verlag, New York
| series = Graduate Texts in Mathematics
| title = Lectures on discrete geometry
| volume = 212
| year = 2002}}</ref>
* [[Pengepakan penyanggah berkaki tiga]]<ref>{{citation|last1=Aronov|first1=Boris|author1-link=Boris Aronov|last2=Dujmović|first2=Vida|last3=Morin|first3=Pat|author3-link= Pat Morin |last4=Ooms|first4=Aurélien|last5=Schultz Xavier da Silveira|first5=Luís Fernando|issue=1|journal=[[Electronic Journal of Combinatorics]]|page=P1.8|title=More Turán-type theorems for triangles in convex point sets|url=https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p8|volume=26|year=2019|bibcode=2017arXiv170610193A|arxiv=1706.10193|access-date=2019-02-18|archive-url=https://web.archive.org/web/20190218082023/https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p8|archive-date=2019-02-18|url-status=live|doi-access=free|doi=10.37236/7224}}</ref>
* [[Grafik jarak satuan#Menghitung jarak satuan|Berapa banyak jarak satuan]] yang dapat ditentukan oleh sebuah himpunan dari <math>n</math> titik dalam bidang Euclides?<ref>{{citation
| last1 = Brass | first1 = Peter
| last2 = Moser | first2 = William
| last3 = Pach | first3 = János
| contribution = 5.1 The Maximum Number of Unit Distances in the Plane
| isbn = 978-0-387-23815-9
| mr = 2163782
| pages = 183–190
| publisher = Springer, New York
| title = Research problems in discrete geometry
| year = 2005}}</ref>
*[[Masalah hutan buram]]
*Meningkatkan batas bawah dan atas untuk [[masalah segitiga Heilbronn]].
* [[Konjektur 3^d Kalai]] pada jumlah kemungkinan terkecil dari sisi [[politop]] [[Titik simetri|simetrik terpusat]].<ref name="kalai">{{citation
| last = Kalai | first = Gil | author-link = Gil Kalai
| doi = 10.1007/BF01788696
| issue = 1
| journal = [[Graphs and Combinatorics]]
| mr = 1554357
| pages = 389–391
| title = The number of faces of centrally-symmetric polytopes
| volume = 5
| year = 1989| s2cid = 8917264 }}.</ref>


=== Teori Graf ===
====[[Geometri Euklides]]====
* [[Konjektur Atiyah pada konfigurasi]]<ref>{{Citation | last1=Atiyah | first1=Michael | author1-link=Michael Atiyah | title=Configurations of points | doi=10.1098/rsta.2001.0840 | mr=1853626 | year=2001 | journal= Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences| issn=1364-503X | volume=359 | issue=1784 | pages=1375–1387| bibcode=2001RSPTA.359.1375A | s2cid=55833332 }}</ref>
* [[Belmann tersesat dalam sebuah hutan]] – carilah jalan terpendek yang dijamin mendekati batasnya dari sebuah bentuk yang diberikan, dimulai pada titik yang takdiketahui dari bentuk dengna orientasi yang takdiketahui<ref>{{citation|last1=Finch|first1=S. R.|last2=Wetzel|first2=J. E.|title=Lost in a forest|volume=11|issue=8|year=2004|journal=[[American Mathematical Monthly]]|pages=645–654|mr=2091541|doi=10.2307/4145038|jstor=4145038}}</ref>
* Gelanggang Borromean — apakah tiga kurva ruang taktersimpul, bukan semua tiga lingkaran, yang tidak dapat disusun untuk membentuk tautan ini?<ref>{{citation
| last = Howards | first = Hugh Nelson
| arxiv = 1406.3370
| doi = 10.1142/S0218216513500831
| issue = 14
| journal = Journal of Knot Theory and Its Ramifications
| mr = 3190121
| page = 1350083, 15
| title = Forming the Borromean rings out of arbitrary polygonal unknots
| volume = 22
| year = 2013| s2cid = 119674622
}}</ref>
* Masalah Danzer dan masalah lalat mati Conway – apakah [[himpunan Danzer]] dari kerapatan yang dibatasi atau pemisahan yang dibatasi ada?<ref>{{citation|last1=Solomon|first1=Yaar|last2=Weiss|first2=Barak|arxiv=1406.3807|doi=10.24033/asens.2303|issue=5|journal=Annales Scientifiques de l'École Normale Supérieure|mr=3581810|pages=1053–1074|title=Dense forests and Danzer sets|volume=49|year=2016|s2cid=672315}}; {{citation|last=Conway|first=John H.|author-link=John Horton Conway|access-date=2019-02-12|publisher=[[On-Line Encyclopedia of Integer Sequences]]|title=Five $1,000 Problems (Update 2017)|url=https://oeis.org/A248380/a248380.pdf|archive-url=https://web.archive.org/web/20190213123825/https://oeis.org/A248380/a248380.pdf|archive-date=2019-02-13|url-status=live}}</ref>
* Pembedahan ke ortoskema – apakah mungkin untuk is it possible untuk [[Simpleks|simpleks-simpleks]] dari setiap dimensi?<ref>{{citation|last1=Brandts|first1=Jan|last2=Korotov|first2=Sergey|last3=Křížek|first3=Michal|last4=Šolc|first4=Jakub|doi=10.1137/060669073|issue=2|journal=SIAM Review|mr=2505583|pages=317–335|title=On nonobtuse simplicial partitions|volume=51|year=2009|url=https://pure.uva.nl/ws/files/836396/73198_315330.pdf|bibcode=2009SIAMR..51..317B|access-date=2018-11-22|archive-url=https://web.archive.org/web/20181104211116/https://pure.uva.nl/ws/files/836396/73198_315330.pdf|archive-date=2018-11-04|url-status=live}}. See in particular Conjecture 23, p. 327.</ref>
* {{not a typo|[[Masalah einstein]]}} – apakah terdapat sebuah bentuk dua dimensi yang membentuk [[prototile]] untuk sebuah [[pengubinan aperiodik]], tapi bukan untuk suatu pengubinan periodik?<ref>{{citation|last1=Socolar|first1=Joshua E. S.|last2=Taylor|first2=Joan M.|arxiv=1009.1419|doi=10.1007/s00283-011-9255-y|issue=1|journal=The Mathematical Intelligencer|mr=2902144|pages=18–28|title=Forcing nonperiodicity with a single tile|volume=34|year=2012|s2cid=10747746}}</ref>
* [[Konjektur Falconer]] bahwa himpunan dimensi Hausdorff lebih besar daripada <math>d/2</math> di <math>\mathbb{R}^d</math> harus memiliki sebuah himpunan jarak [[ukuran Lebesgue]]<ref>{{citation|last1=Arutyunyants|first1=G.|last2=Iosevich|first2=A.|editor-last=Pach|editor-first=János|editor-link=János Pach|contribution=Falconer conjecture, spherical averages and discrete analogs|doi=10.1090/conm/342/06127|mr=2065249|pages=15–24|publisher=Amer. Math. Soc., Providence, RI|series=Contemp. Math.|title=Towards a Theory of Geometric Graphs|volume=342|year=2004|isbn=9780821834848|doi-access=free}}</ref>
* [[Masalah persegi dalam]], juga dikenal sebagai [[konjektur Toeplitz]] – apakah setiap [[kurva Jordan]] memilik sebuah persegi dalam?<ref name="matschke">{{citation|last=Matschke|first=Benjamin|date=2014|title=A survey on the square peg problem|journal=[[Notices of the American Mathematical Society]]|volume=61|issue=4|pages=346–352|doi=10.1090/noti1100|doi-access=free}}</ref>
* [[Konjektur Kakeya]] – apakah himpunan <math>n</math>-dimensi yang berisi sebuah ruas garis satuan dalam setiap arah selalu memiliki [[dimensi Hausdorff]] dan [[dimensi Minkowski]] sama dengan <math>n</math>?<ref>{{citation|last1=Katz|first1=Nets|author1-link=Nets Katz|last2=Tao|first2=Terence|author2-link=Terence Tao|department=Proceedings of the 6th International Conference on Harmonic Analysis and Partial Differential Equations (El Escorial, 2000)|doi=10.5565/PUBLMAT_Esco02_07|issue=Vol. Extra|journal=Publicacions Matemàtiques|mr=1964819|pages=161–179|title=Recent progress on the Kakeya conjecture|year=2002|citeseerx=10.1.1.241.5335|s2cid=77088}}</ref>
* Masalah Kelvin pada partisi luas permukaan minimum dari ruang ke sel volume yang sama, dan and the optimalitas dari [[struktur Weaire–Phelan]] sebagai sebuah penyelesaian untuk masalah Kelvin<ref>{{citation|title=The Kelvin Problem|editor-first=Denis|editor-last=Weaire|editor-link=Denis Weaire|publisher=CRC Press|year=1997|isbn=9780748406326|page=1|url=https://books.google.com/books?id=otokU4KQnXIC&pg=PA1}}</ref>
* [[Masalah peliputan semesta Lebesgue]] pada bentuk cembung luas minimum dalam bidang yang dapat meliputi suatu bentuk diameter<ref>{{citation|last1=Brass|first1=Peter|last2=Moser|first2=William|last3=Pach|first3=János|location=New York|mr=2163782|page=457|publisher=Springer|title=Research problems in discrete geometry|url=https://books.google.com/books?id=cT7TB20y3A8C&pg=PA457|year=2005|isbn=9780387299297}}</ref>
* [[Konjektur Mahler]] pada darab dari volume [[benda cembung]] [[Titik simetri|simetrik terpusat]] dan [[Himpunan polar|polar]]<nowiki/>nya.<ref>{{Cite journal|last1=Mahler|first1=Kurt|title=Ein Minimalproblem für konvexe Polygone|journal=Mathematica (Zutphen) B|pages=118–127|year=1939}}</ref>
* [[Masalah cacing Moser]] – berapakah luasterkecil dari sebuah bentuk yang dapat meliputi setiap kurva panjang satuan dalam bidang?<ref>{{citation|last1=Norwood|first1=Rick|author1-link=Rick Norwood|last2=Poole|first2=George|last3=Laidacker|first3=Michael|doi=10.1007/BF02187832|issue=2|journal=[[Discrete and Computational Geometry]]|mr=1139077|pages=153–162|title=The worm problem of Leo Moser|volume=7|year=1992|doi-access=free}}</ref>
* [[Masalah sofa bergerak]] – berapa luas terbesar dari sebuah bentuk yang dapat diarahkan melalui sebuah lebar satuan koridor berbentuk huruf L?<ref>{{citation|last=Wagner|first=Neal R.|date=1976|title=The Sofa Problem|journal=The American Mathematical Monthly|doi=10.2307/2977022|jstor=2977022|volume=83|issue=3|pages=188–189|url=http://www.cs.utsa.edu/~wagner/pubs/corner/corner_final.pdf|access-date=2014-05-14|archive-url=https://web.archive.org/web/20150420160001/http://www.cs.utsa.edu/~wagner/pubs/corner/corner_final.pdf|archive-date=2015-04-20|url-status=live}}</ref>
* [[Masalah Shephard|Masalah Shephard (atau konjektur Dürer)]] – apakah setiap [[polihedron cembung]] memiliki sebuah [[Jaring (polihedron)|jaring]], atau pembukaan lipatan tepi yang sederhana?<ref>{{citation|last1=Demaine|first1=Erik D.|author1-link=Erik Demaine|last2=O'Rourke|first2=Joseph|author2-link=Joseph O'Rourke (professor)|date=2007|title=Geometric Folding Algorithms: Linkages, Origami, Polyhedra|title-link=Geometric Folding Algorithms|publisher=Cambridge University Press|contribution=Chapter 22. Edge Unfolding of Polyhedra|pages=306–338}}</ref><ref>{{Cite journal|last=Ghomi|first=Mohammad|date=2018-01-01|title=D &quot;urer&apos;s Unfolding Problem for Convex Polyhedra|journal=Notices of the American Mathematical Society|volume=65|issue=1|pages=25–27|doi=10.1090/noti1609|issn=0002-9920|doi-access=free}}</ref>
* [[Masalah Thomson]] – berapa konfigurasi energi minimum dari partikel pengelakan satu sama lain <math>n</math> pada sebuah bola satuan?<ref>{{citation|last=Whyte|first=L. L.|doi=10.2307/2306764|journal=The American Mathematical Monthly|mr=0050303|pages=606–611|title=Unique arrangements of points on a sphere|volume=59|issue=9|year=1952|jstor=2306764}}</ref>
* [[Seragam 5 politop]] – carilah dan golongkan himpunan sempurna dari bentuk-bentuk ini<ref>{{citation|url=http://www.openproblemgarden.org/op/convex_uniform_5_polytopes|work=Open Problem Garden|title=Convex uniform 5-polytopes|access-date=2016-10-04|date=May 24, 2012|author=ACW|archive-url=https://web.archive.org/web/20161005164840/http://www.openproblemgarden.org/op/convex_uniform_5_polytopes|archive-date=October 5, 2016|url-status=live}}.</ref>


=== [[Teori graf]] ===
==== Paths and cycles in graphs ====
* [[Barnette's conjecture]] that every cubic bipartite three-connected planar graph has a Hamiltonian cycle<ref>{{citation
| last = Florek | first = Jan
| doi = 10.1016/j.disc.2010.01.018
| issue = 10–11
| journal = Discrete Mathematics
| mr = 2601261
| pages = 1531–1535
| title = On Barnette's conjecture
| volume = 310
| year = 2010}}.</ref>
* [[Graph toughness|Chvátal's toughness conjecture]], that there is a number {{mvar|t}} such that every {{mvar|t}}-tough graph is Hamiltonian<ref>{{citation
| last1 = Broersma | first1 = Hajo
| last2 = Patel | first2 = Viresh
| last3 = Pyatkin | first3 = Artem
| doi = 10.1002/jgt.21734
| issue = 3
| journal = Journal of Graph Theory
| mr = 3153119
| pages = 244–255
| title = On toughness and Hamiltonicity of $2K_2$-free graphs
| volume = 75
| year = 2014}}</ref>
* The [[cycle double cover conjecture]] that every bridgeless graph has a family of cycles that includes each edge twice<ref>{{citation
| last = Jaeger | first = F.
| contribution = A survey of the cycle double cover conjecture
| doi = 10.1016/S0304-0208(08)72993-1
| pages = 1–12
| series = North-Holland Mathematics Studies
| title = Annals of Discrete Mathematics 27 – Cycles in Graphs
| volume = 27
| year = 1985| isbn = 9780444878038
}}.</ref>
* The [[Erdős–Gyárfás conjecture]] on cycles with power-of-two lengths in cubic graphs<ref>{{citation|title=Erdös-Gyárfás conjecture for cubic planar graphs|first1=Christopher Carl|last1=Heckman|first2=Roi|last2=Krakovski|volume=20|issue=2|year=2013|at=P7|journal=Electronic Journal of Combinatorics|doi-access=free|doi=10.37236/3252}}.</ref>
* The [[linear arboricity]] conjecture on decomposing graphs into disjoint unions of paths according to their maximum degree<ref>{{citation
| last1 = Akiyama | first1 = Jin | author1-link = Jin Akiyama
| last2 = Exoo | first2 = Geoffrey
| last3 = Harary | first3 = Frank
| doi = 10.1002/net.3230110108
| issue = 1
| journal = Networks
| mr = 608921
| pages = 69–72
| title = Covering and packing in graphs. IV. Linear arboricity
| volume = 11
| year = 1981}}.</ref>
* The [[Lovász conjecture]] on Hamiltonian paths in symmetric graphs<ref>[[László Babai|L. Babai]], [http://www.cs.uchicago.edu/research/publications/techreports/TR-94-10 Automorphism groups, isomorphism, reconstruction] {{Webarchive|url=https://web.archive.org/web/20070613201449/http://www.cs.uchicago.edu/research/publications/techreports/TR-94-10 |date=2007-06-13 }}, in ''Handbook of Combinatorics'', Vol. 2, Elsevier, 1996, 1447–1540.</ref>
* The [[Oberwolfach problem]] on which 2-regular graphs have the property that a complete graph on the same number of vertices can be decomposed into edge-disjoint copies of the given graph.<ref>{{citation
| last1 = Lenz | first1 = Hanfried
| last2 = Ringel | first2 = Gerhard
| doi = 10.1016/0012-365X(91)90416-Y
| issue = 1–3
| journal = Discrete Mathematics
| mr = 1140782
| pages = 3–16
| title = A brief review on Egmont Köhler's mathematical work
| volume = 97
| year = 1991}}</ref>
* [[Szymanski's conjecture]]

==== Graph coloring and labeling ====
[[Image:Erdős–Faber–Lovász conjecture.svg|thumb|upright=1.2|An instance of the Erdős–Faber–Lovász conjecture: a graph formed from four cliques of four vertices each, any two of which intersect in a single vertex, can be four-colored.]]
* [[Cereceda's conjecture]] on the diameter of the space of colorings of degenerate graphs<ref>{{citation
| last1 = Bousquet | first1 = Nicolas
| last2 = Bartier | first2 = Valentin
| editor1-last = Bender | editor1-first = Michael A.
| editor2-last = Svensson | editor2-first = Ola
| editor3-last = Herman | editor3-first = Grzegorz
| contribution = Linear Transformations Between Colorings in Chordal Graphs
| doi = 10.4230/LIPIcs.ESA.2019.24
| pages = 24:1–24:15
| publisher = Schloss Dagstuhl - Leibniz-Zentrum für Informatik
| series = LIPIcs
| title = 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany
| volume = 144
| year = 2019| s2cid = 195791634
}}</ref>
* The [[Erdős–Faber–Lovász conjecture]] on coloring unions of cliques<ref>{{citation
| last1 = Chung | first1 = Fan | author-link1 = Fan Chung
| last2 = Graham | first2 = Ron | author-link2 = Ronald Graham
| title = Erdős on Graphs: His Legacy of Unsolved Problems
| year = 1998
| publisher = A K Peters
| pages = 97–99}}.</ref>
* The [[Gyárfás–Sumner conjecture]] on χ-boundedness of graphs with a forbidden induced tree<ref>{{citation
| last1 = Chudnovsky | first1 = Maria | author1-link = Maria Chudnovsky
| last2 = Seymour | first2 = Paul | author2-link = Paul Seymour (mathematician)
| doi = 10.1016/j.jctb.2013.11.002
| journal = [[Journal of Combinatorial Theory]]
| mr = 3171779
| pages = 11–16
| series = Series B
| title = Extending the Gyárfás-Sumner conjecture
| volume = 105
| year = 2014| doi-access = free
}}</ref>
* The [[Hadwiger conjecture (graph theory)|Hadwiger conjecture]] relating coloring to clique minors<ref>{{citation
| last = Toft | first = Bjarne
| journal = Congressus Numerantium
| mr = 1411244
| pages = 249–283
| title = A survey of Hadwiger's conjecture
| volume = 115
| year = 1996}}.</ref>
* The [[Hadwiger–Nelson problem]] on the chromatic number of unit distance graphs<ref>{{citation
| last1 = Croft | first1 = Hallard T.
| last2 = Falconer | first2 = Kenneth J.
| last3 = Guy | first3 = Richard K. | author-link3 = Richard K. Guy
| title = Unsolved Problems in Geometry
| publisher = Springer-Verlag
| year = 1991}}, Problem G10.</ref>
* [[Petersen graph#Petersen coloring conjecture|Jaeger's Petersen-coloring conjecture]] that every bridgeless cubic graph has a cycle-continuous mapping to the Petersen graph<ref>{{citation
| last1 = Hägglund
| first1 = Jonas
| last2 = Steffen
| first2 = Eckhard
| issue = 1
| journal = Ars Mathematica Contemporanea
| mr = 3047618
| pages = 161–173
| title = Petersen-colorings and some families of snarks
| url = http://amc-journal.eu/index.php/amc/article/viewFile/288/247
| volume = 7
| year = 2014
| doi = 10.26493/1855-3974.288.11a
| access-date = 2016-09-30
| archive-url = https://web.archive.org/web/20161003070647/http://amc-journal.eu/index.php/amc/article/viewFile/288/247
| archive-date = 2016-10-03
| url-status = live
| doi-access = free
}}.</ref>
* The [[list coloring conjecture]] that, for every graph, the list chromatic index equals the chromatic index<ref>{{citation|last1=Jensen|first1=Tommy R.|last2=Toft|first2=Bjarne|year=1995|title=Graph Coloring Problems|location=New York|publisher=Wiley-Interscience|isbn=978-0-471-02865-9|chapter=12.20 List-Edge-Chromatic Numbers|pages=201–202}}.</ref>
* The [[total coloring conjecture]] of Behzad and Vizing that the total chromatic number is at most two plus the maximum degree<ref>{{citation
| last1 = Molloy | first1 = Michael
| last2 = Reed | first2 = Bruce | author1-link = Bruce Reed (mathematician)
| doi = 10.1007/PL00009820
| issue = 2
| journal = [[Combinatorica]]
| mr = 1656544
| pages = 241–280
| title = A bound on the total chromatic number
| volume = 18
| year = 1998| citeseerx = 10.1.1.24.6514
| s2cid = 9600550
}}.</ref>

==== Graph drawing ====
* The [[Albertson conjecture]] that the crossing number can be lower-bounded by the crossing number of a [[complete graph]] with the same [[chromatic number]]<ref>{{citation|first1=János|last1=Barát|first2=Géza|last2=Tóth|year=2010|title=Towards the Albertson Conjecture|arxiv=0909.0413|journal=Electronic Journal of Combinatorics|volume=17|issue=1|page=R73|bibcode=2009arXiv0909.0413B|doi-access=free|doi=10.37236/345}}.</ref>
* The [[Blankenship–Oporowski conjecture]] on the book thickness of subdivisions<ref>{{citation|url=http://www.openproblemgarden.org/op/book_thickness_of_subdivisions|work=Open Problem Garden|title=Book Thickness of Subdivisions|access-date=2013-02-05|date=January 19, 2009|first=David|last=Wood|archive-url=https://web.archive.org/web/20130916170733/http://www.openproblemgarden.org/op/book_thickness_of_subdivisions|archive-date=September 16, 2013|url-status=live}}.</ref>
* [[Conway's thrackle conjecture]]<ref>{{citation |last1=Fulek |first1=R. |last2=Pach |first2=J. |title=A computational approach to Conway's thrackle conjecture|journal= Computational Geometry |volume=44 |year=2011|issue=6–7 |pages=345–355 |mr=2785903 |doi=10.1007/978-3-642-18469-7_21|arxiv=1002.3904 }}.</ref>
* [[Harborth's conjecture]] that every planar graph can be drawn with integer edge lengths<ref>{{citation|title=Pearls in Graph Theory: A Comprehensive Introduction|title-link= Pearls in Graph Theory |series=Dover Books on Mathematics|last1=Hartsfield|first1=Nora|last2=Ringel|first2=Gerhard|author2-link=Gerhard Ringel|publisher=Courier Dover Publications|year=2013|isbn=978-0-486-31552-2|at=[https://books.google.com/books?id=VMjDAgAAQBAJ&pg=PA247 p. 247]|mr=2047103}}.</ref>
* [[Negami's conjecture]] on projective-plane embeddings of graphs with planar covers<ref>{{citation | last = Hliněný | first = Petr | doi = 10.1007/s00373-010-0934-9 | issue = 4 | journal = [[Graphs and Combinatorics]] | mr = 2669457 | pages = 525–536 | title = 20 years of Negami's planar cover conjecture | url = http://www.fi.muni.cz/~hlineny/papers/plcover20-gc.pdf | volume = 26 | year = 2010 | citeseerx = 10.1.1.605.4932 | s2cid = 121645 | access-date = 2016-10-04 | archive-url = https://web.archive.org/web/20160304030722/http://www.fi.muni.cz/~hlineny/papers/plcover20-gc.pdf | archive-date = 2016-03-04 | url-status = live }}.</ref>
* The [[Greedy embedding#Planar graphs|strong Papadimitriou–Ratajczak conjecture]] that every polyhedral graph has a convex greedy embedding<ref>{{citation | last1 = Nöllenburg | first1 = Martin | last2 = Prutkin | first2 = Roman | last3 = Rutter | first3 = Ignaz | doi = 10.20382/jocg.v7i1a3 | issue = 1 | journal = [[Journal of Computational Geometry]] | mr = 3463906 | pages = 47–69 | title = On self-approaching and increasing-chord drawings of 3-connected planar graphs | volume = 7 | year = 2016| arxiv = 1409.0315 }}</ref>
* [[Turán's brick factory problem]] – Is there a drawing of any complete bipartite graph with fewer crossings than the number given by Zarankiewicz?<ref>{{citation | last1 = Pach | first1 = János | author1-link = János Pach | last2 = Sharir | first2 = Micha | author2-link = Micha Sharir | contribution = 5.1 Crossings—the Brick Factory Problem | pages = 126–127 | publisher = [[American Mathematical Society]] | series = Mathematical Surveys and Monographs | title = Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures | volume = 152 | year = 2009}}.</ref>
* [[Universal point set]]s of subquadratic size for planar graphs<ref>{{citation | last1 = Demaine | first1 = E. | author1-link = Erik Demaine | last2 = O'Rourke | first2 = J. | author2-link = Joseph O'Rourke (professor) | contribution = Problem 45: Smallest Universal Set of Points for Planar Graphs | title = The Open Problems Project | url = http://cs.smith.edu/~orourke/TOPP/P45.html | year = 2002–2012 | access-date = 2013-03-19 | archive-url = https://web.archive.org/web/20120814154255/http://cs.smith.edu/~orourke/TOPP/P45.html | archive-date = 2012-08-14 | url-status = live }}.</ref>
=== Teori Grup ===
=== Teori Grup ===



Revisi per 5 Maret 2021 16.19

Fungsi zeta Riemann, subjek dari masalah belum terpecahkan yang dirayakan dan berpengaruh dikenal sebagai hipotesis Riemann

Sejak zaman Renaisans, banyak persoalan matematika dari abad sebelumnya yang dipecahkan abad setelahnya, tetapi sampai sekarang masih banyak persoalan matematika, besar maupun kecil, bermunculan dan belum terpecahkan.[1] Persoalan-persoalan ini seringkali datang dari berbagai bidang, termasuk fisika, ilmu komputer, aljabar, analisis, kombinatorika, geometri aljabar, diferensial, diskret, dan Euklides, teori graf, grup, model, bilangan, himpunan dan Ramsey, sistem dinamikal, persamaan diferensial parsial, dan masih banyak lagi. Beberapa masalah memiliki lebih dari satu mata pelajaran matematika dan dipelajari menggunakan teknik-tennik dari bidang yang berbeda. Hadiahnya seringkali dberikan untuk penyelesaian ke sebuah masalah yang lama, dan daftar-daftatr persoaln yang belum terpecahkan (seperti daftar Masalah Hadiah Millenium) menerima banyak perhatian.

Artikel ini merupakan sebuah gabungan masalah yang belum terpecahkan yang diturunkan dari banyak sumber, termasuk namun tidak terbatas pada daftar-daftar dianggap berwibawa, ini mungkin tidak selalu mutakhir, dan ini termasuk masalah yang dianggap oleh komunitas matematika menjadi sangat bervariasi dalam kesulitan dan sentralitas ilmu pengetahuan secara keseluruhan.

Artikel ini mengumpulkan berbagai persoalan yang didapat dari berbagai sumber. Daftar ini belum tentu lengkap atau terbarukan

Daftar masalah yang belum terpecahkan dalam matematika

Berbagai matematikawan dan organisasi telah menerbitkan dan mendukung daftar persoalan matematika yang belum terpecahkan. Dalam beberapa kasus, daftar tersebut telah berkaitan dengan hadiah-hadiah untuk penemuan-penemuan penyelesaiannya.

Daftar Jumlah masalah Jumlah yang belum terpecahkan atau belum terselesaikan sepenuhnya Diusulkan oleh Diusulkan pada tahun
Masalah Hilbert[2] 23 15 David Hilbert 1900
Masalah Landau[3] 4 4 Edmund Landau 1912
Masalah Tanimaya[4] 36 - Yutaka Taniyama 1955
24 pertanyaan Thurston[5][6] 24 - William Thurston 1982
Masalah Smale 18 14 Stephen Smale 1998
Masalah Hadiah Millenium 7 6[7] Clay Mathematics Institute 2000
Masalah Simon 15 <12[8][9] Barry Simon 2000
Masalah yang Belum Terpecahkan pada Matematika untuk Abad ke-21[10] 22 - Jair Minoro Abe, Shotaro Tanaka 2001
Tantangan matematika DARPA[11][12] 23 - DARPA 2007

Masalah Hadiah Millenium

Dari tujuh Masalah Hadiah Millenium asli diatur oleh Clay Mathematics Institute pada tahun 2000, keenam masalah telah belum dipecahkan pada Juli, 2020.[13]

Masalah ketujuh, konjektur Poincaré, telah dipecahkan,[14] namun, sebuah rampat disebut konjektur Poincaré empat dimensi mulus—yaitu, apakah sebuah bola topologi empat dimensi dapat memiliki dua struktur mulus yang tidak setara atau lebih—masih belum terpecahkan.[15]

Masalah yang belum terpecahkan

Aljabar

Dalam bola Bloch yang mewakili qubit, sebuah SIC-POVM membentuk sebuh tetrahedron beraturan. Zauner menduga bahwa struktur analog ada di ruang Hilbert kompleks dari semua dimensi terhingga.

Analisis

Luas dari daerah berwarna biru konvergen dengan konstanta Euler–Mascheroni, yang dapat atau tidak dapat menjadi sebuah bilangan rasional.

Kombinatorika

Sistem dinamikal

Sebuah detail dari himpunan Mandelbrot. Ini tidak tahu apakah himpunan Mandebrot terhubung lokal atau tidak.

Permainan dan teka-teki

Permainan kombinatorial

Permainan dengan informasi yang tidak sempurna

Geometri

Geometri aljabar

Peliputan dan pengepakan

  • Masalah Borsuk pada batas atas dan bawah untuk bilangan himpunan bagian dimater yang terkecil dibutuhkan menjadi sebuah himpunan dimensi terbatas.
  • Masalah pengepakan Rado: jika gabungan persegi yang bayak memilki luas satuan, seberpa kecil dapat luas terbesaar diliputi oelh sebuah himpunan bagian lepas persegi-persegi?[42]
  • Konjektur Erdős–Oler yang ketika merupakan sebuah bilangan segitiga, pengepakan lingkaran dalam sebuah segitiga sama sisi membutuhkan sebuah segitiga dari ukuran yang sama sebagai pengepakan lingkaran [43]
  • Masalah bilangan ciuman untuk dimensi selain 1, 2, 3, 4, 8 dan 24[44]
  • Konjektur Reinhardt bahwa oktagon yang mulus memiliki keraptan pengepakan maksimum terendah dari semua himpunan bidang simetris pusat[45]
  • Masalahpengepakan bola, termasuk kerapatan dari pengepakan terapat dalam dimensi selain 1, 2, 3, 8, dan 24, dan perilaku asimtotiknya untuk dimensi yang tinggi.
  • Pengepakan persegi dalam sebuah persegi: berapa rata-rata pertumbuhan asimtotik dari ruang yang terbuang?[46]
  • Konjektur pengepakan Ulam mengenai identitas dari padatan cembung pengepakan terburuk[47]

Geometri diferensial

Geometri diskret

IDalam tiga dimensi, bilangan ciumannya adalah 12, karena 12 bola satuan taktumpang tindih dapat ditaruh menjadi kontak dengan sebuah bola satuan pusat. (Disini, pusat-pusat bola luar membentuk puncak ikosahedron regular.) Bilangan ciuman hanya dikenal persis dalam dimensi 1, 2, 3, 4, 8 dan 24.

Geometri Euklides

Teori graf

Paths and cycles in graphs

Graph coloring and labeling

An instance of the Erdős–Faber–Lovász conjecture: a graph formed from four cliques of four vertices each, any two of which intersect in a single vertex, can be four-colored.

Graph drawing

Teori Grup

Teori Model dan bahasa formal

Teori Nomor

Teori Himpunan

Topologi

  • Konjektur Baum-Connes
  • Konjektur Borel
  • Konjektur Hilbert-Smith
  • Konjektur Mazur
  • Konjektur Novikov
  • Masalah ketidakterikatan(unknotting)
  • Konjektur Volume
  • Konjektur Whitehead
  • Konjektur Zeeman

Persoalan yang sudah dipecahkan sejak 1995


Lihat pula

Referensi

  1. ^ Eves, An Introduction to the History of Mathematics 6th Edition, Thomson, 1990, ISBN 978-0-03-029558-4.
  2. ^ Thiele, Rüdiger (2005), "On Hilbert and his twenty-four problems", dalam Van Brummelen, Glen, Mathematics and the historian's craft. The Kenneth O. May Lectures, CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, 21, hlm. 243–295, ISBN 978-0-387-25284-1 
  3. ^ Guy, Richard (1994), Unsolved Problems in Number Theory (edisi ke-2nd), Springer, hlm. vii, ISBN 978-1-4899-3585-4, diarsipkan dari versi asli tanggal 2019-03-23, diakses tanggal 2016-09-22  .
  4. ^ Shimura, G. (1989). "Yutaka Taniyama and his time". Bulletin of the London Mathematical Society. 21 (2): 186–196. doi:10.1112/blms/21.2.186. Diarsipkan dari versi asli tanggal 2016-01-25. Diakses tanggal 2015-01-15. 
  5. ^ "Archived copy" (PDF). Diarsipkan dari versi asli (PDF) tanggal 2016-02-08. Diakses tanggal 2016-01-22. 
  6. ^ "THREE DIMENSIONAL MANIFOLDS, KLEINIAN GROUPS AND HYPERBOLIC GEOMETRY" (PDF). Diarsipkan dari versi asli (PDF) tanggal 2016-04-10. Diakses tanggal 2016-02-09. 
  7. ^ "Millennium Problems". Diarsipkan dari versi asli tanggal 2017-06-06. Diakses tanggal 2015-01-20. 
  8. ^ "Fields Medal awarded to Artur Avila". Centre national de la recherche scientifique. 2014-08-13. Diarsipkan dari versi asli tanggal 2018-07-10. Diakses tanggal 2018-07-07. 
  9. ^ Bellos, Alex (2014-08-13). "Fields Medals 2014: the maths of Avila, Bhargava, Hairer and Mirzakhani explained". The Guardian. Diarsipkan dari versi asli tanggal 2016-10-21. Diakses tanggal 2018-07-07. 
  10. ^ Abe, Jair Minoro; Tanaka, Shotaro (2001). Unsolved Problems on Mathematics for the 21st Century. IOS Press. ISBN 978-9051994902. 
  11. ^ "DARPA invests in math". CNN. 2008-10-14. Diarsipkan dari versi asli tanggal 2009-03-04. Diakses tanggal 2013-01-14. 
  12. ^ "Broad Agency Announcement (BAA 07-68) for Defense Sciences Office (DSO)". DARPA. 2007-09-10. Diarsipkan dari versi asli tanggal 2012-10-01. Diakses tanggal 2013-06-25. 
  13. ^ "Millennium Problems". Diarsipkan dari versi asli tanggal 2017-06-06. Diakses tanggal 2015-01-20. 
  14. ^ "Poincaré Conjecture". Clay Mathematics Institute. Diarsipkan dari versi asli tanggal 2013-12-15. 
  15. ^ "Smooth 4-dimensional Poincare conjecture". Diarsipkan dari versi asli tanggal 2018-01-25. Diakses tanggal 2019-08-06. 
  16. ^ Dnestrovskaya notebook (PDF) (dalam bahasa Rusia), The Russian Academy of Sciences, 1993 "Dneister Notebook: Unsolved Problems in the Theory of Rings and Modules" (PDF), University of Saskatchewan, diakses tanggal 2019-08-15 
  17. ^ Erlagol notebook (PDF) (dalam bahasa Rusia), The Novosibirsk State University, 2018 
  18. ^ Waldschmidt, Michel (2013), Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables, Springer, hlm. 14, 16, ISBN 9783662115695 
  19. ^ Smyth, Chris (2008), "The Mahler measure of algebraic numbers: a survey", dalam McKee, James; Smyth, Chris, Number Theory and Polynomials, London Mathematical Society Lecture Note Series, 352, Cambridge University Press, hlm. 322–349, ISBN 978-0-521-71467-9 
  20. ^ Berenstein, Carlos A. (2001) [1994], "Pompeiu problem", dalam Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer Science+Business Media B.V. / Kluwer Academic Publishers, ISBN 978-1-55608-010-4 
  21. ^ Waldschmidt, Michel (2013), Diophantine Approximation on Linear Algebraic Groups: Transcendence Properties of the Exponential Function in Several Variables, Springer, hlm. 14, 16, ISBN 9783662115695 
  22. ^ For background on the numbers that are the focus of this problem, see articles by Eric W. Weisstein, on pi ( "Salinan arsip". Archived from the original on 2014-12-06. Diakses tanggal 2021-01-27. ), e ( "Salinan arsip". Archived from the original on 2014-11-21. Diakses tanggal 2021-01-27. ), Khinchin's Constant ( "Salinan arsip". Archived from the original on 2014-11-05. Diakses tanggal 2021-01-27. ), irrational numbers ( "Salinan arsip". Archived from the original on 2015-03-27. Diakses tanggal 2021-01-27. ), transcendental numbers ( "Salinan arsip". Archived from the original on 2014-11-13. Diakses tanggal 2021-01-27. ), and irrationality measures ( "Salinan arsip". Archived from the original on 2015-04-21. Diakses tanggal 2021-01-27. ) at Wolfram MathWorld, all articles accessed 15 December 2014.
  23. ^ Michel Waldschmidt, 2008, "An introduction to irrationality and transcendence methods," at The University of Arizona The Southwest Center for Arithmetic Geometry 2008 Arizona Winter School, March 15–19, 2008 (Special Functions and Transcendence), see "Salinan arsip" (PDF). Archived from the original on 2014-12-16. Diakses tanggal 2021-01-27. , accessed 15 December 2014.
  24. ^ John Albert, posting date unknown, "Some unsolved problems in number theory" [from Victor Klee & Stan Wagon, "Old and New Unsolved Problems in Plane Geometry and Number Theory"], in University of Oklahoma Math 4513 course materials, see "Salinan arsip" (PDF). Archived from the original on 2014-01-17. Diakses tanggal 2021-01-27. , accessed 15 December 2014.
  25. ^ Kung, H. T.; Traub, Joseph Frederick (1974), "Optimal order of one-point and multipoint iteration", Journal of the ACM, 21 (4): 643–651, doi:10.1145/321850.321860 
  26. ^ Bruhn, Henning; Schaudt, Oliver (2015), "The journey of the union-closed sets conjecture" (PDF), Graphs and Combinatorics, 31 (6): 2043–2074, arXiv:1309.3297alt=Dapat diakses gratis, doi:10.1007/s00373-014-1515-0, MR 3417215, diarsipkan dari versi asli (PDF) tanggal 2017-08-08, diakses tanggal 2017-07-18 
  27. ^ Tao, Terence (2017). "Some remarks on the lonely runner conjecture". arΧiv:1701.02048 [math.CO]. 
  28. ^ Liśkiewicz, Maciej; Ogihara, Mitsunori; Toda, Seinosuke (2003-07-28). "The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes". Theoretical Computer Science. 304 (1): 129–156. doi:10.1016/S0304-3975(03)00080-X. 
  29. ^ Brightwell, Graham R.; Felsner, Stefan; Trotter, William T. (1995), "Balancing pairs and the cross product conjecture", Order, 12 (4): 327–349, CiteSeerX 10.1.1.38.7841alt=Dapat diakses gratis, doi:10.1007/BF01110378, MR 1368815  .
  30. ^ Murnaghan, F. D. (1938), "The Analysis of the Direct Product of Irreducible Representations of the Symmetric Groups", American Journal of Mathematics, 60 (1): 44–65, doi:10.2307/2371542, JSTOR 2371542, MR 1507301, PMC 1076971alt=Dapat diakses gratis, PMID 16577800 
  31. ^ Dedekind Numbers and Related Sequences
  32. ^ Kari, Jarkko (2009), "Structure of reversible cellular automata", Unconventional Computation: 8th International Conference, UC 2009, Ponta Delgada, Portugal, September 7ÔÇô11, 2009, Proceedings, Lecture Notes in Computer Science, 5715, Springer, hlm. 6, Bibcode:2009LNCS.5715....6K, doi:10.1007/978-3-642-03745-0_5alt=Dapat diakses gratis, ISBN 978-3-642-03744-3 
  33. ^ Kaloshin, Vadim; Sorrentino, Alfonso (2018). "On the local Birkhoff conjecture for convex billiards". Annals of Mathematics. 188 (1): 315–380. arXiv:1612.09194alt=Dapat diakses gratis. doi:10.4007/annals.2018.188.1.6. 
  34. ^ Sarnak, Peter (2011), "Recent progress on the quantum unique ergodicity conjecture", Bulletin of the American Mathematical Society, 48 (2): 211–228, doi:10.1090/S0273-0979-2011-01323-4alt=Dapat diakses gratis, MR 2774090 
  35. ^ http://english.log-it-ex.com Diarsipkan 2017-11-10 di Wayback Machine. Ten open questions about Sudoku (2012-01-21).
  36. ^ http://english.log-it-ex.com Diarsipkan 2017-11-10 di Wayback Machine. Ten open questions about Sudoku (2012-01-21).
  37. ^ http://english.log-it-ex.com Diarsipkan 2017-11-10 di Wayback Machine. Ten open questions about Sudoku (2012-01-21).
  38. ^ "Higher-Dimensional Tic-Tac-Toe". PBS Infinite Series. YouTube. 2017-09-21. Diarsipkan dari versi asli tanggal 2017-10-11. Diakses tanggal 2018-07-29. 
  39. ^ Barlet, Daniel; Peternell, Thomas; Schneider, Michael (1990). "On two conjectures of Hartshorne's". Mathematische Annalen. 286 (1–3): 13–25. doi:10.1007/BF01453563. 
  40. ^ Maulik, Davesh; Nekrasov, Nikita; Okounov, Andrei; Pandharipande, Rahul (2004-06-05), Gromov–Witten theory and Donaldson–Thomas theory, I, arXiv:math/0312059alt=Dapat diakses gratis, Bibcode:2003math.....12059M 
  41. ^ Zariski, Oscar (1971). "Some open questions in the theory of singularities". Bulletin of the American Mathematical Society. 77 (4): 481–491. doi:10.1090/S0002-9904-1971-12729-5alt=Dapat diakses gratis. MR 0277533. 
  42. ^ Bereg, Sergey; Dumitrescu, Adrian; Jiang, Minghui (2010), "On covering problems of Rado", Algorithmica, 57 (3): 538–561, doi:10.1007/s00453-009-9298-z, MR 2609053 
  43. ^ Melissen, Hans (1993), "Densest packings of congruent circles in an equilateral triangle", American Mathematical Monthly, 100 (10): 916–925, doi:10.2307/2324212, JSTOR 2324212, MR 1252928 
  44. ^ Conway, John H.; Neil J.A. Sloane (1999), Sphere Packings, Lattices and Groups (edisi ke-3rd), New York: Springer-Verlag, hlm. 21–22, ISBN 978-0-387-98585-5 
  45. ^ Hales, Thomas (2017), The Reinhardt conjecture as an optimal control problem, arXiv:1703.01352alt=Dapat diakses gratis 
  46. ^ Brass, Peter; Moser, William; Pach, János (2005), Research Problems in Discrete Geometry, New York: Springer, hlm. 45, ISBN 978-0387-23815-9, MR 2163782 
  47. ^ Gardner, Martin (1995), New Mathematical Diversions (Revised Edition), Washington: Mathematical Association of America, hlm. 251 
  48. ^ Katz, Mikhail G. (2007), Systolic geometry and topology, Mathematical Surveys and Monographs, 137, American Mathematical Society, Providence, RI, hlm. 57, doi:10.1090/surv/137, ISBN 978-0-8218-4177-8, MR 2292367 
  49. ^ Rosenberg, Steven (1997), The Laplacian on a Riemannian Manifold: An introduction to analysis on manifolds, London Mathematical Society Student Texts, 31, Cambridge: Cambridge University Press, hlm. 62–63, doi:10.1017/CBO9780511623783, ISBN 978-0-521-46300-3, MR 1462892 
  50. ^ Barros, Manuel (1997), "General Helices and a Theorem of Lancret", Proceedings of the American Mathematical Society, 125 (5): 1503–1509, doi:10.1090/S0002-9939-97-03692-7alt=Dapat diakses gratis, JSTOR 2162098 
  51. ^ Morris, Walter D.; Soltan, Valeriu (2000), "The Erdős-Szekeres problem on points in convex position—a survey", Bull. Amer. Math. Soc., 37 (4): 437–458, doi:10.1090/S0273-0979-00-00877-6alt=Dapat diakses gratis, MR 1779413 ; Suk, Andrew (2016), "On the Erdős–Szekeres convex polygon problem", J. Amer. Math. Soc., 30 (4): 1047–1053, arXiv:1604.08657alt=Dapat diakses gratis, doi:10.1090/jams/869 
  52. ^ Dey, Tamal K. (1998), "Improved bounds for planar k-sets and related problems", Discrete Comput. Geom., 19 (3): 373–382, doi:10.1007/PL00009354alt=Dapat diakses gratis, MR 1608878 ; Tóth, Gábor (2001), "Point sets with many k-sets", Discrete Comput. Geom., 26 (2): 187–194, doi:10.1007/s004540010022alt=Dapat diakses gratis, MR 1843435 .
  53. ^ Boltjansky, V.; Gohberg, I. (1985), "11. Hadwiger's Conjecture", Results and Problems in Combinatorial Geometry, Cambridge University Press, hlm. 44–46 .
  54. ^ (Inggris) Weisstein, Eric W. "Kobon Triangle". MathWorld. 
  55. ^ Guy, Richard K. (1983), "An olla-podrida of open problems, often oddly posed", American Mathematical Monthly, 90 (3): 196–200, doi:10.2307/2975549, JSTOR 2975549, MR 1540158 
  56. ^ Matoušek, Jiří (2002), Lectures on discrete geometry, Graduate Texts in Mathematics, 212, Springer-Verlag, New York, hlm. 206, doi:10.1007/978-1-4613-0039-7, ISBN 978-0-387-95373-1, MR 1899299 
  57. ^ Aronov, Boris; Dujmović, Vida; Morin, Pat; Ooms, Aurélien; Schultz Xavier da Silveira, Luís Fernando (2019), "More Turán-type theorems for triangles in convex point sets", Electronic Journal of Combinatorics, 26 (1): P1.8, arXiv:1706.10193alt=Dapat diakses gratis, Bibcode:2017arXiv170610193A, doi:10.37236/7224alt=Dapat diakses gratis, diarsipkan dari versi asli tanggal 2019-02-18, diakses tanggal 2019-02-18 
  58. ^ Brass, Peter; Moser, William; Pach, János (2005), "5.1 The Maximum Number of Unit Distances in the Plane", Research problems in discrete geometry, Springer, New York, hlm. 183–190, ISBN 978-0-387-23815-9, MR 2163782 
  59. ^ Kalai, Gil (1989), "The number of faces of centrally-symmetric polytopes", Graphs and Combinatorics, 5 (1): 389–391, doi:10.1007/BF01788696, MR 1554357  .
  60. ^ Atiyah, Michael (2001), "Configurations of points", Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 359 (1784): 1375–1387, Bibcode:2001RSPTA.359.1375A, doi:10.1098/rsta.2001.0840, ISSN 1364-503X, MR 1853626 
  61. ^ Finch, S. R.; Wetzel, J. E. (2004), "Lost in a forest", American Mathematical Monthly, 11 (8): 645–654, doi:10.2307/4145038, JSTOR 4145038, MR 2091541 
  62. ^ Howards, Hugh Nelson (2013), "Forming the Borromean rings out of arbitrary polygonal unknots", Journal of Knot Theory and Its Ramifications, 22 (14): 1350083, 15, arXiv:1406.3370alt=Dapat diakses gratis, doi:10.1142/S0218216513500831, MR 3190121 
  63. ^ Solomon, Yaar; Weiss, Barak (2016), "Dense forests and Danzer sets", Annales Scientifiques de l'École Normale Supérieure, 49 (5): 1053–1074, arXiv:1406.3807alt=Dapat diakses gratis, doi:10.24033/asens.2303, MR 3581810  ; Conway, John H., Five $1,000 Problems (Update 2017) (PDF), On-Line Encyclopedia of Integer Sequences, diarsipkan dari versi asli (PDF) tanggal 2019-02-13, diakses tanggal 2019-02-12 
  64. ^ Brandts, Jan; Korotov, Sergey; Křížek, Michal; Šolc, Jakub (2009), "On nonobtuse simplicial partitions" (PDF), SIAM Review, 51 (2): 317–335, Bibcode:2009SIAMR..51..317B, doi:10.1137/060669073, MR 2505583, diarsipkan dari versi asli (PDF) tanggal 2018-11-04, diakses tanggal 2018-11-22  . See in particular Conjecture 23, p. 327.
  65. ^ Socolar, Joshua E. S.; Taylor, Joan M. (2012), "Forcing nonperiodicity with a single tile", The Mathematical Intelligencer, 34 (1): 18–28, arXiv:1009.1419alt=Dapat diakses gratis, doi:10.1007/s00283-011-9255-y, MR 2902144 
  66. ^ Arutyunyants, G.; Iosevich, A. (2004), "Falconer conjecture, spherical averages and discrete analogs", dalam Pach, János, Towards a Theory of Geometric Graphs, Contemp. Math., 342, Amer. Math. Soc., Providence, RI, hlm. 15–24, doi:10.1090/conm/342/06127alt=Dapat diakses gratis, ISBN 9780821834848, MR 2065249 
  67. ^ Matschke, Benjamin (2014), "A survey on the square peg problem", Notices of the American Mathematical Society, 61 (4): 346–352, doi:10.1090/noti1100alt=Dapat diakses gratis 
  68. ^ Katz, Nets; Tao, Terence (2002), "Recent progress on the Kakeya conjecture", Proceedings of the 6th International Conference on Harmonic Analysis and Partial Differential Equations (El Escorial, 2000), Publicacions Matemàtiques (Vol. Extra): 161–179, CiteSeerX 10.1.1.241.5335alt=Dapat diakses gratis, doi:10.5565/PUBLMAT_Esco02_07, MR 1964819 
  69. ^ Weaire, Denis, ed. (1997), The Kelvin Problem, CRC Press, hlm. 1, ISBN 9780748406326 
  70. ^ Brass, Peter; Moser, William; Pach, János (2005), Research problems in discrete geometry, New York: Springer, hlm. 457, ISBN 9780387299297, MR 2163782 
  71. ^ Mahler, Kurt (1939). "Ein Minimalproblem für konvexe Polygone". Mathematica (Zutphen) B: 118–127. 
  72. ^ Norwood, Rick; Poole, George; Laidacker, Michael (1992), "The worm problem of Leo Moser", Discrete and Computational Geometry, 7 (2): 153–162, doi:10.1007/BF02187832alt=Dapat diakses gratis, MR 1139077 
  73. ^ Wagner, Neal R. (1976), "The Sofa Problem" (PDF), The American Mathematical Monthly, 83 (3): 188–189, doi:10.2307/2977022, JSTOR 2977022, diarsipkan dari versi asli (PDF) tanggal 2015-04-20, diakses tanggal 2014-05-14 
  74. ^ Demaine, Erik D.; O'Rourke, Joseph (2007), "Chapter 22. Edge Unfolding of Polyhedra", Geometric Folding Algorithms: Linkages, Origami, Polyhedra, Cambridge University Press, hlm. 306–338 
  75. ^ Ghomi, Mohammad (2018-01-01). "D "urer's Unfolding Problem for Convex Polyhedra". Notices of the American Mathematical Society. 65 (1): 25–27. doi:10.1090/noti1609alt=Dapat diakses gratis. ISSN 0002-9920. 
  76. ^ Whyte, L. L. (1952), "Unique arrangements of points on a sphere", The American Mathematical Monthly, 59 (9): 606–611, doi:10.2307/2306764, JSTOR 2306764, MR 0050303 
  77. ^ ACW (May 24, 2012), "Convex uniform 5-polytopes", Open Problem Garden, diarsipkan dari versi asli tanggal October 5, 2016, diakses tanggal 2016-10-04  .
  78. ^ Florek, Jan (2010), "On Barnette's conjecture", Discrete Mathematics, 310 (10–11): 1531–1535, doi:10.1016/j.disc.2010.01.018, MR 2601261 .
  79. ^ Broersma, Hajo; Patel, Viresh; Pyatkin, Artem (2014), "On toughness and Hamiltonicity of $2K_2$-free graphs", Journal of Graph Theory, 75 (3): 244–255, doi:10.1002/jgt.21734, MR 3153119 
  80. ^ Jaeger, F. (1985), "A survey of the cycle double cover conjecture", Annals of Discrete Mathematics 27 – Cycles in Graphs, North-Holland Mathematics Studies, 27, hlm. 1–12, doi:10.1016/S0304-0208(08)72993-1, ISBN 9780444878038 .
  81. ^ Heckman, Christopher Carl; Krakovski, Roi (2013), "Erdös-Gyárfás conjecture for cubic planar graphs", Electronic Journal of Combinatorics, 20 (2), P7, doi:10.37236/3252alt=Dapat diakses gratis .
  82. ^ Akiyama, Jin; Exoo, Geoffrey; Harary, Frank (1981), "Covering and packing in graphs. IV. Linear arboricity", Networks, 11 (1): 69–72, doi:10.1002/net.3230110108, MR 0608921 .
  83. ^ L. Babai, Automorphism groups, isomorphism, reconstruction Diarsipkan 2007-06-13 di Wayback Machine., in Handbook of Combinatorics, Vol. 2, Elsevier, 1996, 1447–1540.
  84. ^ Lenz, Hanfried; Ringel, Gerhard (1991), "A brief review on Egmont Köhler's mathematical work", Discrete Mathematics, 97 (1–3): 3–16, doi:10.1016/0012-365X(91)90416-Y, MR 1140782 
  85. ^ Bousquet, Nicolas; Bartier, Valentin (2019), "Linear Transformations Between Colorings in Chordal Graphs", dalam Bender, Michael A.; Svensson, Ola; Herman, Grzegorz, 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, LIPIcs, 144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, hlm. 24:1–24:15, doi:10.4230/LIPIcs.ESA.2019.24 
  86. ^ Chung, Fan; Graham, Ron (1998), Erdős on Graphs: His Legacy of Unsolved Problems, A K Peters, hlm. 97–99 .
  87. ^ Chudnovsky, Maria; Seymour, Paul (2014), "Extending the Gyárfás-Sumner conjecture", Journal of Combinatorial Theory, Series B, 105: 11–16, doi:10.1016/j.jctb.2013.11.002alt=Dapat diakses gratis, MR 3171779 
  88. ^ Toft, Bjarne (1996), "A survey of Hadwiger's conjecture", Congressus Numerantium, 115: 249–283, MR 1411244 .
  89. ^ Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K. (1991), Unsolved Problems in Geometry, Springer-Verlag , Problem G10.
  90. ^ Hägglund, Jonas; Steffen, Eckhard (2014), "Petersen-colorings and some families of snarks", Ars Mathematica Contemporanea, 7 (1): 161–173, doi:10.26493/1855-3974.288.11aalt=Dapat diakses gratis, MR 3047618, diarsipkan dari versi asli tanggal 2016-10-03, diakses tanggal 2016-09-30  .
  91. ^ Jensen, Tommy R.; Toft, Bjarne (1995), "12.20 List-Edge-Chromatic Numbers", Graph Coloring Problems, New York: Wiley-Interscience, hlm. 201–202, ISBN 978-0-471-02865-9 .
  92. ^ Molloy, Michael; Reed, Bruce (1998), "A bound on the total chromatic number", Combinatorica, 18 (2): 241–280, CiteSeerX 10.1.1.24.6514alt=Dapat diakses gratis, doi:10.1007/PL00009820, MR 1656544  .
  93. ^ Barát, János; Tóth, Géza (2010), "Towards the Albertson Conjecture", Electronic Journal of Combinatorics, 17 (1): R73, arXiv:0909.0413alt=Dapat diakses gratis, Bibcode:2009arXiv0909.0413B, doi:10.37236/345alt=Dapat diakses gratis .
  94. ^ Wood, David (January 19, 2009), "Book Thickness of Subdivisions", Open Problem Garden, diarsipkan dari versi asli tanggal September 16, 2013, diakses tanggal 2013-02-05  .
  95. ^ Fulek, R.; Pach, J. (2011), "A computational approach to Conway's thrackle conjecture", Computational Geometry, 44 (6–7): 345–355, arXiv:1002.3904alt=Dapat diakses gratis, doi:10.1007/978-3-642-18469-7_21, MR 2785903 .
  96. ^ Hartsfield, Nora; Ringel, Gerhard (2013), Pearls in Graph Theory: A Comprehensive Introduction, Dover Books on Mathematics, Courier Dover Publications, p. 247, ISBN 978-0-486-31552-2, MR 2047103 .
  97. ^ Hliněný, Petr (2010), "20 years of Negami's planar cover conjecture" (PDF), Graphs and Combinatorics, 26 (4): 525–536, CiteSeerX 10.1.1.605.4932alt=Dapat diakses gratis, doi:10.1007/s00373-010-0934-9, MR 2669457, diarsipkan dari versi asli (PDF) tanggal 2016-03-04, diakses tanggal 2016-10-04  .
  98. ^ Nöllenburg, Martin; Prutkin, Roman; Rutter, Ignaz (2016), "On self-approaching and increasing-chord drawings of 3-connected planar graphs", Journal of Computational Geometry, 7 (1): 47–69, arXiv:1409.0315alt=Dapat diakses gratis, doi:10.20382/jocg.v7i1a3, MR 3463906 
  99. ^ Pach, János; Sharir, Micha (2009), "5.1 Crossings—the Brick Factory Problem", Combinatorial Geometry and Its Algorithmic Applications: The Alcalá Lectures, Mathematical Surveys and Monographs, 152, American Mathematical Society, hlm. 126–127 .
  100. ^ Demaine, E.; O'Rourke, J. (2002–2012), "Problem 45: Smallest Universal Set of Points for Planar Graphs", The Open Problems Project, diarsipkan dari versi asli tanggal 2012-08-14, diakses tanggal 2013-03-19  .