Tootfinder

Perfect tilings with the generalised triangle in $k$-graphs
Weichan Liu, Xiangxiang Nie, Donglei Yang, Lin-Peng Zhang
https://arxiv.org/abs/2508.12311 https://

Perfect tilings with the generalised triangle in $k$-graphs
Denote by $T_k$ the generalised triangle, a $k$-uniform hypergraph on vertex set $\{1,2,\dots,2k-1\}$ with three edges $\{1,\dots,k-1,k\}$,$\{1,\dots,k-1,k+1\}$ and $\{k,k+1,\dots,2k-1\}$. Recently, Bowtell, Kathapurkar, Morrison and Mycroft [arXiv: 2505.05606] established the exact minimum codegree threshold for perfect $T_3$-tilings in $3$-graphs. In this paper, we extend their result to all $k \geq 3$, determining the optimal minimum codegree threshold for perfect $T_k$-tilings in $k$-graphs…

Unfortunately, standards work may be a function of who has the biggest platform for social media polls (that maybe pre-judge the outcome).
I’m hoping those who work in or near #accessibility can offer some feedback to more fundamental, not pre-judged, questions here:

Indirect CW for teen pregnancy, rape, death.
Just finished "Girls Like Us" by Randi Pink. Pink has a knack for telling stories that capture the grim but also vibrant nuances of African-American history. I previously read "Under the Heron's Light" which has more elements of magical realism and connects more directly to the history of enslavement; "Girls Like Us" is more historical fiction, with a bridge at the end to contemporary times (circa 2019, when the book was published). It tells the story of a disparate group of mostly-Black teens who are pregnant in 1972, and shows a range of different outcomes as varied as the backstories of the different girls. Rather than just separate vignettes, the girls' stories are women together into a single plot, and Pink is a expert at pulling us in to deeply contemplate all the complexities of these girls' lives, showing rather than telling us truths about the politics of teen pregnancy and abortion, and how even though the choices involved don't have simple answers, taking those choices out of the hands of the people they most intimately affect is cruel and deadly.
#AmReading #ReadingNow

Segmenting Thalamic Nuclei: T1 Maps Provide a Reliable and Efficient Solution
Anqi Feng, Zhangxing Bian, Samuel W. Remedios, Savannah P. Hays, Blake E. Dewey, Jiachen Zhuo, Dan Benjamini, Jerry L. Prince
https://arxiv.org/abs/2508.12508

Segmenting Thalamic Nuclei: T1 Maps Provide a Reliable and Efficient Solution
Accurate thalamic nuclei segmentation is crucial for understanding neurological diseases, brain functions, and guiding clinical interventions. However, the optimal inputs for segmentation remain unclear. This study systematically evaluates multiple MRI contrasts, including MPRAGE and FGATIR sequences, quantitative PD and T1 maps, and multiple T1-weighted images at different inversion times (multi-TI), to determine the most effective inputs. For multi-TI images, we employ a gradient-based salien…

from my link log —
paneru: A sliding, tiling window manager for MacOS.
https://github.com/karinushka/paneru
saved 2025-10-16 https://dotat.at/:/95A…

GitHub - karinushka/paneru: A sliding, tiling window manager for MacOS.
A sliding, tiling window manager for MacOS. Contribute to karinushka/paneru development by creating an account on GitHub.

@… tooling that requires updates when web standards add new features is so risky!

The moss on the tree does not fear the talons of the hawk.

I confounded a British friend by telling them a popular local morning radio jingle of my childhood was “Danny moves your fanny.”
Attached is one variant, but this is the one I recall best (no audio): https://www.reddit.com/r/Buffalo/comments/1618sls/comment/jxttpyn/…

Undecidability of Translational Tiling with 2 Polycubes
Yoonhu Kim
https://arxiv.org/abs/2508.11725 https://arxiv.org/pdf/2508.11725

Undecidability of Translational Tiling with 2 Polycubes
In this paper, we prove that it is undecidable whether a set of two polycubes can tile $\mathbb{Z}^3$ by translation. The proof involves a new technique that allows us to simulate two disconnected polycubes with two connected polycubes. By expanding this technique to higher dimensions, we also prove that a set of disconnected tiles in $\mathbb{Z}^n$ can be simulated by the same number of connected tiles in $\mathbb{Z}^n$ for $n \geq 3$.

A reflection principle for nonintersecting paths and lozenge tilings with free boundaries
Seok Hyun Byun
https://arxiv.org/abs/2508.12135 https://arxiv.org…

A reflection principle for nonintersecting paths and lozenge tilings with free boundaries
Okada and Stembridge's Pfaffian formula for the enumeration of families of nonintersecting paths with fixed starting points and unfixed ending points has been widely used to resolve many challenging problems in enumerative combinatorics. In this paper, we present a new formula that complements Okada and Stembridge's Pfaffian formula. The proof is based on a formula for the square of the sum of maximum minors of matrices obtained from Okada's formula. The combinatorial interpretation of the new …