English
Related papers

Related papers: On the quantized dynamics of factorial languages

200 papers

Let $\mathcal C$ be the category of finite graphs. Lov\`{a}sz shows that the semi-ring of isomorphism classes of $\mathcal C$ (with coproduct as sum, and product as multiplication) is embedded into the direct product of the semi-ring of…

Category Theory · Mathematics 2022-07-14 Shoma Fujino , Makoto Matsumoto

We develop the notion of a "filtered cospan" as an algebraic object that stands in the same relation to interlevel persistence modules as filtered chain complexes stand with respect to sublevel persistence modules. This relation is…

Algebraic Topology · Mathematics 2026-01-01 Michael Usher

A filoop is a generic immersion of a circle in a closed oriented surface, whose complement is a disjoint union of discs, considered up to orientation preserving diffeomorphisms. It gives rise to a chord diagram C which has an interlace…

Geometric Topology · Mathematics 2024-01-23 Christopher-Lloyd Simon

Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…

Combinatorics · Mathematics 2024-11-15 Frederico Cançado , Gabriel Coutinho

Representing words by vectors, or embeddings, enables computational reasoning and is foundational to automating natural language tasks. For example, if word embeddings of similar words contain similar values, word similarity can be readily…

Computation and Language · Computer Science 2022-02-02 Carl Allen

Morpho-syntactic lexicons provide information about the morphological and syntactic roles of words in a language. Such lexicons are not available for all languages and even when available, their coverage can be limited. We present a…

Computation and Language · Computer Science 2016-01-26 Manaal Faruqui , Ryan McDonald , Radu Soricut

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

Combinatorics · Mathematics 2022-10-07 MLE Slone

We develop a stability theory for contractive local IFSs on compact metric spaces. Unlike the classical global setting, local systems may exhibit a richer symbolic and geometric structure, including code spaces that are not of finite type…

Dynamical Systems · Mathematics 2026-05-05 Elismar R. Oliveira , Paulo Varandas

Let $S$ be a semigroup. The elements $a,b\in S$ are called primarily conjugate if $a=xy$ and $b=yx$ for certain $x,y\in S$. The relation of conjugacy is defined as the transitive closure of the relation of primary conjugacy. In the case…

Group Theory · Mathematics 2007-05-23 Ganna Kudryavtseva

An additive hereditary graph property is a set of graphs, closed under isomorphism and under taking subgraphs and disjoint unions. Let ${\cal P}_1, >..., {\cal P}_n$ be additive hereditary graph properties. A graph $G$ has property $({\cal…

Combinatorics · Mathematics 2007-05-23 Alastair Farrugia , R. Bruce Richter

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

Combinatorics · Mathematics 2015-09-14 Sébastien Labbé , Edita Pelantová

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…

Formal Languages and Automata Theory · Computer Science 2014-04-28 Fabian Reiter

Entropic causal inference is a recent framework for learning the causal graph between two variables from observational data by finding the information-theoretically simplest structural explanation of the data, i.e., the model with smallest…

Machine Learning · Computer Science 2025-09-23 Spencer Compton , Kristjan Greenewald , Dmitriy Katz , Murat Kocaoglu

Every irreducible outer automorphism of the free group of rank r is topologically represented by an irreducible train track map $f$ on some graph $\Gamma$ of rank r. Moreover, $f$ can always be written as a composition of folds and a graph…

Group Theory · Mathematics 2025-06-25 Paige Hillen

This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of…

Dynamical Systems · Mathematics 2022-11-23 Bastián Espinoza

In this work, we investigate the existence of a factorization for a unital completely positive map, between non-commutative probability space which do not change the expectation values of the events. These maps are called in literature…

Operator Algebras · Mathematics 2016-01-22 Carlo Pandiscia

A family of algebras, which we call topological conjugacy algebras, is associated with each proper continuous map on a locally compact Hausdorff space. Assume that $\eta_i:\X_i\to \X_i$ is a continuous proper map on a locally compact…

Operator Algebras · Mathematics 2009-02-10 Kenneth R. Davidson , Elias G. Katsoulis

We study the topological dynamics by iterations of a piecewise continuous, non linear and locally contractive map in a real finite dimensional compact ball. We consider those maps satisfying the "separation property": different continuity…

Dynamical Systems · Mathematics 2011-06-22 Eleonora Catsigeras , Ruben Budelli

We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…

Combinatorics · Mathematics 2021-02-17 László Lovász

Monadic stability generalizes many tameness notions from structural graph theory such as planarity, bounded degree, bounded tree-width, and nowhere density. The sparsification conjecture predicts that the (possibly dense) monadically stable…

Discrete Mathematics · Computer Science 2026-01-23 Nikolas Mählmann , Sebastian Siebertz