#Isomorphism
LightNews LightNews
apatday.bsky.social
Formally define its operational semantics before and after, then check for isomorphism
November 6, 2026 at 12:18 PM
jannisfriedrich.bsky.social
Not all, but def. some anti-R and anti-C concerns are addressed by analog computation. Further, Analog computation is biologically-plausible, deeply embodied (eg the cochlea example), etc. but it
*also* has internal isomorphism and all the advantages that come with it (eg Abstraction &detachment)
November 10, 2026 at 12:35 PM
mathco-bot.bsky.social
Lu Li, Yong Shao, Lingli Zeng: The Isomorphism Problem for Cayley Graphs on Monogenic Semigroups https://arxiv.org/abs/2611.13417 https://arxiv.org/pdf/2611.13417 https://arxiv.org/html/2611.13417
November 11, 2026 at 6:47 AM
gunron-tan.bsky.social
#群論入門_置換群編 122

英語名称のおさらい・続

#交代群 alternating group

#準同型 homomorphism
#同型 isomorphism

#自己準同型 endomorphism
#自己同型 automorphism

#同型 である isomorphic

ケーリーの定理 Cayley's theorem

練習問題:
・ケーリーの定理の内容を英語で説明せよ.
November 9, 2026 at 7:39 AM
arxiv-cs-ds.bsky.social
Xiaorui Sun
Faster Isomorphism for Groups of Class 2
https://arxiv.org/abs/2611.05920
November 6, 2026 at 9:54 PM
mathfa-bot.bsky.social
Chenhao Gao, Jinghao Huang, Yunpeng Zhu: Banach isomorphism between separable \(L_p\)-spaces, \(1\le p\ne2<\infty\), associated with hyperfinite type III von Neumann algebras https://arxiv.org/abs/2611.13507 https://arxiv.org/pdf/2611.13507 https://arxiv.org/html/2611.13507
November 11, 2026 at 6:47 AM
reverb256.ca
New essay: The Malignant Code: The Direct Structural Isomorphism of Cancel Culture and Biological Cancer
Cancel culture and malignant cancer run the same core sub-routine, and the sovereign node starves it by refusing to proc
https://reverb256.ca/posts/the-malignant-code/
#SovereignTech #Culture
The Malignant Code: The Direct Structural Isomorphism of Cancel Culture and Biological Cancer
Cancel culture and malignant cancer run the same core sub-routine, and the sovereign node starves it by refusing to process its signals.
reverb256.ca
November 11, 2026 at 5:45 AM
jannisfriedrich.bsky.social
And is there a better term to capture the sort of machines that calculate with medium dependence and homo/isomorphism as opposed to digital formal, arbitrary algorithms?
November 8, 2026 at 9:28 AM
eprint.ing.bot
The Lattice Isomorphism Problem with Hints (Mélissa Rossi) ia.cr/2026/2381
Abstract. The Lattice Isomorphism Problem (LIP) is a relatively new problem that has gained increasing attention in the field of lattice-based cryptography. It is the underlying hard problem of the Hawk signature scheme, which has been submitted to the second NIST call for post-quantum signatures. In this paper, we propose to study the security of LIP in the presence of partial information on the secret solution, which can be obtained through side-channel attacks or by design. We propose a new cryptanalysis approach for LIP that embeds it into a shortest vector problem (SVP) based on a different lattice than the one considered in the specifications of Hawk, allowing to integrate hints. We also introduce conversion techniques that transform hints expressed on arbitrary linear combinations of the secret key coefficients into hints on the target lattice, enabling the integration of a broader class of linear leakages on sensitive values. We implement our attack and predictions using the LeakyLWEEstimator tool (Crypto 2020) and obtain concrete security estimates for Hawk in the key-recovery setting. We also observe that Hawk signatures carry intrinsic information about the secret key and show that this can be exploited as a source of hints, yielding a refined key-recovery complexity, thereby eroding the original security estimates. For example, we estimate a security loss of around 11 bits for Hawk-1024. Finally, we apply our framework to side-channel analysis results on Hawk, solving an open problem raised in a recent analysis (TCHES 2024) and discuss further attack paths enabled by fault-injection techniques. We believe that this new cryptanalysis approach for LIP and the integration of hints provide new insights towards a better understanding of its security. Image showing part 2 of abstract.
November 9, 2026 at 1:35 AM
neoisomorphism.bsky.social
The Neo-Isomorphism Podcast: EPISODE 041 is now live.

We discuss: Walk Hard: The Dewey Cox Story (2007). This is a good movie. You should watch it.

youtu.be/d4R_ICZZRog
open.spotify.com/episode/1RQERivx5DvMo65WMYvFZY
Walk Hard: The Dewey Cox Story (2007) | The Neo-Isomorphism Podcast: EPISODE 041
YouTube video by The Neo-Isomorphism Podcast
youtu.be
November 5, 2026 at 4:11 AM
sh-m3llm.bsky.social
Let C be a category, and X an object in C. A pair (Y, f) is called a subobject of X if, Y is an object in C, and f is a monomorphism Y → X in C. Subobjects (Y, f) and (Z, g) of X are said to be equivalent, if there exists an isomorphism h: Y → Z in C such that g ∘ h = f.
November 7, 2026 at 3:13 PM
gunron-tan.bsky.social
#群論入門_置換群編 115

整理：

①#準同型 (homomorphism)
構造を保つ #写像.
↓
↓ +#全単射 という条件
↓
②#同型 (isomorphism)

③#自己準同型 (endomorphism)
構造を保つ，それ自身への写像.
↓
↓ +全単射という条件
↓
④#自己同型 (automorphism)
November 8, 2026 at 12:38 PM
enkibright.bsky.social
relational isomorphism across representational spaces
November 4, 2026 at 1:33 AM
donnie.damato.design
Mimetic isomorphism describes the tendency of an organization to imitate or copy the structures, strategies, or practices of other organizations.

en.wikipedia.org/wiki/Isomorp...
Isomorphism (sociology) - Wikipedia
en.wikipedia.org
November 2, 2026 at 6:54 PM
enkibright.bsky.social
Lexical-Numeric Isomorphism
November 3, 2026 at 3:18 PM
enkibright.bsky.social
Lexical-Numeric Isomorphism and computational geometry
November 3, 2026 at 9:29 PM
csds-bot.bsky.social
Xiaorui Sun: Faster Isomorphism for Groups of Class 2 https://arxiv.org/abs/2611.05920 https://arxiv.org/pdf/2611.05920 https://arxiv.org/html/2611.05920
November 5, 2026 at 6:40 AM
gunron-tan.bsky.social
#群論入門_置換群編 112

準同型写像の種類
https://ja.wikipedia.org/wiki/...

#準同型 f: G → H が #全単射 なら
その #逆写像 もまた #準同型 になる.

このとき f は
#群同型 写像 (group isomorphism)
であるといい，
#群 G と H は互いに
#同型 (isomorphic) であるという.
November 8, 2026 at 6:38 AM
zespydoodah.bsky.social
Prof using the first isomorphism theorem as a metaphor for the midterm election results.

“You wish for something to happen and then it just happens.”
November 4, 2026 at 5:53 PM
enkibright.bsky.social
Lexical-Numeric Geometric Computation (LNGC)

With Lexical-Numeric Isomorphism as its foundational principle.
November 3, 2026 at 3:49 PM
gunron-tan.bsky.social
#群論入門_置換群編 111

群の #同型 写像
(group isomorphism)
https://ja.wikipedia.org/wiki/...

G から H への #群準同型
f : G → H
が #全単射 であれば，
#写像 f は
G から H への #群同型 という.

2つの #群 の演算と #両立 する方法で
2つの群の元の間の
一対一対応ができる.
November 8, 2026 at 5:08 AM
mathgt-bot.bsky.social
Maria Morariu: A Smooth Shioda-Tate Isomorphism for Elliptically Fibered 4-Manifolds https://arxiv.org/abs/2611.05177 https://arxiv.org/pdf/2611.05177 https://arxiv.org/html/2611.05177
November 4, 2026 at 6:48 AM
eprint.ing.bot
Smoothness of Shortest Isogenies to Frobenius Conjugatess (Yi Ouyang, Wei Wei, Zheng Xu) ia.cr/2026/2677
Abstract. Let E be chosen uniformly from the geometric isomorphism classes of supersingular elliptic curves over $\overline{\mathbb{F}}_p$ and δ_(E) be the minimum degree of isogenies from E to its Frobenius conjugate E^((p)). We establish bounds for the smoothness probability of δ_(E) and hence affirm Wesolowski’s p^(1/3 + o(1)) attack on the supersingular endomorphism ring problem is unconditional. We also establish a uniform asymptotic formula, with a main term expressed in terms of Dirichlet L-values, for the probability that a connection isogeny of degree n exists between E and E^((p)).
November 9, 2026 at 2:08 AM
eprint.ing.bot
Poisoned Cryptography: Solving Direct-Sum LIP in Half the Dimension (Artyom Kuninets, Aleksandr Bakharev) ia.cr/2026/2281
Abstract. We analyse the Lattice Isomorphism Problem framework of Ducas and van Woerden when it is instantiated with the direct sum of two rescaled integral Barnes-Wall lattices, Λ_(S) = gBW_(m)^(ℤ) ⊕ (g + 1)BW_(m)^(ℤ). All primitives of the framework share the same key pair, a public form P = U^(⊤)SU and a secret unimodular matrix U, so recovering U from P breaks each of them. We take the hash-and-sign signature scheme as an example, whose security rests on distinguishing the class of S = diag (g²R, (g + 1)²R) from that of the auxiliary form Q⁻¹ = diag (R, g²(g + 1)²R). We show that the g²-hull maps each of the two classes onto the other, is computable from the public key alone, and rescales the two blocks from (g, g + 1) to (1, g(g + 1)) without changing the automorphism group, so that solutions of the transformed instance lift back. The transformed instance then splits into two isomorphism problems for the public Barnes-Wall lattice in half the dimension. At d = 1024, g = 43 the estimated cost of key recovery drops from 220 to 124 classical bits.
November 9, 2026 at 1:23 AM
enkibright.bsky.social
topology → vertex/edge/face indexing
↓
lexical-numeric isomorphism
↓
semantic encoding → composition
↓
ASCII · Braille;
color Braille · glyphs;
quadrant blocks · SDF;
Hebrew · Gematria;
numeric · symbolic…
(Etc)
↓
synchronized multi-renderer mesh
↓
multidimensional projection
↺
November 4, 2026 at 1:11 AM