Related papers: Symbolic Representations of Iterated Maps
Word-representable graphs, which are the same as semi-transitively orientable graphs, generalize several fundamental classes of graphs. In this paper we propose a novel approach to study word-representability of graphs using a technique of…
We provide a survey of results from symbolic dynamics and algebraic topology relating to Grout, a new user-friendly program developed to calculate combinatorial properties and topological invariants of a large class of symbolic…
In a previous work by the authors the one dimensional (doubling) renormalization operator was extended to the case of quasi-periodically forced one dimensional maps. The theory was used to explain different self-similarity and universality…
We introduce differentiable indirection -- a novel learned primitive that employs differentiable multi-scale lookup tables as an effective substitute for traditional compute and data operations across the graphics pipeline. We demonstrate…
Let $f$ be a non-invertible $C^{1+\beta}(\beta>0)$ map with zero Lyapunov exponents and singularities on a closed Riemannian manifold $M$. We consider the symbolic dynamics of $f$. Combining the techniques in recent works of Sarig, Ovadia…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
This is a review of [Michor, Peter W.: The moment mapping for a unitary representation, Ann. Global Anal. Geometry, 8, No 3(1990), 299--313] including a careful description of calculus in infinite dimensions. For any unitary representation…
A central question in cognitive science is whether conceptual representations converge onto a shared manifold to support generalization, or diverge into orthogonal subspaces to minimize task interference. While prior work has discovered…
In our earlier paper [A square root map on Sturmian words, Electron. J. Combin. 24.1 (2017)], we introduced a symbolic square root map. Every optimal squareful infinite word $s$ contains exactly six minimal squares and can be written as a…
In this purely experimental work we try to represent the set of plane maps with 3 vertices and 3 faces as a bipartite ribbon graph. In particular, this construction allows one to estimate the genus of the initial set.
A subshift of finite type over finitely many symbols can be described as a collection of all infinite walks on a digraph with at most a single edge from a vertex to another. The associated finite set $\F$ of forbidden words is a constraint…
Molecular graphs generally contain subgraphs (known as groups) that are identifiable and significant in composition, functionality, geometry, etc. Flat latent representations (node embeddings or graph embeddings) fail to represent, and…
Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a…
The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain non-periodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in…
Embedding learning, a.k.a. representation learning, has been shown to be able to model large-scale semantic knowledge graphs. A key concept is a mapping of the knowledge graph to a tensor representation whose entries are predicted by models…
Given a piecewise $C^{1+\beta}$ map of the interval, possibly with critical points and discontinuities, we construct a symbolic model for invariant probability measures with nonuniform expansion that do not approach the critical points and…
Information visualization is essential in making sense out of large data sets. Often, high-dimensional data are visualized as a collection of points in 2-dimensional space through dimensionality reduction techniques. However, these…
Current work in lexical distributed representations maps each word to a point vector in low-dimensional space. Mapping instead to a density provides many interesting advantages, including better capturing uncertainty about a representation…
Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growing interest in the use of symbolic models as a tool for mitigating…
In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…