Related papers: The generalized recurrent set and strong chain rec…

We introduce recurrent neural network grammars, probabilistic models of sentences with explicit phrase structure. We explain efficient inference procedures that allow application to both parsing and language modeling. Experiments show that…

Recurrent neural networks (RNNs) are a class of nonlinear dynamical systems often used to model sequence-to-sequence maps. RNNs have excellent expressive power but lack the stability or robustness guarantees that are necessary for many…

In this paper we present a new termination proof and complexity analysis of unfolding graph rewriting which is a specific kind of infinite graph rewriting expressing the general form of safe recursion. We introduce a termination order over…

Let 0-CR denote the class of all metric compacta X such that the set of maps $f:X\to X$ with 0-dimensional sets CR(f) of chain recurrent points is a dense $G_\delta$-subset of the mapping space C(X,X) (with the uniform convergence). We…

A generalization of the Renormalization Group, which describes order-parameter fluctuations in finite systems, is developed in the specific context of percolation. This ``Stochastic Renormalization Group'' (SRG) expresses statistical…

Let $G$ be a simple and simply connected algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p>0$. Assume that $p$ is good for the root system of $G$ and that the covering map $G_{sc} \rightarrow G$ is separable.…

Recurrent Neural Networks (RNNs) are among the most successful machine learning models for sequence modelling, but tend to suffer from an exponential increase in the number of parameters when dealing with large multidimensional data. To…

Graphons have traditionally served as limit objects for dense graph sequences, with the cut distance serving as the metric for convergence. However, sparse graph sequences converge to the trivial graphon under the conventional definition of…

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

We characterize the computational power of neural networks that follow the graph neural network (GNN) architecture, not restricted to aggregate-combine GNNs or other particular types. We establish an exact correspondence between the…

This paper investigates the generalized rank weights, with a definition implied by the study of the generalized rank weight enumerator. We study rank metric codes over $L$, where $L$ is a finite Galois extension of a field $K$. This is a…

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

We define a generalization of the Turing machine that computes on general sets. Our main theorem states that the class of generalized Turing machine computable functions and the class of Set Recursive functions coincide.

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

Suppose that $G_j$ is a sequence of finite connected planar graphs, and in each $G_j$ a special vertex, called the root, is chosen randomly-uniformly. We introduce the notion of a distributional limit $G$ of such graphs. Assume that the…

Generalized Feller theory provides an important analog to Feller theory beyond locally compact state spaces. This is very useful for solutions of certain stochastic partial differential equations, Markovian lifts of fractional processes, or…

The relationship between Term Graph Rewriting and Term Rewriting is well understood: a single term graph reduction may correspond to several term reductions, due to sharing. It is also known that if term graphs are allowed to contain…

In this paper we study generalized Gorenstein Arf rings; a class of one-dimensional Cohen-Macaulay local Arf rings that is strictly contained in the class of Gorenstein rings. We obtain new characterizations and examples of Arf rings, and…

We develop sufficient analytic conditions for recurrence and transience of non-sectorial perturbations of possibly non-symmetric Dirichlet forms on a general state space. These form an important subclass of generalized Dirichlet forms which…

In this work, we generalize a recursive enumerative formula for connected Feynman diagrams with two external legs. The Feynman diagrams are defined from a fermionic gas with a two-body interaction. The generalized recurrence is valid for…