Tootfinder

Portimao, Portugal
Praia da Rocha, 2004
#silentsunday

On total domination subdivision numbers of trees
Michael A. Henning, Jerzy Topp
https://arxiv.org/abs/2404.16186 https://arxiv.org/pd…

On total domination subdivision numbers of trees
A set $S$ of vertices in a graph $G$ is a total dominating set of $G$ if every vertex is adjacent to a vertex in $S$. The total domination number $γ_t(G)$ is the minimum cardinality of a total dominating set of $G$. The total domination subdivision number $\mbox{sd}_{γ_t}(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where each edge in $G$ can be subdivided at most once) in order to increase the total domination number. Haynes et al. (Discrete Math. 286 (2004) 195…

Huzzah, @… is on the scene!

LOL… I just discovered that I apparently created a Google account 2004-04-01 at 14:40 UTC that I never did anything with. Literally ANYTHING. I had to dig deep to figure it out. I have so many G accounts that I’ve just missed it in their routine mailbomb of account notices about a dozen times.
Today's notice stood out: idle account deletion warning. I thought it was a #spearphish at…

Portimao, Portugal
Praia da Rocha, 2004
#silentsunday

On total domination subdivision numbers of trees
Michael A. Henning, Jerzy Topp
https://arxiv.org/abs/2404.16186 https://arxiv.org/pd…

On total domination subdivision numbers of trees
A set $S$ of vertices in a graph $G$ is a total dominating set of $G$ if every vertex is adjacent to a vertex in $S$. The total domination number $γ_t(G)$ is the minimum cardinality of a total dominating set of $G$. The total domination subdivision number $\mbox{sd}_{γ_t}(G)$ of a graph $G$ is the minimum number of edges that must be subdivided (where each edge in $G$ can be subdivided at most once) in order to increase the total domination number. Haynes et al. (Discrete Math. 286 (2004) 195…

This https://arxiv.org/abs/2004.04585 has been replaced.
link: https://scholar.google.com/scholar?q=a

From quantum curves to topological string partition functions II
We propose a geometric characterisation of the topological string partition functions associated to the local Calabi-Yau (CY) manifolds used in the geometric engineering of $d=4$, $\mathcal{N}=2$ supersymmetric field theories of class $\mathcal{S}$. A quantisation of these CY manifolds defines differential operators called quantum curves. The partition functions are extracted from the isomonodromic tau-functions associated to the quantum curves by expansions of generalised theta series type. It…

Percussions de Phil - En Concert Š (Paris 2004) sur écran G
#NowPlaying

1964: a new business computer manufacturer every 10 seconds
1974: a new 8-bit CPU every 10 seconds
1984: a new IBM PC clone every 10 seconds
1994: a new website every 10 seconds
2004: a new blog engine every 10 seconds
2014: a new JavaScript framework every 10 seconds
2024: a new LLM every 10 seconds

Ken Loach, ist das nicht der letzte Regisseur des sozialistischen Realismus in der westlichen Welt?
Tatsächlich beginnt auch “Ae fond kiss…” mit Bildern aus dem grauen Glasgow, aber dann zeigt #Loach eine bewegende, großartig besetzte Romeo-und-Julia-Geschichte.
Nur noch bis Ende des Monats in der #arte

Just a Kiss - Film in voller Länge | ARTE
Der junge Pakistaner Casim verliebt sich in die attraktive Musiklehrerin Roisin. Doch weder Casims pakistanische Familie noch Roisins katholisches Umfeld dulden die Beziehung. Deshalb gibt Casim vor, zu einem Freund zu ziehen, um heimlich mit Roisin zusammenzuleben ... - Bewegende Romeo-und-Julia-Geschichte (2004) von Altmeister Ken Loach