Related papers: On dendrites, generated by polyhedral systems and …

A dynamical system is called contractive if any two solutions approach one another at an exponential rate. More precisely, the dynamics contracts lines at an exponential rate. This property implies highly ordered asymptotic behavior…

In this article we study the K-theory of endomorphisms using noncommutative motives. We start by extending the K-theory of endomorphisms functor from ordinary rings to (stable) infinity categories. We then prove that this extended functor…

In this paper we study the dynamics of Halley's and Traub's root-finding algorithms applied to a symmetric family of polynomials of degree $d+1\geq 3$. We discuss the (un)boundedness and simple connectivity of the immediate basins of…

In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in…

This note is a shortened version of my dissertation thesis, defended at Stony Brook University in December 2004. It illustrates how dynamic complexity of a system evolves under deformations. The objects I considered are quartic polynomial…

Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…

The Conley index theory is a powerful topological tool for describing the basic structure of dynamical systems. One important feature of this theory is the attractor-repeller decomposition of isolated invariant sets. In this decomposition,…

The quotient singularities of dimensions two and three obtained from polyhedral groups and the corresponding binary polyhedral groups admit natural resolutions of singularities as Hilbert schemes of regular orbits whose exceptional fibres…

Attractors of cooperative dynamical systems are particularly simple; for example, a nontrivial periodic orbit cannot be an attractor. This paper provides characterizations of attractors for the wider class of coherent systems, defined by…

We study, via the replica method of disordered systems, the packing problem of hard-spheres with a square-well attractive potential when the space dimensionality, d, becomes infinitely large. The phase diagram of the system exhibits…

In this paper we focus on compacta $K \subseteq \mathbb{R}^3$ which possess a neighbourhood basis that consists of nested solid tori $T_i$. We call these sets toroidal. In \cite{hecyo1} we defined the genus of a toroidal set as a…

We revisit the role of attractions in liquids and apply these concepts to colloidal suspensions. Two means are used to investigate the structure; the pair correlation function and a recently developed topological method. The latter…

Let $K\subset\mathbb{R}^d$ be a self-similar set generated by an iterated function system $\{\varphi_i\}_{i=1}^m$ satisfying the strong separation condition and let $f$ be a contracting similitude with $f(K)\subset K$. We show that $f(K)$…

In this note we prove two ellipsoid characterization theorems. The first one is that if $K$ is a convex body in a normed space with unit ball $M$, and for any point $p \notin K$ and in any 2-dimensional plane $P$ intersecting $\inter K$ and…

We prove that the relative p-adic monodromy theorem holds over a dense open subset. Moreover, we establish the equivalence of the following two statements: the local constancy of the Newton polygon function associated with a de Rham local…

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

Proves that if a curve has totally split reduction and the corresponding skeleton (as a metric graph) is a chain of loops with generic edge lengths, then every divisor on the graph with imposed ramification at the rightmost vertex $p$ of…

We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…

We study a finite uni-directional array of "cascading" or "threshold coupled" chaotic maps. Such systems have been proposed for use in nonlinear computing and have been applied to classification problems in bioinformatics. We describe some…

For each sequence of polynomials, P=(p_1(t),p_2(t),...), we define a characteristic series of groups, called the derived series localized at P. Given a knot K in S^3, such a sequence of polynomials arises naturally as the orders of certain…