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

Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…

List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…

Necessary and sufficient conditions for a measure to be an extreme point of the set of measures (on an abstract measurable space) with prescribed generalized moments are given, as well as an application to extremal problems over such moment…

Dean conjectured that for each integer $k \ge 3$, every graph with minimum degree at least $k$ has a cycle whose length is divisible by $k$; this conjecture is known to be true for all $k\neq 5$. For $k\in\{3,4\}$, stronger statements are…

In this paper, we investigate the existence and the global stability of periodic solution for dynamical systems with periodic interconnections, inputs and self-inhibitions. The model is very general, the conditions are quite weak and the…

We give a counterexample to the following conjecture: the set of isolated periodic points of an automorphism of degree at least two on an affine space is a set of bounded height. As a positive result, we prove that any cohomologically…

We consider the problems of finding optimal identifying codes, (open) locating-dominating sets and resolving sets of an interval or a permutation graph. In these problems, one asks to find a subset of vertices, normally called a…

A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is…

Let P be a set of n points in the plane, not all on a line. We show that if n is large then there are at least n/2 ordinary lines, that is to say lines passing through exactly two points of P. This confirms, for large n, a conjecture of…

Motivated by a uniform boundedness conjecture of Morton and Silverman, we study the graphs of pre-periodic points for maps in three families of dynamical systems, namely the collections of rational functions of degree two having a periodic…

Let $f$ be a meromorphic function with bounded set of singular values and for which infinity is a logarithmic singularity. Then we show that $f$ has infinitely many repelling periodic points for any minimal period $n\geq1$, using a much…

Finding the maximum number of induced cycles of length $k$ in a graph on $n$ vertices has been one of the most intriguing open problems of Extremal Graph Theory. Recently Balogh, Hu, Lidick\'{y} and Pfender answered the question in the case…

Let $K$ be the graph on vertices $\{1, 2, 3, 4, 5\}$, and having all edges except $(4, 5)$. A continuous map $f:K\to \R^2$ is called an \emph{almost embedding} if $f$-images of non-adjacent edges are disjoint. Take the winding numbers of…

The goal of the paper is to develop a method that will combine the use of variational techniques with regularization methods in order to study existence and multiplicity results for the periodic and the Dirichlet problem associated to the…

A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.

{\em Partial domination problem} is a generalization of the {\em minimum dominating set problem} on graphs. Here, instead of dominating all the nodes, one asks to dominate at least a fraction of the nodes of the given graph by choosing a…

A triangulated piecewise-linear minimal surface in Euclidean 3-space defined using a variational characterization is critical for area amongst all continuous piecewise-linear variations with compact support that preserve the simplicial…

It is $\mathsf{NP}$-hard to determine the minimum number of branching vertices needed in a single-source distance-preserving subgraph of an undirected graph. We show that this problem can be solved in polynomial time if the input graph is…

We show, in particular, that a multivalued map $f$ from a closed subspace $X$ of $\mathbb R^n$ to ${\rm exp}_k(\mathbb R^n)$ has a point of period exactly $M$ if and only if its continuous extension $\tilde f: \beta X\to {\rm exp}_k(\beta…

We compare the performance of several discretizations of the simple pendulum equation in a series of numerical experiments. The stress is put on the long-time behaviour. We choose for the comparison numerical schemes which preserve the…