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

This paper concerns the restricted 3-body problem. By applying topological methods we give a computer assisted proof of the existence of some classes of periodic orbits, the existence of symbolic dynamics and we give a rigorous lower…

Periodic measures are the time-periodic counterpart to invariant measures for dynamical systems and can be used to characterise the long-term periodic behaviour of stochastic systems. This paper gives sufficient conditions for the…

Let $f$ be a continuous circle map and let $F$ be a lifting of $f$. In this note we study how the existence of a large orbit for $F$ affects its set of periods. More precisely, we show that, if $F$ is of degree $d\geq 1$ and has a periodic…

This note is intended primarily for college calculus students right after the introduction of the Intermediate Value Theorem, to show them how the Intermediate Value Theorem is used repeatedly and straightforwardly to prove the celebrated…

Given a graph G = (V,E) and a positive integer k, the Proper Interval Completion problem asks whether there exists a set F of at most k pairs of (V \times V)\E such that the graph H = (V,E \cup F) is a proper interval graph. The Proper…

Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…

The subject of graph convexity is well explored in the literature, the so-called interval convexities above all. In this work, we explore the cycle convexity, an interval convexity whose interval function is $I(S) = S \cup \{u \mid G[S \cup…

In 1999, Jacobson and Lehel conjectured that for $k \geq 3$, every $k$-regular Hamiltonian graph has cycles of at least linearly many different lengths. This was further strengthened by Verstra\"{e}te, who asked whether the regularity can…

We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs with $k$ terminal vertices. To start with, we show that finding an optimal distance-preserving subgraph is $\mathsf{NP}$-hard…

We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. Using the small subgraph conditioning method, we prove an…

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

Let $f:(\mathbb{C}^n,0)\mapsto(\mathbb{C}^n,0)$ be a germ of an $n$-dimensional holomorphic map. Assume that the origin is an isolated fixed point of each iterate of $f$. Then $\{\mathcal{N}_q(f)\}_{q=1}^{\infty}$, the sequence of the…

We present fully dynamic approximation algorithms for the Maximum Independent Set problem on several types of geometric objects: intervals on the real line, arbitrary axis-aligned squares in the plane and axis-aligned $d$-dimensional…

Let $K$ be a number field. Let $S$ be a finite set of places of $K$ containing all the archimedean ones. Let $R_S$ be the ring of $S$-integers of $K$. In the present paper we consider endomorphisms of $\pro$ of degree 2, defined over $K$,…

Period and index of a curve $X/K$ over a $p$-adic local field $K$ such that the fundamental group $\pi_1(X/K)$ admits a splitting are shown to be powers of $p$. As a consequence, examples of curves over number fields are constructed where…

We give algorithms with running time $2^{O({\sqrt{k}\log{k}})} \cdot n^{O(1)}$ for the following problems. Given an $n$-vertex unit disk graph $G$ and an integer $k$, decide whether $G$ contains (1) a path on exactly/at least $k$ vertices,…

We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions $\mathbb{P}_R$ and $\mathbb{P}_B$ on the positive reals with finite means, colour the real line alternately with red and…

A continous map $f: \mathbb{C}^n \rightarrow \mathbb{C}^N$ is $k$-regular if the image of any $k$ points spans a $k$-dimensional subspace. It is an important problem in topology and interpolation theory, going back to Borsuk and Chebyshev,…

We study the following Steinberg-type problem on circular coloring: for an odd integer $k\ge 3$, what is the smallest number $f(k)$ such that every planar graph of girth $k$ without cycles of length from $k+1$ to $f(k)$ admits a…

We consider a Kepler problem in dimension two or three, with a time-dependent $T$-periodic perturbation. We prove that for any prescribed positive integer $N$, there exist at least $N$ periodic solutions (with period $T$) as long as the…