Tootfinder

Hmm - as a frequent advocate for #Matrix and #Element, this is food for thought: https://マリウス.com/giving-up-on-element-

As brachiosaurus could reach a height of 1216 meters, eh? That's like a quarter of Mount Everest

Mehdi Hasan reminds us:
We are the majority
Worth a listen at full volume
https://x.com/mehdirhasan/status/1979627185439920443?s=12&t=JIzXmAfBKPksn8uWZp4aaA

Mehdi Hasan (@mehdirhasan) on X
‘There are more of us than there are of them. We are the majority!’ Watch my full speech at the DC ‘No Kings’ rally today.

The covering radius of Butson Hadamard codes for the homogeneous metric
Xingxing Xu, Minjia Shi, Patrick Sole
https://arxiv.org/abs/2508.12859 https://arxi…

The covering radius of Butson Hadamard codes for the homogeneous metric
Butson matrices are complex Hadamard matrices with entries in the complex roots of unity of given order. There is an interesting code in phase space related to this matrix (Armario et al. 2023). We study the covering radius of Butson Hadamard codes for the homogeneous metric, a metric defined uniquely, up to scaling, for a commutative ring alphabet that is Quasi Frobenius. An upper bound is derived by an orthogonal array argument. A lower bound relies on the existence of bent sequences in the s…

Midnight dreams #motorcycles

On Clip-On Power Meters for the UK: Review (2011) - Ban energy monsters and vampires from your home. What eats your cash? #frugal #cutCarbon -

On Clip-On Power Meters for the UK: Review (2011)
Ban energy monsters and vampires from your home. What eats your cash? #frugal #cutCarbon

Computing fault-tolerant metric dimension of graphs using their primary subgraphs
S. Prabhu, Sandi Klav\v{z}ar, K. Bharani Dharan, S. Radha
https://arxiv.org/abs/2509.14300 http…

Computing fault-tolerant metric dimension of graphs using their primary subgraphs
The metric dimension of a graph is the cardinality of a minimum resolving set, which is the set of vertices such that the distance representations of every vertex with respect to that set are unique. A fault-tolerant metric basis is a resolving set with a minimum cardinality that continues to resolve the graph even after the removal of any one of its vertices. The fault-tolerant metric dimension is the cardinality of such a fault-tolerant metric basis. In this article, we investigate the fault-…

Properties of the temporal transfer matrix in integrable Floquet circuits
Ilya Vilkoviskiy, Marirko Kirill
https://arxiv.org/abs/2508.13883 https://arxiv.o…

Properties of the temporal transfer matrix in integrable Floquet circuits
One possible approach to studying non-equilibrium dynamics is the so-called influence matrix (IM) formalism. The influence matrix can be viewed as a quantum state that encodes complete information about the non-equilibrium dynamics of a boundary degree of freedom. It has been shown that the IM is the unique stationary point of the temporal transfer matrix. This transfer matrix, however, is non-diagonalizable and exhibits a non-trivial Jordan block structure. In this article, we demonstrate that…

“The working class abandoned the Democratic Party, primarily because the Democratic Party abandoned the working class.”
✅ Control of the Senate Could Be Decided in Maine. This Oyster Farmer Is Vying to Unseat Susan Collins. – Mother Jones
https://www.motherjones.com/politics/20…

Control of the Senate could be decided in Maine. This oyster farmer is vying to unseat Susan Collins
Marine and Army veteran Graham Platner dives into one of the most closely watched races of 2026.

On the Metric Dimension of Generalized Petersen Graphs $P(n,3)$
Rui Gao, Yingqing Xiao, Zhanqi Zhang
https://arxiv.org/abs/2508.12224 https://arxiv.org/pdf…

On the Metric Dimension of Generalized Petersen Graphs $P(n,3)$
The metric dimension of a graph $G$ is defined as the minimum number of vertices in a subset $S\subset V(G)$ such that all other vertices are uniquely determined by their distances to the vertices in $S$, and is denoted by $\dim(G)$. In this paper, we study the metric dimension of generalized Petersen graphs $P(n,3)$. The notions of good and bad vertices, which are introduced in Imran et al. (2014, Ars. Combinatoria 117, 113-130), are instrumental in determining the lower bound of the metric di…