Related papers: Complexity of injective piecewise contracting inte…
We propose a systematic approach to the construction of invariant union of polytopes (IUP) in expanding piecewise affine mappings whose linear components are isotropic scalings. The approach relies on using empirical information embedded in…
We describe the global dynamics of some pointwise periodic piecewise linear maps in the plane that exhibit interesting dynamic features. For each of these maps we find a first integral. For these integrals the set of values are discrete,…
It is well known that selecting a good Mixed Integer Programming (MIP) formulation is crucial for an effective solution with state-of-the art solvers. While best practices and guidelines for constructing good formulations abound, there is…
We consider a class of doubly intermittent maps with critical points, unbounded derivative and regularly varying tails. Under some mild assumptions we prove the existence of a unique mixing absolutely continuous invariant measure and give…
We consider the dynamics of `nonlinear tent maps': piecewise smooth unimodal maps with nowhere vanishing derivative. We show that if a nonlinear tent map $f$ is not infinitely renormalizable, then all its periodic orbits of sufficiently…
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…
We consider the problem of determining, given x, y in Z^k and a finite set F of affine functions on Z^k, whether y is reachable from x by applying the functions F. We also consider the analogous problem over N^k. These problems are known to…
The exact computation of orbits of discrete dynamical systems on the interval is considered. Therefore, a multiple-precision floating point approach based on error analysis is chosen and a general algorithm is presented. The correctness of…
We give two results for deducing dynamical properties of piecewise M\"obius interval maps from their related planar extensions. First, eventual expansivity and the existence of an ergodic invariant probability measure equivalent to Lebesgue…
Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…
The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.
Let $\mathcal{R}$ be a $2$-torsion free commutative ring with unity, $X$ a locally finite pre-ordered set and $I(X,\mathcal{R})$ the incidence algebra of $X$ over $\mathcal{R}$. If $X$ consists of a finite number of connected components, in…
We prove some basic results for a dynamical system given by a piecewise linear and contractive map on the unit interval that takes two possible values at a point of discontinuity. We prove that there exists a universal limit cycle in the…
This work is motivated by the following question in data-driven study of dynamical systems: given a dynamical system that is observed via time series of persistence diagrams that encode topological features of solutions snapshots, what…
Sampling-based motion planners have proven to be efficient solutions to a variety of high-dimensional, geometrically complex motion planning problems with applications in several domains. The traditional view of these approaches is that…
We prove finiteness and give an explicit upper bound on the number of $S$-integral points on affine curves satisfying a certain rank-genus inequality. We achieve this by developing an analogue of the Chabauty method, embedding the curve…
We study the asymptotic expansion of smooth one-dimensional maps. We give an example of an interval map for which the optimal shrinking of components exponential rate is not attained for any neighborhood of a certain fixed point in the…
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of…
We consider the matching augmentation problem (MAP), where a matching of a graph needs to be extended into a $2$-edge-connected spanning subgraph by adding the minimum number of edges to it. We present a polynomial-time algorithm with an…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…