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

Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…

In this paper, we consider a planar dynamical system with a piecewise linear function containing an arbitrary number (but finite) of dropping sections and approximating some continuous nonlinear function. Studying all possible local and…

We study periodic, piecewise linear maps on the plane starting with the Mort Brown's map. We show that if the number of pieces is two, there is only a short list of possible periods (this fact can be seen as the crystallographic restriction…

A proper edge coloring of a graph $G$ with colors $1,2,\dots,t$ is called a cyclic interval $t$-coloring if for each vertex $v$ of $G$ the edges incident to $v$ are colored by consecutive colors, under the condition that color $1$ is…

We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…

Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a single exponential FPT algorithm with running time O(c^kn(n+m)), c= min {18,k} that turns graph G into an interval graph by deleting at most k…

We use Wagner's algorithm to estimate the number of periodic points of certain selfmaps on compact surfaces with boundary. When counting according to homotopy classes, we can use the asymptotic density to measure the size of sets of…

We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…

Let $n$ and $k$ be positive integers, and let $F$ be an alphabet of size $n$. A sequence over $F$ of length $m$ is a \emph{$k$-radius sequence} if any two distinct elements of $F$ occur within distance $k$ of each other somewhere in the…

In this paper, we introduce the concept of central periodic points of a linear system as points which lies on orbits starting and ending at the central subgroup of the system. We show that this set is bounded if and only if the central…

For a continuous map $f$ from the real line (half-open interval $[0,1)$) into itself let ent(f) denote the supremum of topological entropies of $f|_K$, where $K$ runs over all compact $f$-invariant subsets of $\mathbb{R}$ ($[0,1)$,…

We study the existence of Artin-Schreier curves with large $ a$-number. We also give bounds on the $a$-number of trigonal curves of genus $5$ in small characteristic.

In this follow-up paper, we again inspect a surprising relationship between the set of $m$-periodic points of a polynomial map $\varphi_{d, c}$ defined by $\varphi_{d, c}(z) = z^d + c$ for all $c, z \in \mathcal{O}_{K}$ and the coefficient…

We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…

We prove the Conley conjecture for a closed symplectically aspherical symplectic manifold: a Hamiltonian diffeomorphism of a such a manifold has infinitely many periodic points. More precisely, we show that a Hamiltonian diffeomorphism with…

A temporal graph is a finite sequence of graphs, called snapshots, over the same vertex set. Many temporal graph problems turn out to be much more difficult than their static counterparts. One such problem is \textsc{Timeline Vertex Cover}…

A conjecture by Lichiardopol states that for every $k \ge 1$ there exists an integer $g(k)$ such that every digraph of minimum out-degree at least $g(k)$ contains $k$ vertex-disjoint directed cycles of pairwise distinct lengths. Motivated…

A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…

A continuous map $f$ from a compact interval $I$ into itself is densely (resp. generically) chaotic if the set of points $(x,y)$ such that $\limsup_{n\to+\infty}|f^n(x)-f^n(y)|>0$ and $\liminf_{n\to+\infty} |f^n(x)-f^n(y)|=0$ is dense…

The FitzHugh-Nagumo model describing propagation of nerve impulses in axon is given by fast-slow reaction-diffusion equations, with dependence on a parameter $\epsilon$ representing the ratio of time scales. It is well known that for all…