Sourayan Banerjee, Amit Kuber: Model-theoretic $K_1$ for modules over semisimple rings: (weak) Morita invariance https://arxiv.org/abs/2511.05180 https://arxiv.org/pdf/2511.05180 https://arxiv.org/html/2511.05180
November 10, 2025 at 6:39 AM
Sourayan Banerjee, Amit Kuber: Model-theoretic $K_1$ for modules over semisimple rings: (weak) Morita invariance https://arxiv.org/abs/2511.05180 https://arxiv.org/pdf/2511.05180 https://arxiv.org/html/2511.05180
Sourayan Banerjee, Amit Kuber
Model-theoretic $K_1$ for modules over semisimple rings: (weak) Morita invariance
https://arxiv.org/abs/2511.05180
Model-theoretic $K_1$ for modules over semisimple rings: (weak) Morita invariance
https://arxiv.org/abs/2511.05180
November 10, 2025 at 5:43 AM
Sourayan Banerjee, Amit Kuber
Model-theoretic $K_1$ for modules over semisimple rings: (weak) Morita invariance
https://arxiv.org/abs/2511.05180
Model-theoretic $K_1$ for modules over semisimple rings: (weak) Morita invariance
https://arxiv.org/abs/2511.05180
Ming Ng: $K_1(Var)$ is presented by stratified birational equivalences https://arxiv.org/abs/2510.20433 https://arxiv.org/pdf/2510.20433 https://arxiv.org/html/2510.20433
October 24, 2025 at 6:38 AM
Ming Ng: $K_1(Var)$ is presented by stratified birational equivalences https://arxiv.org/abs/2510.20433 https://arxiv.org/pdf/2510.20433 https://arxiv.org/html/2510.20433
Ming Ng
$K_1(Var)$ is presented by stratified birational equivalences
https://arxiv.org/abs/2510.20433
$K_1(Var)$ is presented by stratified birational equivalences
https://arxiv.org/abs/2510.20433
October 24, 2025 at 4:19 AM
Ming Ng
$K_1(Var)$ is presented by stratified birational equivalences
https://arxiv.org/abs/2510.20433
$K_1(Var)$ is presented by stratified birational equivalences
https://arxiv.org/abs/2510.20433
Yuqing Ji, Yue Wang, Yujun Yang, Xia Zhang: Odd clique minors and chromatic bounds of {3$K_1$, paraglider}-free graphs https://arxiv.org/abs/2509.00929 https://arxiv.org/pdf/2509.00929 https://arxiv.org/html/2509.00929
September 3, 2025 at 6:37 AM
Yuqing Ji, Yue Wang, Yujun Yang, Xia Zhang: Odd clique minors and chromatic bounds of {3$K_1$, paraglider}-free graphs https://arxiv.org/abs/2509.00929 https://arxiv.org/pdf/2509.00929 https://arxiv.org/html/2509.00929
I was just showing @kaliagainstallodds.mastodon.social.ap.brid.gy the generalisation of the Verhulst/logistic equation Ugo Bardi showed me in the context of Bardi going anti-vaxx & it now occurs to me that a more complete picture would predict a vastly more dramatic collapse.
August 30, 2025 at 8:50 PM
I was just showing @kaliagainstallodds.mastodon.social.ap.brid.gy the generalisation of the Verhulst/logistic equation Ugo Bardi showed me in the context of Bardi going anti-vaxx & it now occurs to me that a more complete picture would predict a vastly more dramatic collapse.
8/17お品書き - アシダリオンＫ_1｜アシダリオンＫ xfolio.jp/portfolio/as... #クロスフォリオ
8/17お品書き - アシダリオンＫ_1
8/17夏インテのお品書きです。
xfolio.jp
August 17, 2025 at 2:24 AM
8/17お品書き - アシダリオンＫ_1｜アシダリオンＫ xfolio.jp/portfolio/as... #クロスフォリオ
i'm too obsessed with this song
music.youtube.com/watch?v=-K_1...
music.youtube.com/watch?v=-K_1...
EXTRA VIRGIN (EXTRA VIRGIN)
YouTube video by YOON SAN-HA (ASTRO) - Topic
music.youtube.com
July 17, 2025 at 6:59 PM
i'm too obsessed with this song
music.youtube.com/watch?v=-K_1...
music.youtube.com/watch?v=-K_1...
integers with $k_1\le k_2$. In this paper, it is proved that $\{ n : r(n)=0\} $ contains an infinite arithmetic progression, and both sets $\{ n : r(n)=1\} $ and $\{ n : r(n)\ge 2\}$ have positive asymptotic densities. [2/2 of https://arxiv.org/abs/2506.03631v1]
June 5, 2025 at 6:05 AM
integers with $k_1\le k_2$. In this paper, it is proved that $\{ n : r(n)=0\} $ contains an infinite arithmetic progression, and both sets $\{ n : r(n)=1\} $ and $\{ n : r(n)\ge 2\}$ have positive asymptotic densities. [2/2 of https://arxiv.org/abs/2506.03631v1]
arXiv:2506.03631v1 Announce Type: new
Abstract: Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative [1/2 of https://arxiv.org/abs/2506.03631v1]
Abstract: Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative [1/2 of https://arxiv.org/abs/2506.03631v1]
June 5, 2025 at 6:05 AM
arXiv:2506.03631v1 Announce Type: new
Abstract: Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative [1/2 of https://arxiv.org/abs/2506.03631v1]
Abstract: Let $\{f_n\}$ be the Fibonacci sequence. For any positive integer $n$, let $r(n)$ be the number of solutions of $n=p+f_{k_1^{2}} +f_{k_{2}^{2}}$, where $p$ is a prime and $k_1, k_2$ are nonnegative [1/2 of https://arxiv.org/abs/2506.03631v1]
$\F_p$. We assume that $K$ is algebraically closed in $F$. We give general results on the descent over the fields $k= \F_{p^t}$ for $t$ dividing $n$. Then, we completely handle the bi-cyclic case of the descent over the fields $k_1=\F_{p}$ and $k_2= [2/3 of https://arxiv.org/abs/2505.21656v1]
May 29, 2025 at 6:04 AM
$\F_p$. We assume that $K$ is algebraically closed in $F$. We give general results on the descent over the fields $k= \F_{p^t}$ for $t$ dividing $n$. Then, we completely handle the bi-cyclic case of the descent over the fields $k_1=\F_{p}$ and $k_2= [2/3 of https://arxiv.org/abs/2505.21656v1]
hard-thresholded nonlinear statistics of the adjacency matrix, the analysis of which may be of independent interest. In contrast with previous work, our non-asymptotic upper and lower bounds match for any configuration of $n_1,n_2, k_1,k_2$. [5/5 of https://arxiv.org/abs/2505.18372v1]
May 27, 2025 at 6:06 AM
hard-thresholded nonlinear statistics of the adjacency matrix, the analysis of which may be of independent interest. In contrast with previous work, our non-asymptotic upper and lower bounds match for any configuration of $n_1,n_2, k_1,k_2$. [5/5 of https://arxiv.org/abs/2505.18372v1]
a bipartite Erd\H{o}s-Renyi distribution with connection probability $p_0$. Under the alternative hypothesis, there exists an unknown bipartite subgraph of size $k_1 \times k_2$ in which edges appear with probability $p_1 = p_0 + \delta$ for some [2/5 of https://arxiv.org/abs/2505.18372v1]
May 27, 2025 at 6:06 AM
a bipartite Erd\H{o}s-Renyi distribution with connection probability $p_0$. Under the alternative hypothesis, there exists an unknown bipartite subgraph of size $k_1 \times k_2$ in which edges appear with probability $p_1 = p_0 + \delta$ for some [2/5 of https://arxiv.org/abs/2505.18372v1]
In classical coding theory, for two linear codes with parameters $[n_1, k_1, d_1]$ and $[n_2, k_2, d_2]$, it seems well know that their tensor product code has the parameters $[n_1n_2, k_1k_2, d_1d_2]$. (See definition 6 of www.cs.purdue.edu/homes/pvalia...)
www.cs.purdue.edu
May 20, 2025 at 12:46 AM
In classical coding theory, for two linear codes with parameters $[n_1, k_1, d_1]$ and $[n_2, k_2, d_2]$, it seems well know that their tensor product code has the parameters $[n_1n_2, k_1k_2, d_1d_2]$. (See definition 6 of www.cs.purdue.edu/homes/pvalia...)
$k_1+k_2+1$ is composite, no lattice tiling of $\mathbb{Z}^n$ by the error ball $\mathcal{B}(n,2,k_1,k_2)$ exists for sufficiently large $n$. [3/3 of https://arxiv.org/abs/2505.08495v1]
May 14, 2025 at 6:04 AM
$k_1+k_2+1$ is composite, no lattice tiling of $\mathbb{Z}^n$ by the error ball $\mathcal{B}(n,2,k_1,k_2)$ exists for sufficiently large $n$. [3/3 of https://arxiv.org/abs/2505.08495v1]
establish three main results. First, we fully determine the existence of lattice tilings by $\mathcal{B}(n,2,3,0)$ in all dimensions $n$. Second, we completely resolve the case $k_1=k_2+1$. Finally, we prove that for any integers $k_1>k_2\ge0$ where [2/3 of https://arxiv.org/abs/2505.08495v1]
May 14, 2025 at 6:04 AM
establish three main results. First, we fully determine the existence of lattice tilings by $\mathcal{B}(n,2,3,0)$ in all dimensions $n$. Second, we completely resolve the case $k_1=k_2+1$. Finally, we prove that for any integers $k_1>k_2\ge0$ where [2/3 of https://arxiv.org/abs/2505.08495v1]
Ka Hin Leung, Ran Tao, Daohua Wang, Tao Zhang: On lattice tilings of $\mathbb{Z}^n$ by limited magnitude error balls $\mathcal{B}(n,2,k_{1},k_{2})$ with $k_1>k_2$ https://arxiv.org/abs/2505.08495 https://arxiv.org/pdf/2505.08495 https://arxiv.org/html/2505.08495
May 14, 2025 at 6:04 AM
Ka Hin Leung, Ran Tao, Daohua Wang, Tao Zhang: On lattice tilings of $\mathbb{Z}^n$ by limited magnitude error balls $\mathcal{B}(n,2,k_{1},k_{2})$ with $k_1>k_2$ https://arxiv.org/abs/2505.08495 https://arxiv.org/pdf/2505.08495 https://arxiv.org/html/2505.08495
where $\alpha(H)\le 2$ and $H$ is an induced subgraph of $K_1 + P_4$, $K_2+(K_1\cup K_3)$, $K_1+(K_1\cup K_4)$, $K_7^-$, $K_7$, or the kite graph. [6/6 of https://arxiv.org/abs/2505.07727v1]
May 13, 2025 at 6:06 AM
where $\alpha(H)\le 2$ and $H$ is an induced subgraph of $K_1 + P_4$, $K_2+(K_1\cup K_3)$, $K_1+(K_1\cup K_4)$, $K_7^-$, $K_7$, or the kite graph. [6/6 of https://arxiv.org/abs/2505.07727v1]
arXiv:2505.07221v1 Announce Type: new
Abstract: We prove that every multiple zeta value is a $\mathbb{Z}$-linear combination of $\zeta(k_1,\dots, k_r)$ where $k_i\geq 2$. Our proof also yields an explicit algorithm for such an expansion. The key [1/2 of https://arxiv.org/abs/2505.07221v1]
Abstract: We prove that every multiple zeta value is a $\mathbb{Z}$-linear combination of $\zeta(k_1,\dots, k_r)$ where $k_i\geq 2$. Our proof also yields an explicit algorithm for such an expansion. The key [1/2 of https://arxiv.org/abs/2505.07221v1]
May 13, 2025 at 6:05 AM
arXiv:2505.07221v1 Announce Type: new
Abstract: We prove that every multiple zeta value is a $\mathbb{Z}$-linear combination of $\zeta(k_1,\dots, k_r)$ where $k_i\geq 2$. Our proof also yields an explicit algorithm for such an expansion. The key [1/2 of https://arxiv.org/abs/2505.07221v1]
Abstract: We prove that every multiple zeta value is a $\mathbb{Z}$-linear combination of $\zeta(k_1,\dots, k_r)$ where $k_i\geq 2$. Our proof also yields an explicit algorithm for such an expansion. The key [1/2 of https://arxiv.org/abs/2505.07221v1]
Annahme …
Schwingungsfrequenz f umgekehrt proportional zur Masse ist (f = \frac{k_1}{M}) und dass die Entropie eines Systems quadratisch mit der Masse wächst (S = k_2 M^2), ergibt sich durch Einsetzen eine Abhängigkeit der Frequenz von der Entropie.🖖
Schwingungsfrequenz f umgekehrt proportional zur Masse ist (f = \frac{k_1}{M}) und dass die Entropie eines Systems quadratisch mit der Masse wächst (S = k_2 M^2), ergibt sich durch Einsetzen eine Abhängigkeit der Frequenz von der Entropie.🖖
May 10, 2025 at 3:47 PM
Annahme …
Schwingungsfrequenz f umgekehrt proportional zur Masse ist (f = \frac{k_1}{M}) und dass die Entropie eines Systems quadratisch mit der Masse wächst (S = k_2 M^2), ergibt sich durch Einsetzen eine Abhängigkeit der Frequenz von der Entropie.🖖
Schwingungsfrequenz f umgekehrt proportional zur Masse ist (f = \frac{k_1}{M}) und dass die Entropie eines Systems quadratisch mit der Masse wächst (S = k_2 M^2), ergibt sich durch Einsetzen eine Abhängigkeit der Frequenz von der Entropie.🖖
arXiv:2505.04011v1 Announce Type: new
Abstract: This paper establishes the existence of a $C^*$-diagonal in the inductive limit of 1-dimensional NCCW complexes with trivial $K_1$-groups. It also examines some limitations and implications of [1/2 of https://arxiv.org/abs/2505.04011v1]
Abstract: This paper establishes the existence of a $C^*$-diagonal in the inductive limit of 1-dimensional NCCW complexes with trivial $K_1$-groups. It also examines some limitations and implications of [1/2 of https://arxiv.org/abs/2505.04011v1]
May 8, 2025 at 6:04 AM
arXiv:2505.04011v1 Announce Type: new
Abstract: This paper establishes the existence of a $C^*$-diagonal in the inductive limit of 1-dimensional NCCW complexes with trivial $K_1$-groups. It also examines some limitations and implications of [1/2 of https://arxiv.org/abs/2505.04011v1]
Abstract: This paper establishes the existence of a $C^*$-diagonal in the inductive limit of 1-dimensional NCCW complexes with trivial $K_1$-groups. It also examines some limitations and implications of [1/2 of https://arxiv.org/abs/2505.04011v1]
conjectured that fork-free graphs are perfectly divisible, and they proved that each (fork, co-cricket)-free graph is either claw-free or perfectly divisible. In this paper, we show that every (fork, {\em antifork}$\cup K_1$)-free graph is perfectly [3/4 of https://arxiv.org/abs/2505.04429v1]
May 8, 2025 at 6:04 AM
conjectured that fork-free graphs are perfectly divisible, and they proved that each (fork, co-cricket)-free graph is either claw-free or perfectly divisible. In this paper, we show that every (fork, {\em antifork}$\cup K_1$)-free graph is perfectly [3/4 of https://arxiv.org/abs/2505.04429v1]
arXiv:2505.04429v1 Announce Type: new
Abstract: A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ [1/4 of https://arxiv.org/abs/2505.04429v1]
Abstract: A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ [1/4 of https://arxiv.org/abs/2505.04429v1]
May 8, 2025 at 6:04 AM
arXiv:2505.04429v1 Announce Type: new
Abstract: A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ [1/4 of https://arxiv.org/abs/2505.04429v1]
Abstract: A {\em fork} is a graph obtained from $K_{1,3}$ (usually called {\em claw}) by subdividing an edge once, an {\em antifork} is the complement graph of a fork, and a {\em co-cricket} is a union of $K_1$ [1/4 of https://arxiv.org/abs/2505.04429v1]