Newest at the top
| 2025-11-18 03:29:36 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) (Quit: Leaving...) |
| 2025-11-18 03:28:36 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-11-18 03:25:16 +0100 | haltingsolver | (~cmo@2604:3d09:207f:8000::d1dc) (Ping timeout: 256 seconds) |
| 2025-11-18 03:21:49 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-18 03:16:04 +0100 | DetourNe- | DetourNetworkUK |
| 2025-11-18 03:14:06 +0100 | DetourNetworkUK | (~DetourNet@user/DetourNetworkUK) (Read error: Connection reset by peer) |
| 2025-11-18 03:13:46 +0100 | catties | Catty |
| 2025-11-18 03:13:43 +0100 | DetourNe- | (DetourNetw@user/DetourNetworkUK) DetourNetworkUK |
| 2025-11-18 03:11:25 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 264 seconds) |
| 2025-11-18 03:09:17 +0100 | myxokephale | (~myxos@2001:579:8380:f20:6b9e:1a89:7816:af78) (Ping timeout: 244 seconds) |
| 2025-11-18 03:07:48 +0100 | haltingsolver | (~cmo@2604:3d09:207f:8000::d1dc) |
| 2025-11-18 03:06:55 +0100 | myxos | (~myxos@2001:579:8380:f20:5f4f:3365:91ae:208d) myxokephale |
| 2025-11-18 03:06:42 +0100 | vanishingideal | (~vanishing@user/vanishingideal) vanishingideal |
| 2025-11-18 03:05:58 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-18 03:05:26 +0100 | haltingsolver | (~cmo@2604:3d09:207f:8000::d1dc) (Ping timeout: 256 seconds) |
| 2025-11-18 03:04:30 +0100 | vanishingideal | (~vanishing@user/vanishingideal) (Ping timeout: 245 seconds) |
| 2025-11-18 03:03:05 +0100 | Square2 | (~Square4@user/square) (Ping timeout: 244 seconds) |
| 2025-11-18 02:59:53 +0100 | Square3 | (~Square@user/square) Square |
| 2025-11-18 02:57:17 +0100 | petrichor | (~jez@user/petrichor) petrichor |
| 2025-11-18 02:55:03 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 252 seconds) |
| 2025-11-18 02:54:38 +0100 | otto_s | (~user@p4ff27097.dip0.t-ipconnect.de) |
| 2025-11-18 02:54:27 +0100 | jangerma1 | (~jangermad@104-54-32-17.lightspeed.irvnca.sbcglobal.net) |
| 2025-11-18 02:52:58 +0100 | otto_s | (~user@p5de2f6bf.dip0.t-ipconnect.de) (Ping timeout: 256 seconds) |
| 2025-11-18 02:50:16 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-18 02:44:42 +0100 | xff0x | (~xff0x@fsb6a9491c.tkyc517.ap.nuro.jp) |
| 2025-11-18 02:39:22 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 256 seconds) |
| 2025-11-18 02:34:41 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-18 02:33:33 +0100 | catties | (~catties@user/meow/catties) catties |
| 2025-11-18 02:31:18 +0100 | sindu | (~sindu@77.19.134.151.tmi.telenormobil.no) (Ping timeout: 260 seconds) |
| 2025-11-18 02:28:20 +0100 | Catty | (~catties@user/meow/catties) (Remote host closed the connection) |
| 2025-11-18 02:27:27 +0100 | Dhark8 | Shark8 |
| 2025-11-18 02:24:50 +0100 | AlexZenon | (~alzenon@178.34.162.20) |
| 2025-11-18 02:24:07 +0100 | <haskellbridge> | <Zemyla> True. |
| 2025-11-18 02:23:43 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) (Ping timeout: 240 seconds) |
| 2025-11-18 02:21:50 +0100 | <monochrom> | Combination may be N->2. Each of n elements may be chosen or not-chosen. |
| 2025-11-18 02:18:55 +0100 | AlexNoo | (~AlexNoo@178.34.151.158) (Ping timeout: 246 seconds) |
| 2025-11-18 02:18:53 +0100 | merijn | (~merijn@host-vr.cgnat-g.v4.dfn.nl) merijn |
| 2025-11-18 02:18:46 +0100 | Tuplanolla | (~Tuplanoll@91-159-187-167.elisa-laajakaista.fi) (Quit: Leaving.) |
| 2025-11-18 02:17:08 +0100 | <monochrom> | So yeah it's both programming and category theory. I was coding up LU factorization with pivoting, and I recorded the permutation of rows by performing the same permutation on [0 .. n-1] and returning it. |
| 2025-11-18 02:16:58 +0100 | AlexZenon | (~alzenon@178.34.151.158) (Ping timeout: 256 seconds) |
| 2025-11-18 02:16:42 +0100 | humasect | (~humasect@dyn-192-249-132-90.nexicom.net) humasect |
| 2025-11-18 02:15:27 +0100 | AlexNoo_ | (~AlexNoo@178.34.162.20) |
| 2025-11-18 02:15:25 +0100 | <monochrom> | Moreover, it also hints that σ id is "backwards": It maps new indexes to old indexes. How to see it: Use N for old indexes, N' for new indexes. Then (N->a) -> (N'->a) is isomorphic to N' -> N. |
| 2025-11-18 02:14:38 +0100 | trickard_ | trickard |
| 2025-11-18 02:13:27 +0100 | peterbecich | (~Thunderbi@172.222.148.214) peterbecich |
| 2025-11-18 02:12:55 +0100 | <EvanR> | sounds like the theory of group action |
| 2025-11-18 02:12:14 +0100 | <monochrom> | I don't know! Not interested for now. |
| 2025-11-18 02:12:01 +0100 | <monochrom> | And the backward mapping maps e to \v -> v ∘ e |
| 2025-11-18 02:11:51 +0100 | <haskellbridge> | <Zemyla> So is there a type that represents a combination? |
| 2025-11-18 02:10:41 +0100 | <monochrom> | Model "array of length n with elements of type a" as N->a, N = {0 .. n-1}. Then permutations are a special cases of (N->a) -> (N->a). Then Yoneda embedding says that it's isomorphic to N->N, the forward mapping maps σ to σ id, id = [0 .. n-1]. |