<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Research on stau.space</title><link>https://stau.space/tags/research/</link><description>Recent content in Research on stau.space</description><generator>Hugo</generator><language>en-US</language><managingEditor>sona@stau.space (Sona Tau Estrada Rivera)</managingEditor><webMaster>sona@stau.space (Sona Tau Estrada Rivera)</webMaster><lastBuildDate>Fri, 17 Jul 2026 20:34:54 -0400</lastBuildDate><atom:link href="https://stau.space/tags/research/index.xml" rel="self" type="application/rss+xml"/><item><title>Algorithms</title><link>https://stau.space/posts/algorithms/</link><pubDate>Sun, 08 Dec 2024 20:18:33 -0400</pubDate><author>sona@stau.space (Sona Tau Estrada Rivera)</author><guid>https://stau.space/posts/algorithms/</guid><description>&lt;p&gt;So it was a fine summer morning.
Our research team was about to start our project &amp;ldquo;Counting Arithmetical Structures on Cycles with a Doubled Edge&amp;rdquo;.
From the description of the project it is immediately obvious that this kind of counting can be done by brute force, and me being the only computer scientist in my group of mathematicians I start coding up a couple algorithms for this.&lt;/p&gt;</description></item></channel></rss>