Related papers: On the cyclicity of hyperbolic polycycles

This paper is concerned with the limit cycles for planar semi-quasi-homogeneous polynomial systems. We give some explicit criteria for the nonexistence and existence of periodic orbits. Let $N=N(p,q,m,n)$ be the maximum number of limit…

Let $G$ be an $n$-vertex graph with $n\ge 3$. A classic result of Dirac from 1952 asserts that $G$ is hamiltonian if $\delta(G)\ge n/2$. Dirac's theorem is one of the most influential results in the study of hamiltonicity and by now there…

For a vertex subset $X$ of a graph $G$, let $\Delta_{t}(X)$ be the maximum value of the degree sums of the subsets of $X$ of size $t$. In this paper, we prove the following result: Let $k$ be a positive integer, and let $G$ be an…

We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…

We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…

Let $Y$ be a smooth projective surface defined over an algebraically closed field $k$ with ${\rm Char}\ k\nmid n$, and let $\pi:X\rightarrow Y$ be a $n$-cyclic covering branched along a smooth divisor $B$. We show that under some conditions…

We study the control system of a Riemannian manifold $M$ of dimension $n$ rolling on the sphere $S^n$. The controllability of this system is described in terms of the holonomy of a vector bundle connection which, we prove, is isomorphic to…

A Hamiltonian cycle of a graph is a closed path which visits each of the vertices once and only once. In this article, Hamiltonian cycles on planar random lattices are considered. The generating function for the number of Hamiltonian cycles…

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…

We consider the random graph $G_{n, {\bf d}}$ chosen uniformly at random from the set of all graphs with a given sparse degree sequence ${\bf d}$. We assume ${\bf d}$ has minimum degree at least 4, at most a power law tail, and place one…

A graph construction that produces a k-regular graph on n vertices for any choice of k >= 3 and n = m(k+1) for integer m >= 2 is described. The number of Hamiltonian cycles in such graphs can be explicitly determined as a function of n and…

We consider group-valued cocycles over a partially hyperbolic diffeomorphism which is accessible volume-preserving and center bunched. We study cocycles with values in the group of invertible continuous linear operators on a Banach space.…

For a (not necessarily locally convex) topological vector space $\mathcal{X}$ of holomorphic functions in one complex variable, we show that the shift invariant subspace generated by a set of polynomials is $\mathcal{X}$ if and only if…

Let $G$ be a graph with the usual shortest-path metric. A graph is $\delta$-hyperbolic if for every geodesic triangle $T$, any side of $T$ is contained in a $\delta$-neighborhood of the union of the other two sides. A graph is chordal if…

An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…

A Berge cycle of length $\ell$ in a hypergraph is an alternating sequence of $\ell$ distinct vertices and $\ell$ distinct edges $v_1,e_1,v_2, \ldots, v_\ell, e_{\ell}$ such that $\{v_i, v_{i+1}\} \subseteq e_i$ for all $i$, with indices…

The aim of this paper is twofold. First, we introduce standard blenders (special hyperbolic sets) and their variations, and prove their fundamental properties on the generation of $C^1$-robust tangencies. In particular, these blenders…

A hypergraph $\mathcal H$ is super-pancyclic if for each $A \subseteq V(\mathcal H)$ with $|A| \geq 3$, $\mathcal H$ contains a Berge cycle with base vertex set $A$. We present two natural necessary conditions for a hypergraph to be…

We call a smooth function of one variable a degree n pseudopolynomial if its n-th derivative has no (real) zeros. An n pseudopolynomial is called hyperbolic if it has exactly n simple zeros. In this short note we describe the necessary and…