Tootfinder

I'll bet $1000 right now, #Trump & #StephenMiller's next target are #Asians.
Just watch. Bannon's already complained about "Asian CEOs".
☑️ Trump’s chief strateg…

Trump’s chief strategist Steve Bannon suggests having too many Asian tech CEOs undermines ‘civic society’

Das #Rezept des Tages:
Süß, cremig, würzig – dieses #Curry mit Banane hat einen leckeren, exotischen Geschmack. Ähnlich wie bei den #Bananenpfannkuchen (findet ihr über die Suche) ist dies…

Exotisches Bananen-Curry mit Ananas und Sojaschnetzel
Du liebst süß-würzige Gerichte? Dann probier dieses cremige Curry mit Banane, Ananas und Sojaschnetzel – einfach, exotisch und schnell gemacht!

This https://arxiv.org/abs/2506.01870 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Various irrational series involving binomial coefficients
Motivated by Galois theory, we propose some new irrational series of Ramanujan's type or Zeilberger's type. For example, we conjecture that \begin{equation*}\sum_{k=1}^\infty\frac{\binom{2k}k^2\binom{4k}{2k}}{(84-32\sqrt6)^{4k}} \left(280k+5\sqrt6+26\right)=\frac3π(2\sqrt3+33\sqrt2) \end{equation*} and \begin{align*}&\sum_{k=1}^\infty\frac{(27(37102-15147\sqrt6))^k}{k^3\binom{2k}k^2\binom{3k}k} \left(9k(11\sqrt6+51)-2(19\sqrt6+54)\right) \\&\qquad=\frac{5625}2\left(\sqrt6 L_{-24}(2)-3G\r…

'Paid insurrectionists': Amid unrest in L.A, Trump returns to an unsettling old favorite (Steve Benen/MSNBC)
https://www.msnbc.com/rachel-maddow-show/maddowblog/paid-insurrectionists-unrest-l-trump-returns-unsettling-old-favorite-rcna212142
http://www.memeorandum.com/250610/p99#a250610p99

Skończyłem czytać Szpony i kły. Mogę z czystym sercem polecić choć nie jest to oficjalna książka z serii #Wiedźmin Sapkowskiego. 11 czy 12 opowiadań i chyba wszystkie mi się podobały 😉 Chyba po prostu jestem niepoprawnym fanem uniwersum i lubię zanurzać się w tym świecie.

playing prague | Prague City Tourism - https://prague.eu/en/playing-prague/?utm_source=charlesgames.beehiiv.com&utm_medium=newsl…

playing prague | Prague City Tourism
Playing Prague is a game celebrating Prague and all those who have shaped and continue to shape this beautiful city. Every detail of the game is a tribute to the 1000-year cultural heritage of a city that was once the seat of the Holy Roman Emperors and the capital of the Bohemian Kingdom. It is also the origin of the designation of bohemians as people with a creative and unconventional way of life. Become a Bohemian for a while and build your own Prague.

Infinite induced-saturated graphs
Marthe Bonamy, Carla Groenland, Tom Johnston, Natasha Morrison, Alex Scott
https://arxiv.org/abs/2506.08810 https://

Infinite induced-saturated graphs
A graph $G$ is $H$-induced-saturated if $G$ is $H$-free but deleting any edge or adding any edge creates an induced copy of $H$. There are various graphs $H$, such as $P_4$, for which no finite $H$-induced-saturated graph $G$ exists. We show that for every finite graph $H$ that is not a clique or stable set, there always exists a countable $H$-induced-saturated graph. In fact, a stronger property can be achieved: there is an $H$-free graph $G$ such that $G'$ contains a copy of $H$ whenever $G'\…

We Are AI: Taking Control of Technology
Julia Stoyanovich, Armanda Lewis, Eric Corbett, Lucius E. J. Bynum, Lucas Rosenblatt, Falaah Arif Khan
https://arxiv.org/abs/2506.08117

We Are AI: Taking Control of Technology
Responsible AI (RAI) is the science and practice of ensuring the design, development, use, and oversight of AI are socially sustainable--benefiting diverse stakeholders while controlling the risks. Achieving this goal requires active engagement and participation from the broader public. This paper introduces "We are AI: Taking Control of Technology," a public education course that brings the topics of AI and RAI to the general audience in a peer-learning setting. We outline the goals behind t…

This https://arxiv.org/abs/2506.01291 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

The Hasse principle for homogeneous polynomials with random coefficients over thin sets II
Let $d$ and $n$ be natural numbers. Let $ν_{d,n}: \mathbb{R}^n\rightarrow \mathbb{R}^{N}$ denote the Veronese embedding with $N=N_{n,d}:=\binom{n+d-1}{d}$, defined by listing all the monomials of degree $d$ in $n$ variables using the lexicographical ordering. Let $\langle \boldsymbol{a}, ν_{d,n}(\boldsymbol{x})\rangle\in \mathbb{Z}[\boldsymbol{x}]$ be a homogeneous polynomial in $n$ variables of degree $d$ with integer coefficients $\boldsymbol{a}$, where $\langle\cdot,\cdot\rangle$ denotes t…

On saturation numbers of complete multipartite graphs and even cycles
Ali Mohammadian, Milad Poursoltani, Behruz Tayfeh-Rezaie
https://arxiv.org/abs/2506.09767

On saturation numbers of complete multipartite graphs and even cycles
Given positive integer $n$ and graph $F$, the saturation number $\mathrm{sat}(n, F)$ is the minimum number of edges in an edge-maximal $F$-free graph on $n$ vertices. In this paper, we determine asymptotic behavior of $\mathrm{sat}(n, F)$ when $F$ is either a complete multipartite graph or a cycle graph whose length is even and large enough. This extends a result by Bohman, Fonoberova, and Pikhurko from 2010 as well as partially resolves a conjecture of Füredi and Kim from 2013.