Related papers: On the quantized dynamics of factorial languages

Vector space representations of words capture many aspects of word similarity, but such methods tend to make vector spaces in which antonyms (as well as synonyms) are close to each other. We present a new signed spectral normalized graph…

Let A be a Hopf algebra and H a coalgebra. We shall describe and classify up to an isomorphism all Hopf algebras E that factorize through A and H: that is E is a Hopf algebra such that A is a Hopf subalgebra of E, H is a subcoalgebra in E…

A graph $G=(V,E)$ is word-representable if and only if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$, $x\neq y$, alternate in $w$ if and only if $xy\in E$. A split graph is a graph in which the vertices can be…

The past years have seen a drastic rise in studies devoted to the investigation of colexification patterns in individual languages families in particular and the languages of the world in specific. Specifically computational studies have…

We show that in algebraically locally finite countable homogeneous structures with a free stationary independence relation the small index property implies the strong small index property. We use this and the main result of [15] to deduce…

Functional Distributional Semantics provides a linguistically interpretable framework for distributional semantics, by representing the meaning of a word as a function (a binary classifier), instead of a vector. However, the large number of…

Let $X=(V\!X,E\!X)$ be an infinite, locally finite, connected graph without loops or multiple edges. We consider the edges to be oriented, and $E\!X$ is equipped with an involution which inverts the orientation. Each oriented edge is…

This paper presents a joint model for performing unsupervised morphological analysis on words, and learning a character-level composition function from morphemes to word embeddings. Our model splits individual words into segments, and…

In this work, a symbolic dynamical formulation based upon discrete iterative mappings derived from the Collatz conjecture is introduced. It is demonstrated that this formulation naturally induces a ternary alphabet useful for characterizing…

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

We prove that the convolution of a selfdecomposable distribution with its background driving law is again selfdecomposable if and only if the background driving law is s-selfdecomposable. We will refer to this as the factorization property…

Graph databases in many applications---semantic web, transport or biological networks among others---are not only large, but also frequently modified. Evaluating graph queries in this dynamic context is a challenging task, as those queries…

Causal graph dynamics are transformations over graphs that capture two important symmetries of physics, namely causality and homogeneity. They can be equivalently defined as continuous and translation invariant transformations or functions…

We define a simple, explicit map sending a morphism $f:M \rightarrow N$ of pointwise finite dimensional persistence modules to a matching between the barcodes of $M$ and $N$. Our main result is that, in a precise sense, the quality of this…

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

We argue that one can factorize the difference equation of hypergeometric type on the nonuniform lattices in general case. It is shown that in the most cases of q-linear spectrum of the eigenvalues this directly leads to the dynamical…

We extend the classical (connected, etale) factorization of locally connected geometric morphisms into a (terminally connected, pro-etale) factorization for all geometric morphisms between Grothendieck topoi. We discuss properties of both…

It has become a de-facto standard to represent words as elements of a vector space (word2vec, GloVe). While this approach is convenient, it is unnatural for language: words form a graph with a latent hierarchical structure, and this…

Any amicable pair \phi, \psi{} of Sturmian morphisms enables a construction of a ternary morphism \eta{} which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence…

Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…