<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Structural and Symmetry Analysis of Discrete Dynamical Systems · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1006.1754/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1006.1754/feed.xml" rel="self" type="application/rss+xml" /><item><title>Structural and Symmetry Analysis of Discrete Dynamical Systems — mentioned by espeed</title><link>https://news.ycombinator.com/item?id=10690289</link><guid isPermaLink="false">urn:hackerpapers:mention:1006.1754:10690289</guid><pubDate>Mon, 07 Dec 2015 16:11:27 GMT</pubDate><description>&lt;p&gt;Prof Carlsson&amp;#x27;s (http://math.stanford.edu/~gunnar/) &amp;quot;Topology and Data&amp;quot; paper provides a good overview: http://www.ams.org/journals/bull/2009-46-02/S0273-0979-09-01... My recent dive into the literature has enlightened my thinking in terms of database and systems design. It has led me to think more in terms of properties, invariants, intervals, constraints, and dynamic fluidity -- &amp;quot;there are no things&amp;quot; (only actions and properties): https://edge.org/response-detail/11514 Maybe the antiquated abstractions we have been using for database systems is what limits us. Maybe we need to stop thinking…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1006.1754/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math-ph</category></item><item><title>Structural and Symmetry Analysis of Discrete Dynamical Systems — HN submission</title><link>https://news.ycombinator.com/item?id=10687591</link><guid isPermaLink="false">urn:hackerpapers:submission:1006.1754:10687591</guid><pubDate>Mon, 07 Dec 2015 01:32:12 GMT</pubDate><description>&lt;p&gt;Structural and Symmetry Analysis of Discrete Dynamical Systems (2010) [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1006.1754/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math-ph</category></item><item><title>Structural and Symmetry Analysis of Discrete Dynamical Systems — mentioned by espeed</title><link>https://news.ycombinator.com/item?id=10683657</link><guid isPermaLink="false">urn:hackerpapers:mention:1006.1754:10683657</guid><pubDate>Sat, 05 Dec 2015 23:17:28 GMT</pubDate><description>&lt;p&gt;Vladimir Kornyak touches on some of these ideas in these papers: 1. On Compatibility of Discrete Relations (2005) http://arxiv.org/pdf/math-ph/0504048.pdf 2. Structural and Symmetry Analysis of Discrete Dynamical Systems (2010) http://arxiv.org/pdf/1006.1754.pdf 3. Discrete Dynamical Models: Combinatorics, Statistics and Continuum Approximations (2015) http://mmg.tversu.ru/images/publications/2015-vol3-n1/Kornya... On a somewhat related note -- applying quantum principles to graph database processing -- see this new paper by Marko Rodriguez (the creator of the Gremlin graph programming…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1006.1754/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math-ph</category></item></channel></rss>
