So I had picked up an old #lenovo #thinkpad #p1 Gen2 Xeon laptop a couple of months ago.
Really love the thing, it's a great used device.
Today, decided that I'd get into the shell to get a photo of the battery, seeing as how I'd like to replace it at some point. So I did that.
Saw the extra empty nvme slot, decided that "hey, I've got a spare 512 laying around, let's put that in there." Did that, but had to use some grippier methods to get the screw out. I don't /think/ I damaged anything.
Buttoned everything back up, plugged it in. NOTHING. The power indicator doesn't come on. Won't respond to a thing.
Pulled power. Hold power button 60s. Hold reset pin on bottom 60s. Rinse. Repeat. Nothing.
Tried a dock power cord. Nope.
Moved the power cord from a strip to the wall - it did light up a second or two....so a little promise, but it's dead again.
I'm at a loss at this point. At least I didn't spend a lot of money for the thing, but I'm mad at myself.
#forberedelse 🌟 Fogh var i særklasse til at forberede sig.
Forberedte sig på fem mulige udfald af et møde. Fik frigivet 10 % til at improvisere.
Særlig rådgiver Steffen Hjaltelin i Spindøren på #P1.
Forberedelse er ingen hindring, men en forudsætning for improvisation.
Lyt som podcast her på DR LYD. Hvilken fejl må en taleskriver aldrig begå, og hvordan forbereder man bedst politikerne på et svært pressemøde? Hvorfor er det så svært for en politiker at sige undskyld, og hvorfor opfinder de nye ord for at undgå at sige det? I vores sommerserie - Spindøren - retter Tony Scott spotlyset mod dem, der normalt står i baggrunden, og hvisker politikerne i øret. Hvad har de hørt? Og hvad ville de sige, hvis de stadig var rådgivere? Gæster: Anita Furu, fhv. taleskriver, Statsministeriet & Steffen Hjaltelin, Fhv. strategisk rådgiver for Venstre, 2004-2019. Vært: Tony Scott Producer: Naja Bergen Dale Redaktør: Christian Sforzini Graugaard Svingdoren@dr.dk Programmet er optaget 18. juni
Spanning k-trees, odd [1,b]-factors and spectral radius in binding graphs
Jiancheng Wu, Sizhong Zhou
https://arxiv.org/abs/2507.07301 https://arxiv.org/pdf/2507.07301 https://arxiv.org/html/2507.07301
arXiv:2507.07301v1 Announce Type: new
Abstract: The binding number of a graph $G$, written as $\mbox{bind}(G)$, is defined by $$ \mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}. $$ A graph $G$ is called $r$-binding if $\mbox{bind}(G)\geq r$. An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $F$ with $d_F(v)\in\{1,3,\ldots,b\}$ for all $v\in V(G)$, where $b\geq1$ is an odd integer. A spanning $k$-tree of a connected graph $G$ is a spanning tree $T$ with $d_T(v)\leq k$ for every $v\in V(G)$. In this paper, we first show a tight sufficient condition with respect to the adjacency spectral radius for connected $\frac{1}{b}$-binding graphs to have odd $[1,b]$-factors, which generalizes Fan and Lin's previous result [D. Fan, H. Lin, Binding number, $k$-factor and spectral radius of graphs, Electron. J. Combin. 31(1) (2024) \#P1.30] and partly improves Fan, Liu and Ao's previous result [A. Fan, R. Liu, G. Ao, Spectral radius, odd $[1,b]$-factor and spanning $k$-tree of 1-binding graphs, Linear Algebra Appl. 705 (2025) 1--16]. Then we put forward a tight sufficient condition via the adjacency spectral radius for connected $\frac{1}{k-2}$-binding graphs to have spanning $k$-trees, which partly improves Fan, Liu and Ao's previous result [A. Fan, R. Liu, G. Ao, Spectral radius, odd $[1,b]$-factor and spanning $k$-tree of 1-binding graphs, Linear Algebra Appl. 705 (2025) 1--16].
toXiv_bot_toot
The binding number of a graph $G$, written as $\mbox{bind}(G)$, is defined by $$ \mbox{bind}(G)=\min\left\{\frac{|N_G(X)|}{|X|}:\emptyset\neq X\subseteq V(G),N_G(X)\neq V(G)\right\}. $$ A graph $G$ is called $r$-binding if $\mbox{bind}(G)\geq r$. An odd $[1,b]$-factor of a graph $G$ is a spanning subgraph $F$ with $d_F(v)\in\{1,3,\ldots,b\}$ for all $v\in V(G)$, where $b\geq1$ is an odd integer. A spanning $k$-tree of a connected graph $G$ is a spanning tree $T$ with $d_T(v)\leq k$ for every $v\in V(G)$. In this paper, we first show a tight sufficient condition with respect to the adjacency spectral radius for connected $\frac{1}{b}$-binding graphs to have odd $[1,b]$-factors, which generalizes Fan and Lin's previous result [D. Fan, H. Lin, Binding number, $k$-factor and spectral radius of graphs, Electron. J. Combin. 31(1) (2024) \#P1.30] and partly improves Fan, Liu and Ao's previous result [A. Fan, R. Liu, G. Ao, Spectral radius, odd $[1,b]$-factor and spanning $k$-tree of 1-binding graphs, Linear Algebra Appl. 705 (2025) 1--16]. Then we put forward a tight sufficient condition via the adjacency spectral radius for connected $\frac{1}{k-2}$-binding graphs to have spanning $k$-trees, which partly improves Fan, Liu and Ao's previous result [A. Fan, R. Liu, G. Ao, Spectral radius, odd $[1,b]$-factor and spanning $k$-tree of 1-binding graphs, Linear Algebra Appl. 705 (2025) 1--16].
The stability of independence polynomials of complete bipartite graphs
Guo Chen, Bo Ning, Jianhua Tu
https://arxiv.org/abs/2505.24381 https://arxiv.org/pdf/2505.24381 https://arxiv.org/html/2505.24381
arXiv:2505.24381v1 Announce Type: new
Abstract: The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane $\{z \in \mathbb{C} : \mathrm{Re}(z) \leq 0\}$, and the graph itself is also referred to as stable. Brown and Cameron (Electron. J. Combin. 25(1) (2018) \#P1.46) proved that the complete bipartite graph $K_{1,n}$ is stable and posed the question: \textbf{Are all complete bipartite graphs stable?}
We answer this question by establishing the following results:
\begin{itemize}
\item The complete bipartite graphs $K_{2,n}$ and $K_{3,n}$ are stable.
\item For any integer $k\geq0$, there exists an integer $N(k)\in \mathbb{N}$ such that $K_{m,m+k}$ is stable for all $m>N(k)$.
\item For any rational $\ell> 1$, there exists an integer $N(\ell) \in \mathbb{N}$ such that whenever $m >N(\ell)$ and $\ell \cdot m$ is an integer, $K_{m, \ell \cdot m}$ is \textbf{not} stable.
\end{itemize}
The independence polynomial of a graph is termed {\it stable} if all its roots are located in the left half-plane $\{z \in \mathbb{C} : \mathrm{Re}(z) \leq 0\}$, and the graph itself is also referred to as stable. Brown and Cameron (Electron. J. Combin. 25(1) (2018) \#P1.46) proved that the complete bipartite graph $K_{1,n}$ is stable and posed the question: \textbf{Are all complete bipartite graphs stable?} We answer this question by establishing the following results: \begin{itemize} \item The complete bipartite graphs $K_{2,n}$ and $K_{3,n}$ are stable. \item For any integer $k\geq0$, there exists an integer $N(k)\in \mathbb{N}$ such that $K_{m,m+k}$ is stable for all $m>N(k)$. \item For any rational $\ell> 1$, there exists an integer $N(\ell) \in \mathbb{N}$ such that whenever $m >N(\ell)$ and $\ell \cdot m$ is an integer, $K_{m, \ell \cdot m}$ is \textbf{not} stable. \end{itemize}
Tolin
Shane Rogers
トラベル Watch
Rico_Roswall
arXiv math.CO bot
Turn1Visuals
🌈 ☯️Teresita🐧👭
Torger Åge Sinnes