相关论文: On an existence problem of periodic points in inte…

An identifying code in a graph is a subset of vertices having a nonempty and distinct intersection with the closed neighborhood of every vertex. We prove that the infimum density of any identifying code in $S_k$ (an infinite strip of $k$…

By studying various rational integrable maps on $\mathbf{\hat C}^d$ with $p$ invariants, we show that periodic points form an invariant variety of dimension $\ge p$ for each period, in contrast to the case of nonintegrable maps in which…

Periodic orbits are important objects of discrete dynamical systems, but finding them is not always easy. We present a self-contained introductory account, aimed at non-experts, to prove their existence and study their stability using the…

An interval $k$-graph is the intersection graph of a family $\mathcal{I}$ of intervals of the real line partitioned into at most $k$ classes with vertices adjacent if and only if their corresponding intervals intersect and belong to…

We present an illustrative application of the two famous mathematical theorems in differential topology in order to show the existence of periodic orbits with arbitrary given period for a class of hamiltonians .This result point out for a…

We propose a novel way of generalizing the class of interval graphs, via a graph width parameter called the simultaneous interval number. This parameter is related to the simultaneous representation problem for interval graphs and defined…

We study the \emph{{interval completion}} problem, which asks for the insertion of a set of at most $k$ edges to make a graph of $n$ vertices into an interval graph. We focus on chordal graphs with no small obstructions, where every…

We investigate the convergence towards periodic orbits in discrete dynamical systems. We examine the probability that a randomly chosen point converges to a particular neighborhood of a periodic orbit in a fixed number of iterations, and we…

Matrix regularity is a key to various problems in applied mathematics. The sufficient conditions, used for checking regularity of interval parametric matrices, usually fail in case of large parameter intervals. We present necessary and…

We study the problem of covering the maximum number of vertices in a graph by a collection of vertex-disjoint stars, each with a number of satellites in a given interval $[k, \ell]$, where $1 \le k < \ell$ and $\ell$ can be infinity. This…

We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for $\lambda\in\{\frac{\pm1\pm\sqrt5}2,\pm\sqrt2,\pm\sqrt3\}$ that all integer sequences $(a_k)_{k\in\mathbb Z}$…

The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph $H$, but good characterisations have been found for only a handful of non-trivial pattern graphs. The complete graph on five vertices,…

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

By studying periodic points for rational maps on $\bm{C}^d$ with $p$ invariants, we show that they form an invariant variety of dimension $p$ if the periodicity conditions are `fully correlated', and a set of isolated points if the…

The existence of elliptic periodic solutions of a perturbed Kepler problem is proved. The equations are in the plane and the perturbation depends periodically on time. The proof is based on a local description of the symplectic group in two…

$k$-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on vertices of cardinality bounded by a parameter $k$. The problem…

Let $f$ be a covering map of the open annulus $A= S^1\times (0,1)$ of degree $d$ , $|d|>1$. Assume that $f$ preserves an essential (i.e not contained in a disk of $A$) compact subset $K$. We show that $f$ has at least the same number of…

We prove that for continuous maps on the interval, the existence of an n-cycle, implies the existence of n-1 points which interwind the original ones and are permuted by the map. We then use this combinatorial result to show that piecewise…

We present a systematic methodology to determine and locate analytically isolated periodic points of discrete and continuous dynamical systems with algebraic nature. We apply this method to a wide range of examples, including a…

This paper investigates the asymptotic nature of graph spectra when some edges of a graph are subdivided sufficiently many times. In the special case where all edges of a graph are subdivided, we find the exact limits of the $k$-th largest…