English
Related papers

Related papers: On the cyclicity of hyperbolic polycycles

200 papers

Let $\mathds{k}$ be a real quadratic number field. Denote by $\mathrm{Cl}_2(\mathds{k})$ its $2$-class group and by $\mathds{k}_2^{(1)}$ (resp. $\mathds{k}_2^{(2)}$) its first (resp. second) Hilbert $2$-class field. The aim of this paper is…

Number Theory · Mathematics 2023-06-22 A Azizi , M Rezzougui , A Zekhnini

We consider diffeomorphisms $f$ with heteroclinic cycles associated to saddles $P$ and $Q$ of different indices. We say that a cycle of this type can be stabilized if there are diffeomorphisms close to $f$ with a robust cycle associated to…

Dynamical Systems · Mathematics 2015-05-27 Christian Bonatti , Lorenzo J. Diaz , Shin Kiriki

Given a discrete subgroup $\Gamma$ of finite co-volume of $\mathrm{PGL}(2,\mathbb{R})$, we define and study parabolic vector bundles on the quotient $\Sigma$ of the (extended) hyperbolic plane by $\Gamma$. If $\Gamma$ contains an…

Differential Geometry · Mathematics 2020-10-14 Indranil Biswas , Florent Schaffhauser

This paper contains theory on two related topics relevant to manifolds of normally hyperbolic singularities. First, theorems on the formal and $ C^k $ normal forms for these objects are proved. Then, the theorems are applied to give…

Dynamical Systems · Mathematics 2021-07-07 Nathan Duignan

Let $\mathcal{H}(n)$ be the maximum number of limit cycles that a planar polynomial vector field of degree $n$ can have. In this paper we prove that $\mathcal{H}(n)$ is realizable by structurally stable vector fields with only hyperbolic…

Dynamical Systems · Mathematics 2024-12-23 Armengol Gasull , Paulo Santana

Let D be an arbitrary subset of the natural numbers. For every n, let M(n;D) be the maximum of the cardinality of a set of Hamiltonian paths in the complete graph K_n such that the union of any two paths from the family contains a not…

Combinatorics · Mathematics 2011-06-21 János Körner , Silvia Messuti , Gábor Simonyi

Let $G$ be a torsion-free hyperbolic group and $\alpha$ an automorphism of $G$. We show that there exists a canonical collection of subgroups that are polynomially growing under $\alpha$, and that the mapping torus of $G$ by $\alpha$ is…

Group Theory · Mathematics 2023-10-24 François Dahmani , Suraj Krishna M S

We consider H\"older continuous $GL(d,\mathbb R)$-valued cocycles, and more generally linear cocycles, over an accessible volume-preserving center-bunched partially hyperbolic diffeomorphism. We study the regularity of a conjugacy between…

Dynamical Systems · Mathematics 2023-09-19 Boris Kalinin , Victoria Sadovskaya

We show that if $n$ is odd and $p \ge C \log n / n$, then with high probability Hamilton cycles in $G(n,p)$ span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties.…

Combinatorics · Mathematics 2024-02-05 Micha Christoph , Rajko Nenadov , Kalina Petrova

Let $G$ be a graph on $n$ vertices and $C'=v_0v_1\cdots v_{p-1}v_0$ a vertex sequence of $G$ with $p\geq 3$ ($v_i\neq v_j$ for all $i,j=0,1,\ldots,p-1$, $i\neq j$). If for any successive vertices $v_i$, $v_{i+1}$ on $C'$, either…

Combinatorics · Mathematics 2016-01-08 Ruonan Li , Bo Ning , Shenggui Zhang

We prove that a cyclic cover of a smooth complex projective variety is Brody hyperbolic if its branch divisor is a generic small deformation of a large enough multiple of a Brody hyperbolic base-point-free ample divisor. We also show the…

Algebraic Geometry · Mathematics 2018-06-19 Yuchen Liu

A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length $\ell$ for all $3 \le \ell \le n$. Write $\alpha(G)$ for the independence number of $G$, i.e. the size of the largest…

Combinatorics · Mathematics 2009-03-27 Peter Keevash , Benny Sudakov

We illustrate with several new applications the power and elegance of the Bendixson Dulac theorem to obtain upper bounds of the number of limit cycles for several families of planar vector fields. In some cases we propose to use a function…

Classical Analysis and ODEs · Mathematics 2021-01-12 Armengol Gasull , Hector Giacomini

It is known that $\Theta(\log n)$ chords must be added to an $n$-cycle to produce a pancyclic graph; for vertex pancyclicity, where every vertex belongs to a cycle of every length, $\Theta(n)$ chords are required. A possibly `intermediate'…

Combinatorics · Mathematics 2014-04-15 Fatima Affif Chaouche , Carrie Rutherford , Robin Whitty

We introduce the concept of cyclicity and hypercyclicity in self-similar groups as an analogue of cyclic and hypercyclic vectors for an operator on a Banach space. We derive a sufficient condition for cyclicity of non-finitary automorphisms…

Group Theory · Mathematics 2026-01-29 Jorge Fariña-Asategui

Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$-partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary…

Combinatorics · Mathematics 2019-10-10 Louis DeBiasio , Robert A. Krueger , Dan Pritikin , Eli Thompson

Let $G$ be a finite group of odd order, $\F$ a finite field of odd characteristic $p$ and $\B$ a finite--dimensional symplectic $\F G$-module. We show that $\B$ is $\F G$-hyperbolic, i.e., it contains a self--perpendicular $\F G$-submodule,…

Group Theory · Mathematics 2022-06-22 Maria Loukaki

We prove that the maximal number of limit cycles which bifurcate from an open period annulus under a given multi-parameter analytic deformation of a given analytic vector field is the same as in an appropriate one-parameter analytic…

Dynamical Systems · Mathematics 2010-05-04 Lubomir Gavrilov

A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…

Combinatorics · Mathematics 2026-04-01 Richard Lang , Nicolás Sanhueza-Matamala

We consider extremal problems for subgraphs of pseudorandom graphs. For graphs $F$ and $\Gamma$ the generalized Tur\'an density $\pi_F(\Gamma)$ denotes the density of a maximum subgraph of $\Gamma$, which contains no copy of~$F$. Extending…

Combinatorics · Mathematics 2016-03-15 Elad Aigner-Horev , Hiep Hàn , Mathias Schacht