LissafiKafin bugawaNazariyyaKaratun minti 4

AI TA RUSHE WANI HASASHEN LAUNI NA SHEKARUN 1990

Ɗauki hanyar sadarwa ta maki da layuka suka haɗa — wato graph. Launi gaba ɗaya (total colouring) yana ba kowane maki da kowane layi launi, bisa ƙa’idoji uku: maki biyu maƙwabta su bambanta, layuka biyu da suka haɗu a maki su bambanta, kuma layi ya bambanta da makinsa biyu na ƙarshe. Mafi ƙarancin adadin launukan da ke aiki ana kiransa total chromatic number, ana rubuta shi χ″(G).

Yanzu a ƙara wahala. A ba kowane maki da kowane layi jerinsa na kansa na launukan da aka yarda da su, duk jerin girmansu ɗaya k, kuma a buƙaci launi mai inganci da aka zaɓa daga jerin. Mafi ƙarancin k da ke aiki ko wane irin jeri ne shi ne list total chromatic number, χ″ℓ(G). Ba zai taɓa zama ƙasa da χ″(G) ba: idan duk jerin iri ɗaya ne, an koma ga matsalar ta yau da kullum.

Hasashe daga ƙarshen shekarun 1990

Ƙungiyoyi uku — Borodin, Kostochka da Woodall; Juvan, Mohar da Škrekovski; Hilton da Johnson — sun gabatar daban-daban, a ƙarshen shekarun 1990, cewa jerin kai-da-kai ba sa taɓa ƙara wani abu:

χ″ℓ(G) = χ″(G) ga kowane graph (har ma da layuka da yawa tsakanin maki biyu).

Wannan shi ne List Total Colouring Conjecture. Shaidu sun goyi bayansa: yana aiki ga graph inda babu maki da ke da fiye da layi biyu, kuma an san cewa kowane graph mai layi uku daidai a kowane maki (graph cubic) ba ya buƙatar fiye da launuka 5 daga jeri.

Misalin da ya saɓa

Jonathan Noel, na Jami’ar Victoria a Canada, yanzu ya nuna graph cubic mai maki 20 wanda ke da χ″ = 4 amma χ″ℓ = 5. Hasashen ƙarya ne.

Ginin ƙarami ne. Ɗauki kwafi huɗu na wani ƙaramin graph da ake kira K₂,₃: maki biyu na “sirri”, kowanne an haɗa shi da maki uku iri ɗaya na “ƙarshe” (terminal). Sannan a haɗa kowane biyu na kwafin da layi ɗaya tak na “ketare” (cross) tsakanin maki na ƙarshe. Kowane maki zai ƙare da layuka uku.

Graph mai maki 20 da aka zana a matsayin tubala huɗu da layukan ketare suka haɗa, an yi masa launi da launuka huɗu.

Graph G tare da launi gaba ɗaya da launuka huɗu kawai, da aka nuna da siffofi da salon layuka. — Hoto na 1, Noel (2026), arXiv:2609.38417.

Launuka huɗu sun isa a wasan na yau da kullum: launi na 4 yana zuwa ga duk maki na sirri da duk layukan ketare, waɗanda ba sa taɓa juna, kuma ƙaramin tebur da ƙa’idar zagaye suna kula da sauran.

Jerin da ba za a iya cika su ba

Tarkon yana amfani da launuka daga 1 zuwa 5. Kowane maki da layi na tubala i yana samun jerin “duk launuka banda i”; layukan ketare suna samun jerin da aka zaɓa da kyau waɗanda ba su da 5 ko i + 2. Hujjar sai ta tafi kamar gajeren labarin bincike:

  • Lemma: a kowane launi mai launuka 4 na K₂,₃, maki biyu na sirri dole su sami launi ɗaya.
  • Don haka kowane tubala i yana da launuka biyu {i, sᵢ}, kuma kowane layin ketare tsakanin tubala biyu dole ya yi amfani da launin da ke cikin duka biyun.
  • Ɗan ƙididdiga ya nuna cewa launi ɗaya t dole ya kasance cikin duk biyu-biyun huɗu.
  • Ga kowane t mai yiwuwa, wani takamaiman layin ketare yana gano cewa babu wannan launi a jerinsa. Saɓani.

Graph ɗin guda tare da kowane maki da layi an yi masa alama da launin da babu a jerinsa.

Rabon jeri: kowane maki da layi zai iya amfani da kowane launi daga 1 zuwa 5 banda wanda aka nuna. Babu launi gaba ɗaya da zai iya mutunta waɗannan jerin. — Hoto na 2, Noel (2026), arXiv:2609.38417.

Inji ya samo, masanin lissafi ya duba

Takardar ta fito fili sosai game da asalinta ta hanyar da ba a saba ba. A ranar 24 ga Satumba 2026, Noel ya umarci ChatGPT 6 Astra Ultra da ta karyata hasashen, kuma ta samar da misalin da ya saɓa, “da ɗan ƙaramin gudummawa daga marubucin”. Ya duba hujjojin ya sake rubuta rubutun daga daftarin da samfurin ya samar; samfurin ya kuma taimaka wajen gyaran rubutu, ya ba da shawarar madogara, ya kuma zana hotunan. “Marubucin ya ɗauki cikakken alhakin ingancin,” in ji sanarwar a ƙarshe. Takardar preprint ce, amma hujjar gajeriya ce ta yadda kowane mai karatu mai haƙuri zai iya tabbatar da ita.

Tazarar ɗaya, ko fiye?

Jerin kai-da-kai na iya buƙatar ƙarin launi ɗaya. Shin za su iya buƙatar fiye da haka? Tazarar uku za ta kuma rushe wani ɗan uwa da aka yi nazari sosai, List Edge Colouring Conjecture, saboda χ″ℓ ≤ χ′ℓ + 2 da χ″ ≥ χ′. Noel ya rufe da wata buɗaɗɗiyar tambaya da misalin da AI ta samo bai warware ba: shin χ″ℓ(G) ≤ χ″(G) + 1 ga kowane graph?