Maris Ozols
LightNews LightNews
marisozols.bsky.social
Maris Ozols
@marisozols.bsky.social
570 followers 570 following 84 posts
Associate professor at the University of Amsterdam and senior researcher at QuSoft working on quantum computing.
Posts Replies Media Videos
marisozols.bsky.social
Part of the dedication in Freyd's "Abelian Categories" book published in 1964.
www.tac.mta.ca/tac/reprints...
Imagine trying to write this book today...
To the National Science Foundation for paying me while I wrote part of this book. To Columbia University for paying Sonja Levine, who typed the preliminary manuscript of the book.
October 29, 2025 at 8:18 AM
marisozols.bsky.social
My answer to the question "Is there a physical motivation to study finite fields?" has been approved after 12 years.
physics.stackexchange.com/a/78834/11755
Finite fields are essential for constructing MUBs (see this paper by Wootters and Fields). Also, dealing with quantum error correcting codes (for qubits) is essentially the same as doing linear algebra over GF(4) because of the way Pauli matrices behave (see arXiv:0904.2557 or arXiv:quant-ph/9608006).
July 29, 2025 at 11:18 AM
marisozols.bsky.social
May 14, 2025 at 9:50 AM
marisozols.bsky.social
Got some unexpectedly nice solutions!
May 14, 2025 at 9:50 AM
marisozols.bsky.social
If this is not art, then what is?
May 14, 2025 at 9:16 AM
marisozols.bsky.social
The choir I sing in in Amsterdam sent this card of support and encouragement to Bishop Mariann Budde for her remarkable sermon. You can find the address of her church and send one as well!

In case you haven't seen it, you can watch the sermon here:
www.youtube.com/watch?v=mI4h...
Dear Revd. Mariann Edgar Budde, Thank you for being the voice of reason and for standing up against the irrational rantings and intended policies of the new president of the USA, Donald Trump. Keep up your good work. Very best wishes from the members of choir Canticum Anglicum in the Netherlands.
February 2, 2025 at 10:55 AM
marisozols.bsky.social
Just for fun, I wrote my own solution! Tried to see if I can get a direct proof instead of using proof by contradiction.

It took me way longer than I would like to admit... 😂
But at least I learned a couple new useful things.
theorem mod_inc_wraparaound (a b N : Nat) (ha : a < N) (hb : b < N) (hab : b ≤ (a + b) % N) : a + b < N := by -- Rewrite the hypothesis hab rw [Nat.mod_def] at hab apply (Nat.add_le_of_le_sub (Nat.mul_div_le _ _)) at hab rw [Nat.add_comm] at hab rw [Nat.add_le_add_iff_right] at hab -- Useful bound have h01 : (a + b) / N ≤ 1 := by apply Nat.le_of_lt_succ apply Nat.div_lt_of_lt_mul linarith -- Break it into "= 0" and "= 1" cases rw [Nat.le_one_iff_eq_zero_or_eq_one] at h01 -- Deal with these two cases cases' h01 with h0 h1 · rw [Nat.div_eq_zero_iff] at h0 cases h0 <;> linarith · rw [h1] at hab linarith
December 23, 2024 at 4:00 PM