English
Related papers

Related papers: Realization problems for limit cycles of planar po…

200 papers

Consider a smooth vector field $f\colon \mathbb{R}^n\to\mathbb{R}^n$ and a maximal solution $\gamma\colon \,]a,b[\,\to \mathbb{R}^n$ to the ordinary differential equation $x'=f(x)$. It is a well-known fact that, if $\gamma$ is bounded, then…

Functional Analysis · Mathematics 2014-03-27 Rafael Dahmen , Helge Glockner

Planar polynomial automorphisms are polynomial maps of the plane whose inverse is also a polynomial map. A map is reversible if it is conjugate to its inverse. Here we obtain a normal form for automorphisms that are reversible by an…

Chaotic Dynamics · Physics 2010-06-22 A. Gomez , J. D. Meiss

The free space diagram is a popular tool to compute the well-known Fr\'echet distance. As the Fr\'echet distance is used in many different fields, many variants have been established to cover the specific needs of these applications. Often,…

Computational Geometry · Computer Science 2023-11-14 Hugo A. Akitaya , Maike Buchin , Majid Mirzanezhad , Leonie Ryvkin , Carola Wenk

In a recent paper [3], the authors introduced a map $\mathcal{F}$ which associates a Deitmar scheme (which is defined over the field with one element, denoted by $\mathbb{F}_1$) with any given graph $\Gamma$. By base extension, a scheme…

Algebraic Geometry · Mathematics 2016-05-10 Manuel Merida-Angulo , Koen Thas

We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…

Combinatorics · Mathematics 2019-07-29 Egon Schulte , Pablo Soberón , Gordon Ian Williams

We study the following generalization of the Hamiltonian cycle problem: Given integers $a,b$ and graph $G$, does there exist a closed walk in $G$ that visits every vertex at least $a$ times and at most $b$ times? Equivalently, does there…

Computational Complexity · Computer Science 2024-05-28 Brian Liu , Nathan S. Sheffield , Alek Westover

We investigate the controllability of an infinite-dimensional quantum system: a quantum particle confined on a Thick Quantum Graph, a generalisation of Quantum Graphs whose edges are allowed to be manifolds of arbitrary dimension with…

Mathematical Physics · Physics 2023-07-20 Aitor Balmaseda , Davide Lonigro , Juan Manuel Pérez-Pardo

We show that in multidimensional gravity vector fields completely determine the structure and properties of singularity. It turns out that in the presence of a vector field the oscillatory regime exists for any number of spatial dimensions…

General Relativity and Quantum Cosmology · Physics 2016-11-15 Riccardo Benini , Alexander A. Kirillov , Giovanni Montani

We prove that all immersions of a genus one surface into G/T possessing a Toda frame can be constructed by integrating a pair of commuting vector fields on a finite dimensional Lie algebra. Here G is any simple real Lie group (not…

Differential Geometry · Mathematics 2011-11-18 Emma Carberry , Katharine Turner

For planar polynomials systems the existence of an invariant algebraic curve limits the number of limit cycles not contained in this curve. We present a general approach to prove non existence of periodic orbits not contained in this given…

Classical Analysis and ODEs · Mathematics 2022-10-31 Armengol Gasull , Hector Giacomini

In this paper, the global qualitative analysis of planar quadratic dynamical systems is established and a new geometric approach to solving Hilbert's Sixteenth Problem in this special case of polynomial systems is suggested. Using geometric…

Dynamical Systems · Mathematics 2007-05-23 Valery A. Gaiko

We show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…

Computational Complexity · Computer Science 2025-07-01 Somnath Bhattacharjee , Mrinal Kumar , Shanthanu S. Rai , Varun Ramanathan , Ramprasad Saptharishi , Shubhangi Saraf

A cycle is algebraically trivial if it can be exhibited as the difference of two fibers in a family of cycles parameterized by a smooth scheme. Over an algebraically closed field, it is a result of Weil that it suffices to consider families…

Algebraic Geometry · Mathematics 2020-02-27 Jeff Achter , Sebastian Casalaina-Martin , Charles Vial

Let $\nabla$ be a meromorphic connection on a vector bundle over a compact Riemann surface $\Gamma$. An automorphism $\sigma:\Gamma\to\Gamma$ is called a symmetry of $\nabla$ if the pull-back bundle and the pull-back connection can be…

Algebraic Geometry · Mathematics 2010-09-07 Camilo Sanabria

An analytic classification of generic anti-polynomial vector fields $\dot z = \overline{P(z)}$ is given in term of a topological and an analytic invariants. The number of generic strata in the parameter space is counted for each degree of…

Dynamical Systems · Mathematics 2025-05-20 Jonathan Godin , Jérémy Perazzelli

For any torsion-free hyperbolic group $\Gamma$ and any group $G$ that is fully residually $\Gamma$, we construct algorithmically a finite collection of homomorphisms from $G$ to groups obtained from $\Gamma$ by extensions of centralizers,…

Group Theory · Mathematics 2013-02-12 Olga Kharlampovich , Jeremy Macdonald

It has been known for almost $40$ years that general planar quadratic polynomial systems can have four limit cycles. Recently, four limit cycles were also found in near-integrable quadratic polynomial systems. To help more people to…

Chaotic Dynamics · Physics 2020-12-30 Pei Yu , Yanni Zeng

Under a suitable notion of equivalence of integral densities we prove a $\Gamma$-closure theorem for integral functionals: The limit of a sequence of $\Gamma$-convergent families of such functionals is again a $\Gamma$-convergent family.…

Analysis of PDEs · Mathematics 2013-08-06 Martin Jesenko , Bernd Schmidt

Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…

Discrete Mathematics · Computer Science 2019-08-20 Michele Conforti , Samuel Fiorin , Tony Huynh , Gwenaël Joret , Stefan Weltge

This paper is devoted to the problem of classification, up to smooth isomorphisms or up to orbital equivalence, of smooth integrable vector fields on 2-dimensional surfaces, under some nondegeneracy conditions. The main continuous…

Dynamical Systems · Mathematics 2012-04-10 Nguyen Tien Zung , Nguyen Van Minh
‹ Prev 1 8 9 10 Next ›