Related papers: Finite Dynamical Laminations
This paper is centered on covariant dynamics on unimodular random graphs and random networks, namely maps from the set of vertices to itself which are preserved by graph or network isomorphisms. Such dynamics are referred to as…
In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular…
Label distribution learning (LDL) is a general learning framework, which assigns to an instance a distribution over a set of labels rather than a single label or multiple labels. Current LDL methods have either restricted assumptions on the…
Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…
Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph into "colour classes" in such a way that all…
We determine the combinatorics of transitive module categories over the monoidal category of finite dimensional $\mathfrak{sl}_3$-modules which arise when acting by the latter monoidal category on arbitrary simple $\mathfrak{sl}_3$-modules.…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We develop a family of finite element spaces of differential forms defined on cubical meshes in any number of dimensions. The family contains elements of all polynomial degrees and all form degrees. In two dimensions, these include the…
The dynamical degree $\lambda(f)$ of a birational transformation $f$ measures the exponential growth rate of the degree of the formulae that define the $n$-th iterate of $f$. We study the set of all dynamical degrees of all birational…
This work dynamically classifies a 9-parametric family of birational maps f : C2 -> C2. From the sequence of the degrees dn of the iterates of f, we find the dynamical degree delta(f) of f. We identify when dn grows periodically, linearly,…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
We study the family of functions that are represented by a linear convolutional neural network (LCN). These functions form a semi-algebraic subset of the set of linear maps from input space to output space. In contrast, the families of…
We set up a geometrical theory for the study of the dynamics of reducible Pisot substitutions. It is based on certain Rauzy fractals generated by duals of higher dimensional extensions of substitutions. We obtain under certain hypotheses…
We extend the definition of an orbit portrait to the context of non-autonomous iteration, both for the combinatorial version involving collections of angles and for the dynamic version involving external rays where combinatorial portraits…
We provide an effective classification of postcritically finite polynomials as dynamical systems by means of Hubbard Trees. This can be viewed as an application of the results developed in part 1 (Stony Brook IMS 1993/5).
Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…
We study the algebraic dynamics of endomorphisms of projective varieties. First, we characterize their iterated images, i.e. the intersection of the images of their iterates. Next, we explore the Stein factorizations of the iterates,…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
A finite dynamical system (FDS) is a system of multivariate functions over a finite alphabet, that is typically used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which…
Alternative unsplit-filed-based absorbing boundary condition (ABC) computation approach for the finite-difference time-domain (FDTD) is efficiently proposed based on the deep differentiable forest. The deep differentiable forest (DDF) model…