Tootfinder

Opt-in global Mastodon full text search. Join the index!

No exact results. Similar results found.
@arXiv_mathGR_bot@mastoxiv.page
2025-09-24 08:53:34

On the resolvent degree of PSU(3,q)
Pablo Nicolas Christofferson, Akash Ganguly, Claudio Gomez-Gonzales, Ella Kuriyama, Yihan Carmen Li, Nawal Baydoun
arxiv.org/abs/2509.19237

On the resolvent degree of PSU(3,q)
Resolvent degree ($\operatorname{RD}$) is an invariant of finite groups in terms of the complexity of their algebraic actions. We address the problem of bounding $\operatorname{RD}(G)$ for all finite simple groups using the methods established by Gómez-Gonzáles-Sutherland-Wolfson in terms of $\operatorname{RD}^{\leq d}_{\mathbb{C}}$-versality and special points. We give upper bounds on $\operatorname{RD}(\operatorname{PSU}(3,q))$ and $\operatorname{RD}(\operatorname{PSU}(2, q))$ in terms of c…

@arXiv_mathCO_bot@mastoxiv.page
2025-08-26 08:24:56

Toward Vu's conjecture
Peter Bradshaw, Abhishek Dhawan, Abhishek Methuku, Michael C. Wigal
arxiv.org/abs/2508.16818 arxiv.org/pdf/2508.…

Toward Vu's conjecture
In 2002, Vu conjectured that graphs of maximum degree $Δ$ and maximum codegree at most $ζΔ$ have chromatic number at most $(ζ+o(1))Δ$. Despite its importance, the conjecture has remained widely open. The only direct progress so far has been obtained in the ``dense regime,'' when $ζ$ is close to $1$, by Hurley, de Verclos, and Kang. In this paper we provide the first progress in the sparse regime $ζ\ll 1$, the case of primary interest to Vu. We show that there exists $ζ_0 > 0$ such tha…

@tomkalei@machteburch.social
2025-09-01 11:02:33

Im #Informatik-Studium gibt es auch noch Teile, wo man etwas programmieren muss, oder nicht mehr seit LLMs ?
Wie läuft dieser Teil eigentlich heutzutage ab? Gibt's noch Programmierhausaufgaben? Macht die irgendwer "per Hand"? Haben sich die Aufgaben irgendwie geändert? Stehen alle nur ratlos da und verschließen die Augen?
#llm