Related papers: On nilspace systems and their morphisms
Infinitesimal contraction analysis, wherein global asymptotic convergence results are obtained from local dynamical properties, has proven to be a powerful tool for applications in biological, mechanical, and transportation systems. Thus…
As NLP tools become ubiquitous in today's technological landscape, they are increasingly applied to languages with a variety of typological structures. However, NLP research does not focus primarily on typological differences in its…
We present some results, both rigorously mathematical and computational, showing unexpected relations between different identities expressing nilpotence in nonassociative algebras, and formulate a number of conjectural generalizations and…
We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability…
In this paper we study the nilpotency of certain groups of self homotopy equivalences. Our main goal is to extend, to localized homotopy groups and/or homotopy groups with coefficients, the general principle of Dror and Zabrodsky by which a…
This paper explores the concept of topological transitivity in nonautonomous dynamical systems, which are defined as sequences of continuous maps from a compact metric space to itself. It investigates various conditions (including…
Motivated by the intermediate Lang conjectures on hyperbolicity and rational points, we prove new finiteness results for non-constant morphisms from a fixed variety to a fixed variety defined over a number field by applying Faltings's…
We prove a factorization theorem for reproducing kernel Hilbert spaces whose kernel has a normalized complete Nevanlinna-Pick factor. This result relates the functions in the original space to pointwise multipliers determined by the…
Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…
The Johnson filtration of the mapping class group of a compact, oriented surface is the descending series consisting of the kernels of the actions on the nilpotent quotients of the fundamental group of the surface. Each term of the Johnson…
Models with Hilbert space fragmentation are characterized by (exponentially) many dynamically disconnected subspaces, not associated with conventional symmetries but captured by nontrivial Krylov subspaces. These subspaces usually exhibit a…
The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…
A few new N=2 superintegrable mappings in the (1|2) superspace are proposed and their origin is analyzed. Using one of them, acting like the discrete symmetry transformation of the N=2 supersymmetric modified NLS hierarchy, the recursion…
Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the…
It is shown that in dimension at least three a local diffeomorphism of Euclidean n-space into itself is injective provided that the pull-back of every plane is a Riemannian submanifold which is conformal to a plane. Using a similar…
Graph (or network) is a mathematical structure that has been widely used to model relational data. As real-world systems get more complex, multilayer (or multiple) networks are employed to represent diverse patterns of relationships among…
In this paper we present a systematic study of continuous local iterated function systems. We prove local iterated function systems admit compact attractors and, under a contractivity assumption, construct their code space and present an…
This paper explores the topic of transportability, as a sub-area of generalisability. By proposing the utilisation of metrics based on well-established statistics, we are able to estimate the change in performance of NLP models in new…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We investigate the dynamics of forward or backward self-similar systems (iterated function systems) and the topological structure of their invariant sets. We define a new cohomology theory (interaction cohomology) for forward or backward…