Patrick Schnider
@schnpatr.bsky.social
Mathematician/Computer Scientist interested in discrete and computational geometry and topology. Working at University of Basel and ETH Zürich.
https://people.inf.ethz.ch/schnpatr/
https://people.inf.ethz.ch/schnpatr/
Looks like I‘ll have some nice literature for the christmas break :)
*The Mathematics of Origami*.
Expected online publication date: December 2025. Print publication: 31 December 2025.
www.science.smith.edu/~jorourke/Ma...
#MathSky #Mathematics 🧪 #Geometry #Origami #MathArt
Expected online publication date: December 2025. Print publication: 31 December 2025.
www.science.smith.edu/~jorourke/Ma...
#MathSky #Mathematics 🧪 #Geometry #Origami #MathArt
November 7, 2025 at 6:08 AM
Looks like I‘ll have some nice literature for the christmas break :)
Reposted by Patrick Schnider
Both low-level implementation and analysis were previously very involved.
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3
Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
We give a combinatorial algorithm for computing exact maximum flows in directed graphs with $n$ vertices and edge capacities from $\{1,\dots,U\}$ in $\tilde{O}(n^{2}\log U)$ time, which is near-optima...
arxiv.org
October 23, 2025 at 4:47 AM
Both low-level implementation and analysis were previously very involved.
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3
But our new paper simplifies both significantly.
Now
- Pretty readable for non-experts.
- Simple enough to code up fully in C++
- I am trying to teach it this semester arxiv.org/abs/2510.17182
2/3
Accepted papers for SOSA 2026, congrats to Sebastian Haslebacher and Jonas Lill of our group on their accepted paper on finding Tarski fixpoints.
www.siam.org/conferences-...
www.siam.org/conferences-...
SIAM Symposium on Simplicity in Algorithms (SOSA26) | SIAM
The SIAM Symposium on Simplicity in Algorithms (SOSA26) will be held in Vancouver, Canada from January 12–13, 2026.
www.siam.org
October 19, 2025 at 8:32 PM
Accepted papers for SOSA 2026, congrats to Sebastian Haslebacher and Jonas Lill of our group on their accepted paper on finding Tarski fixpoints.
www.siam.org/conferences-...
www.siam.org/conferences-...
The journal paper for the topology-based clusterer AuToMATo that I developed with Marius Huber and Sara Kalisnik is now online:
openreview.net/pdf?id=Qd7H5...
The code of AuToMATo is public:
github.com/m-a-huber/au...
Feel free to use it, especially in combination with the Mapper algorithm :)
openreview.net/pdf?id=Qd7H5...
The code of AuToMATo is public:
github.com/m-a-huber/au...
Feel free to use it, especially in combination with the Mapper algorithm :)
openreview.net
October 17, 2025 at 9:11 AM
The journal paper for the topology-based clusterer AuToMATo that I developed with Marius Huber and Sara Kalisnik is now online:
openreview.net/pdf?id=Qd7H5...
The code of AuToMATo is public:
github.com/m-a-huber/au...
Feel free to use it, especially in combination with the Mapper algorithm :)
openreview.net/pdf?id=Qd7H5...
The code of AuToMATo is public:
github.com/m-a-huber/au...
Feel free to use it, especially in combination with the Mapper algorithm :)
Reposted by Patrick Schnider
Accept more papers!
sarielhp.org/misc/bloge/2...
sarielhp.org/misc/bloge/2...
Accept more papers!
sarielhp.org
October 1, 2025 at 8:42 AM
Accept more papers!
sarielhp.org/misc/bloge/2...
sarielhp.org/misc/bloge/2...
Part 2 is now out, and it contains some really good recommendations which I fully endorse. One of them I found particularly interesting: there should be more „low entry“ options for publishing. Not every result is a breakthrough, but it might still be worth publishing.
arxiv.org/pdf/2509.09877
arxiv.org/pdf/2509.09877
September 23, 2025 at 7:25 PM
Part 2 is now out, and it contains some really good recommendations which I fully endorse. One of them I found particularly interesting: there should be more „low entry“ options for publishing. Not every result is a breakthrough, but it might still be worth publishing.
arxiv.org/pdf/2509.09877
arxiv.org/pdf/2509.09877
Reposted by Patrick Schnider
New tiling results on the arXiv, one of which says that determining whether or not two connected polycubes can together tile R^3 is undecidable (Cor. 5.5). A polycube is an object built by gluing cubes face-to-face. (Unrelated fig.)
arxiv.org/abs/2509.07906
#MathSky #Mathematics #Geometry #Tiling
arxiv.org/abs/2509.07906
#MathSky #Mathematics #Geometry #Tiling
September 11, 2025 at 1:14 AM
New tiling results on the arXiv, one of which says that determining whether or not two connected polycubes can together tile R^3 is undecidable (Cor. 5.5). A polycube is an object built by gluing cubes face-to-face. (Unrelated fig.)
arxiv.org/abs/2509.07906
#MathSky #Mathematics #Geometry #Tiling
arxiv.org/abs/2509.07906
#MathSky #Mathematics #Geometry #Tiling
Fraudulent publishing is unfortunately an issue in math and CS. This new paper gives a nice overview of the types of frauds and scams going on. Looking forward to part 2, which promises some ideas what we can do against this.
arxiv.org/abs/2509.07257
arxiv.org/abs/2509.07257
Fraudulent Publishing in the Mathematical Sciences
This report is the first of two publications of a joint Working Group of the International Mathematical Union (IMU) and the International Council of Industrial and Applied Mathematics (ICIAM). In it, ...
arxiv.org
September 11, 2025 at 12:47 PM
Fraudulent publishing is unfortunately an issue in math and CS. This new paper gives a nice overview of the types of frauds and scams going on. Looking forward to part 2, which promises some ideas what we can do against this.
arxiv.org/abs/2509.07257
arxiv.org/abs/2509.07257
I was in Matera today, a really beautiful city with a very interesting history. As a geometer, I particularly enjoyed the many different airvents.
September 2, 2025 at 3:29 PM
I was in Matera today, a really beautiful city with a very interesting history. As a geometer, I particularly enjoyed the many different airvents.
Just finished 3 full days of oral exams for my Intro to TDA class. I stopped counting how often I‘ve drawn a torus. But the funniest situation was when a student mixed up some words and started talking about „reformation detracts“.
August 15, 2025 at 7:57 PM
Just finished 3 full days of oral exams for my Intro to TDA class. I stopped counting how often I‘ve drawn a torus. But the funniest situation was when a student mixed up some words and started talking about „reformation detracts“.
A new paper on the #arXiv. Together with Marius Huber we are „Flagifying the Dowker Complex“
arxiv.org/abs/2508.08025
arxiv.org/abs/2508.08025
Flagifying the Dowker Complex
The Dowker complex $\mathrm{D}_{R}(X,Y)$ is a simplicial complex capturing the topological interplay between two finite sets $X$ and $Y$ under some relation $R\subseteq X\times Y$. While its definitio...
arxiv.org
August 12, 2025 at 5:47 AM
A new paper on the #arXiv. Together with Marius Huber we are „Flagifying the Dowker Complex“
arxiv.org/abs/2508.08025
arxiv.org/abs/2508.08025
Reposted by Patrick Schnider
ETH professor Ueli Maurer has provided cryptography with a theoretical basis. Now he is retiring. However, his most important research project is yet to come. @csateth.bsky.social
ethz.ch/en/news-and-...
#Cryptography #Cybersecurity #DigitalSecurity
ethz.ch/en/news-and-...
#Cryptography #Cybersecurity #DigitalSecurity
A clear plan for security
ETH professor Ueli Maurer has provided cryptography with a theoretical basis. Now he is retiring. However, his most important research project is yet to come.
ethz.ch
July 14, 2025 at 8:34 AM
ETH professor Ueli Maurer has provided cryptography with a theoretical basis. Now he is retiring. However, his most important research project is yet to come. @csateth.bsky.social
ethz.ch/en/news-and-...
#Cryptography #Cybersecurity #DigitalSecurity
ethz.ch/en/news-and-...
#Cryptography #Cybersecurity #DigitalSecurity
Reposted by Patrick Schnider
This work will be presented at #FOCS2025 🥳
A new paper on arXiv: together with Sebastian Haslebacher, Simon Weber and Jonas Lill we want to find approximate fixpoints of contractionmaps. It is an open problem whether this can be done on polynomial time, but we can at least do it in polynomially many queries.
arxiv.org/abs/2503.16089
arxiv.org/abs/2503.16089
Query-Efficient Fixpoints of $\ell_p$-Contractions
We prove that an $ε$-approximate fixpoint of a map $f:[0,1]^d\rightarrow [0,1]^d$ can be found with $\mathcal{O}(d^2(\log\frac{1}ε + \log\frac{1}{1-λ}))$ queries to $f$ if $f$ is $λ$-contracting with ...
arxiv.org
July 9, 2025 at 12:52 PM
This work will be presented at #FOCS2025 🥳
Reposted by Patrick Schnider
The notifications for #FOCS2025 are out: congratulations to all!
The registration page is up: focs.computer.org/2025/register/
and information about student travel support will be added within days.
Looking forward to seeing you in Sydney in December!
The registration page is up: focs.computer.org/2025/register/
and information about student travel support will be added within days.
Looking forward to seeing you in Sydney in December!
Register – FOCS 2025
focs.computer.org
July 8, 2025 at 8:56 PM
The notifications for #FOCS2025 are out: congratulations to all!
The registration page is up: focs.computer.org/2025/register/
and information about student travel support will be added within days.
Looking forward to seeing you in Sydney in December!
The registration page is up: focs.computer.org/2025/register/
and information about student travel support will be added within days.
Looking forward to seeing you in Sydney in December!
#FOCS25 acceptance notifications are out. Seeing that I submitted two papers and only got one notification so far I‘m guessing the rejections will be sent later 😅
July 8, 2025 at 6:44 PM
#FOCS25 acceptance notifications are out. Seeing that I submitted two papers and only got one notification so far I‘m guessing the rejections will be sent later 😅
You know you‘re in a CS department when you see these door stoppers.
July 7, 2025 at 8:56 AM
You know you‘re in a CS department when you see these door stoppers.
Sounds like a great opportunity for talented students who want to do a PhD in Denmark.
DARA (Danish Advanced Research Academy) is a new initiative in which exceptional STEM candidates can get fully funded PhD scholarships at Danish universities. Those who are interested in applying should reach out to potential supervisors as soon as possible. daracademy.dk/fellowship/f...
Dara
daracademy.dk
June 28, 2025 at 9:27 PM
Sounds like a great opportunity for talented students who want to do a PhD in Denmark.
@snf-fns.ch has accepted 13 projects for their SPIRIT grant, including our joint project with Bernd Gärtner and Deborah Oliveros.
www.snf.ch/en/HBdli1Egz...
www.snf.ch/en/HBdli1Egz...
Research with developing countries
For food security, against cystic fibrosis: As part of its SPIRIT programme, the SNSF is funding 13 projects with 6 million francs.
www.snf.ch
June 26, 2025 at 8:24 AM
@snf-fns.ch has accepted 13 projects for their SPIRIT grant, including our joint project with Bernd Gärtner and Deborah Oliveros.
www.snf.ch/en/HBdli1Egz...
www.snf.ch/en/HBdli1Egz...
Just decided at the business meeting of #SoCG25: in two years, #SoCG27 will take place in Bangalore, India.
Congrats Sujoy Bhore and @arindamkhan.bsky.social on a great pitch!
Congrats Sujoy Bhore and @arindamkhan.bsky.social on a great pitch!
June 25, 2025 at 9:53 AM
Just decided at the business meeting of #SoCG25: in two years, #SoCG27 will take place in Bangalore, India.
Congrats Sujoy Bhore and @arindamkhan.bsky.social on a great pitch!
Congrats Sujoy Bhore and @arindamkhan.bsky.social on a great pitch!
The difference between „fly“ and „fry“ is small but important…
June 22, 2025 at 1:38 PM
The difference between „fly“ and „fry“ is small but important…
Visited my old high school from my exchange year today, very nostalgic feeling.
June 18, 2025 at 9:15 AM
Visited my old high school from my exchange year today, very nostalgic feeling.