Além dessa, outras resoluções que irão regular o uso de IA durante o período eleitoral também foram aprovadas, como a proibição de indicação de candidatos por chatbots.
🔗 Veja outros pontos lá na rede vizinha: www.instagram.com/p/DVbkT4-k_n...
🔗 Veja outros pontos lá na rede vizinha: www.instagram.com/p/DVbkT4-k_n...
March 3, 2026 at 6:00 PM
Além dessa, outras resoluções que irão regular o uso de IA durante o período eleitoral também foram aprovadas, como a proibição de indicação de candidatos por chatbots.
🔗 Veja outros pontos lá na rede vizinha: www.instagram.com/p/DVbkT4-k_n...
🔗 Veja outros pontos lá na rede vizinha: www.instagram.com/p/DVbkT4-k_n...
February 13, 2024 at 1:11 PM
Als wir beieinander lagen,
so nah, so warm,
zufrieden,
schloss ich die Augen,
lauschte deinem Atem,
gedankenfrei,
als seiest du das Meer,
der Wind, das Blau.
k_n 03/22
so nah, so warm,
zufrieden,
schloss ich die Augen,
lauschte deinem Atem,
gedankenfrei,
als seiest du das Meer,
der Wind, das Blau.
k_n 03/22
December 21, 2023 at 11:36 PM
Als wir beieinander lagen,
so nah, so warm,
zufrieden,
schloss ich die Augen,
lauschte deinem Atem,
gedankenfrei,
als seiest du das Meer,
der Wind, das Blau.
k_n 03/22
so nah, so warm,
zufrieden,
schloss ich die Augen,
lauschte deinem Atem,
gedankenfrei,
als seiest du das Meer,
der Wind, das Blau.
k_n 03/22
> The point of this silly story: while Paul's mate's machine is producing things that I cannot construct myself, that's not because it is some kind of super-intellect. It's because the original problem is one where *a random choice works with high probability* www.jeremykun.com/2012/12/02/r...
Ramsey Number Lower Bound
Define the Ramsey number $ R(k,m)$ to be the minimum number $ n$ of vertices required of the complete graph $ K_n$ so that for any two-coloring (red, blue) of the edges of $ K_n$ one of two things wil...
www.jeremykun.com
September 25, 2026 at 1:01 AM
> The point of this silly story: while Paul's mate's machine is producing things that I cannot construct myself, that's not because it is some kind of super-intellect. It's because the original problem is one where *a random choice works with high probability* www.jeremykun.com/2012/12/02/r...
The D'Hondt method is a mathematically very elegant way of mapping the simplex {(x_0,…,x_n) : x_i real ≥ 0 and x_0 + ⋯ + x_n = 1} (representing vote proportions) to the discrete simplex {(k_0,…,k_n) : k_i integer ≥ 0 and k_0 + ⋯ + k_n = N} (representing allocations of N seats between n+1 lists). …
May 8, 2026 at 10:26 AM
The D'Hondt method is a mathematically very elegant way of mapping the simplex {(x_0,…,x_n) : x_i real ≥ 0 and x_0 + ⋯ + x_n = 1} (representing vote proportions) to the discrete simplex {(k_0,…,k_n) : k_i integer ≥ 0 and k_0 + ⋯ + k_n = N} (representing allocations of N seats between n+1 lists). …
Tales from the Hood 3 (2020) | Horror Anthology Review
youtu.be/k_N-iWfY1RE?...
#talesfromthehood3 #tonytodd #horroranthology #blackhorror #horror #BlackHistoryMonth
youtu.be/k_N-iWfY1RE?...
#talesfromthehood3 #tonytodd #horroranthology #blackhorror #horror #BlackHistoryMonth
February 29, 2024 at 4:41 PM
Tales from the Hood 3 (2020) | Horror Anthology Review
youtu.be/k_N-iWfY1RE?...
#talesfromthehood3 #tonytodd #horroranthology #blackhorror #horror #BlackHistoryMonth
youtu.be/k_N-iWfY1RE?...
#talesfromthehood3 #tonytodd #horroranthology #blackhorror #horror #BlackHistoryMonth
_e_s_e_e k_n _o_t
July 2, 2026 at 8:39 PM
_e_s_e_e k_n _o_t
… The mathematically shortest definition is that (outside of a measure 0 set of x) the half-ray {λ·x : λ>0} connecting the origin to the point x meets exactly one of the cubes [k_0, k_0+1] × [k_1, k_1+1] × ⋯ × [k_n, k_n+1] with k_0 + ⋯ + k_n = N, and you take those (k_0,…,k_n). …
May 8, 2026 at 10:26 AM
… The mathematically shortest definition is that (outside of a measure 0 set of x) the half-ray {λ·x : λ>0} connecting the origin to the point x meets exactly one of the cubes [k_0, k_0+1] × [k_1, k_1+1] × ⋯ × [k_n, k_n+1] with k_0 + ⋯ + k_n = N, and you take those (k_0,…,k_n). …
![Text:
Verträumt ging ich durch Sommerwiesen
und musste plötzlich heftig niesen,
weil zwei Pusteblumensamen
mir die Luft zum Atmen nahmen.
Die Sonne lachte wie ein Kind
und rief: "Das war der Sommerwind!"
Ich lachte mit, rieb mir die Nas'
und legte mich ins hohe Gras.
'Ne Hummel summte ganz ganz leise:
"Träum' dich auf eine kleine Reise
ins Wolkenweiß und Himmelblau."
Die Sonne meinte: "Ganz genau!"
Da raunte ein Zitronenfalter:
"Jetzt werde Mal nicht kitschig, Alter!"
[k_n / 20240516]](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:2lrodhd7xlqboc5tl3j6n3kv/bafkreicr65ypwmduniyqw4a4ummilj6wn64xknq2vg4pu2uci6ak5zcfmu)
PL_AS_ K_N G__ _H_ POIN_
July 30, 2026 at 5:19 PM
PL_AS_ K_N G__ _H_ POIN_
Ich werde meinen K_n erzählen, das sei Schleim-Jesus
December 29, 2025 at 10:59 AM
Ich werde meinen K_n erzählen, das sei Schleim-Jesus
(The technical question goes something like this: for each positive integer n, what is the smallest subgraph of the grid graph for which there exists a vertex partition whose resulting quotient graph is the complete graph K_n?)
November 17, 2025 at 6:38 AM
(The technical question goes something like this: for each positive integer n, what is the smallest subgraph of the grid graph for which there exists a vertex partition whose resulting quotient graph is the complete graph K_n?)
Well ok, Moore graphs do exist: for example, the complete graphs K_n (for n≥3) and the odd cycle graphs C_{2n+1} (for n≥1). So it would be nice to classify them!
Theorem (Hoffman-Singelton). Let G be a Moore graph of diameter 2. Then G has degree 2, 3, 7, or 57.
Theorem (Hoffman-Singelton). Let G be a Moore graph of diameter 2. Then G has degree 2, 3, 7, or 57.
August 23, 2025 at 1:45 PM
Well ok, Moore graphs do exist: for example, the complete graphs K_n (for n≥3) and the odd cycle graphs C_{2n+1} (for n≥1). So it would be nice to classify them!
Theorem (Hoffman-Singelton). Let G be a Moore graph of diameter 2. Then G has degree 2, 3, 7, or 57.
Theorem (Hoffman-Singelton). Let G be a Moore graph of diameter 2. Then G has degree 2, 3, 7, or 57.
"Management" is how you solve the problem of "it is exponentially inefficient for every contributor on an increasingly large project to talk to every other contributor." At a certain scale that's not possible. So instead of a K_n graph, you build a bunch of small components with managers as bridges.
March 12, 2025 at 6:05 AM
"Management" is how you solve the problem of "it is exponentially inefficient for every contributor on an increasingly large project to talk to every other contributor." At a certain scale that's not possible. So instead of a K_n graph, you build a bunch of small components with managers as bridges.
… One nice property of the D'Hondt method is that every region has the same measure in the simplex: if (x_0,…,x_n) is uniformly distributed, then (k_0,…,k_n) is uniformly distributed (“if you know nothing about the votes, you know nothing of the output”, or something). …
May 8, 2026 at 10:26 AM
… One nice property of the D'Hondt method is that every region has the same measure in the simplex: if (x_0,…,x_n) is uniformly distributed, then (k_0,…,k_n) is uniformly distributed (“if you know nothing about the votes, you know nothing of the output”, or something). …
Here's a math reason why there's no canonical choice:
In dimension n, a cyclic listing of all planes with consecutive entries sharing an axis is an Eulerian circuit in K_n, but K_4 has no Eulerian circuit as every vertex has degree 3 :)
In dimension n, a cyclic listing of all planes with consecutive entries sharing an axis is an Eulerian circuit in K_n, but K_4 has no Eulerian circuit as every vertex has degree 3 :)
August 6, 2026 at 3:14 PM
Here's a math reason why there's no canonical choice:
In dimension n, a cyclic listing of all planes with consecutive entries sharing an axis is an Eulerian circuit in K_n, but K_4 has no Eulerian circuit as every vertex has degree 3 :)
In dimension n, a cyclic listing of all planes with consecutive entries sharing an axis is an Eulerian circuit in K_n, but K_4 has no Eulerian circuit as every vertex has degree 3 :)
my intuition is that that's just going to emit iteration counts K_1, K_2, ... K_n, all of which you have to now track
also i suspect the compression (if e.g. you do binary digits of pi) requires storing index + offset otherwise decompression is ambiguous
also i suspect the compression (if e.g. you do binary digits of pi) requires storing index + offset otherwise decompression is ambiguous
August 26, 2026 at 2:08 PM
my intuition is that that's just going to emit iteration counts K_1, K_2, ... K_n, all of which you have to now track
also i suspect the compression (if e.g. you do binary digits of pi) requires storing index + offset otherwise decompression is ambiguous
also i suspect the compression (if e.g. you do binary digits of pi) requires storing index + offset otherwise decompression is ambiguous
After 78 years, an exponential improvement for Ramsey numbers were found by Jie Ma, Wujie Shen, and Shengjie Xie.
gilkalai.wordpress.com/2025/07/23/a...
gilkalai.wordpress.com/2025/07/23/a...
Amazing: Jie Ma, Wujie Shen, and Shengjie Xie Gave an Exponential Improvement for Ramsey Lower Bounds
h/t Benny Sudakov The Ramsey number R(ℓ,k) is the smallest integer n such that in any two-coloring of the edges of the complete graph on n vertices, $latex K_n$, by red and blue, there is either a …
gilkalai.wordpress.com
July 23, 2025 at 12:33 PM
After 78 years, an exponential improvement for Ramsey numbers were found by Jie Ma, Wujie Shen, and Shengjie Xie.
gilkalai.wordpress.com/2025/07/23/a...
gilkalai.wordpress.com/2025/07/23/a...
my class on discrete & algebraic structures this morning ended with a cliffhanger – a _mysterious_ observation that determinants of skew-symmetric n by n matrices seem related to perfect matchings in K_n, at least for n = 2, 3, 4.
maybe there is more to it... :-) #mathsky
maybe there is more to it... :-) #mathsky
November 22, 2024 at 1:48 PM
my class on discrete & algebraic structures this morning ended with a cliffhanger – a _mysterious_ observation that determinants of skew-symmetric n by n matrices seem related to perfect matchings in K_n, at least for n = 2, 3, 4.
maybe there is more to it... :-) #mathsky
maybe there is more to it... :-) #mathsky
positive integer $R(G, \mathbb{Z}_3)$ such that for every $n \geq R(G, \mathbb{Z}_3)$ and every edge-colouring $f$ of $K_n$ using $\mathbb{Z}_3$, there is a zero-sum copy of $G$ in $K_n$ coloured by $f$, that is: $\sum_{e [2/5 of https://arxiv.org/abs/2502.03864v1]
February 7, 2025 at 6:11 AM
positive integer $R(G, \mathbb{Z}_3)$ such that for every $n \geq R(G, \mathbb{Z}_3)$ and every edge-colouring $f$ of $K_n$ using $\mathbb{Z}_3$, there is a zero-sum copy of $G$ in $K_n$ coloured by $f$, that is: $\sum_{e [2/5 of https://arxiv.org/abs/2502.03864v1]
If the vertices of K_n are the possible paranthesizations of the n-ary product x0*x1*...*x_{n-1} then K_1 should have a single vertex x_0 and K_0 should have a single vertex ε (the empty product/identity). But if it's about using binary multiplication and not parenthesizing there are no vertices
November 3, 2023 at 6:42 PM
If the vertices of K_n are the possible paranthesizations of the n-ary product x0*x1*...*x_{n-1} then K_1 should have a single vertex x_0 and K_0 should have a single vertex ε (the empty product/identity). But if it's about using binary multiplication and not parenthesizing there are no vertices
もう一曲のyoutubeです(・ω・)ノ
乙女な恋心(闇深)な感じですw✨
#ボカコレ2026夏 #ボカコレ2026夏TOP100 #ボカコレ2026夏巡回
youtu.be/k_N-BWCLFf4?...
乙女な恋心(闇深)な感じですw✨
#ボカコレ2026夏 #ボカコレ2026夏TOP100 #ボカコレ2026夏巡回
youtu.be/k_N-BWCLFf4?...
フルカスタムドール / 初音ミク＆BGM子
YouTube video by BGM子のBGM
youtu.be
August 22, 2026 at 7:37 AM
もう一曲のyoutubeです(・ω・)ノ
乙女な恋心(闇深)な感じですw✨
#ボカコレ2026夏 #ボカコレ2026夏TOP100 #ボカコレ2026夏巡回
youtu.be/k_N-BWCLFf4?...
乙女な恋心(闇深)な感じですw✨
#ボカコレ2026夏 #ボカコレ2026夏TOP100 #ボカコレ2026夏巡回
youtu.be/k_N-BWCLFf4?...