Related papers: Adding Machine Maps and Minimal Sets for Iterated …
In this article we prove the topological minimality of unions of several almost orthogonal planes of arbitrary dimensions. A particular case was proved in arXiv:1103.1468, where we proved the Almgren minimality (which is a weaker property…
The dynamics of coupled intermittent maps is used to model the correlated structure of genomic sequences. The use of intermittent maps, as opposed to other simple chaotic maps, is particularly suited for the production of long range…
An interactive function computation problem in a collocated network is studied in a distributed block source coding framework. With the goal of computing a desired function at the sink, the source nodes exchange messages through a sequence…
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for combinatorial designs, and some generalizations, was…
Planning for multi-robot teams in complex environments is a challenging problem, especially when these teams must coordinate to accomplish a common objective. In general, optimal solutions to these planning problems are computationally…
The union of a directed family of topological groups can be equipped with two noteworthy topologies: the finest topology making each injection continuous, and the finest group topology making each injection continuous. This begs the…
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically…
Our focus is on the set of lower-triangular, infinite matrices that have natural operations like addition, multiplication by a number, and matrix multiplication. With respect to addition this set forms and abelian group while with respect…
We investigate the global scheduling of sporadic, implicit deadline, real-time task systems on multiprocessor platforms. We provide a task model which integrates job parallelism. We prove that the time-complexity of the feasibility problem…
We prove results on mixing and mixing rates for toral extensions of nonuniformly expanding maps with subexponential decay of correlations. Both the finite and infinite measure settings are considered. Under a Dolgopyat-type condition on…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions,…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…
We generalize the embedding formalism for conformal field theories to the case of general operators with mixed symmetry. The index-free notation encoding symmetric tensors as polynomials in an auxiliary polarization vector is extended to…
An infinite iterated function system (IIFS) is a countable collection of contraction maps on a compact metric space. In this paper we study the conditions under which the attractor of a such system admits a parameterization by a continuous…
To illustrate that the notion of convergence of submodular function sequences fits reasonably into the limit theory of graphs, we describe several classes of matroids and other submodular setfunctions for which convergence of appropriate…
Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…
Completing a data matrix X has become an ubiquitous problem in modern data science, with applications in recommender systems, computer vision, and networks inference, to name a few. One typical assumption is that X is low-rank. A more…
Given a random sequence of holomorphic maps $f_1,f_2,f_3,...$ of the unit disk $\Delta$ to a subdomain $X$, we consider the compositions $$F_n=f_1 \circ f_{2} \circ ... f_{n-1} \circ f_n.$$ The sequence $\{F_n\}$ is called the {\em iterated…
Ordered sets and maps play important roles as index structures in relational data models. When a shared index in a multi-user system is modified concurrently, the current state of the index will diverge into multiple versions containing the…