中文
相关论文

相关论文: Planar maps whose second iterate has a unique fixe…

200 篇论文

In this article we consider the action of affine group and time rescaling on planar quadratic differential systems. We construct a system of representatives of the orbits of systems with at least five invariant lines, including the line at…

动力系统 · 数学 2007-05-23 Dana Schlomiuk , Nicolae Vulpe

A Moebius system is an ergodic fibred system $(B,T)$ (see \citer5) defined on an interval $B=[a,b]$ with partition $(J_k),k\in I,#I\geq 2$ such that $Tx=\frac{c_k+d_kx}{a_k+b_kx}$, $x\in J_k$ and $T|_{J_k}$ is a bijective map from $J_k$…

动力系统 · 数学 2007-05-23 Fritz Schweiger

We show that every homomorphism from a one-dimensional Peano continuum to a planar Peano continuum is induced by a continuous map up to conjugation. We then prove that the topological structure of the space of points at which a planar Peano…

代数拓扑 · 数学 2013-05-20 Gregory Conner , Curt Kent

We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…

谱理论 · 数学 2007-05-23 Marianne Akian , Stephane Gaubert

We prove that if $G\subset\text{Diff}^{1}(\mathbb{R}^2)$ is an Abelian subgroup generated by a family of commuting diffeomorphisms of the plane, all of which are $C^{1}$-close to the identity in the strong $C^{1}$-topology, and if there…

动力系统 · 数学 2015-03-17 S. Firmo

The ordinary differential equation $\dot{x}(t)=f(x(t)), \; t \geq 0 $, for $f$ measurable, is not sufficiently regular to guarantee existence of solutions. To remedy this we may relax the problem by replacing the function $f$ with its…

最优化与控制 · 数学 2020-03-03 Mira Bivas , Aris Daniilidis , Marc Quincampoix

Given a finite simple graph G, let G' be its barycentric refinement: it is the graph in which the vertices are the complete subgraphs of G and in which two such subgraphs are connected, if one is contained into the other. If L(0)=0<L(1) <=…

离散数学 · 计算机科学 2015-08-11 Oliver Knill

Let V, W be real algebraic varieties (that is, up to isomorphism, real algebraic sets), and let X be a subset of V. A map f from X into W is said to be regular if it can be extended to a regular map defined on some Zariski locally closed…

代数几何 · 数学 2017-05-15 Wojciech Kucharz

Fessler and Gutierrez \cite{Fe,Gu} proved that if a non-singular planar map has Jacobian matrix without eigenvalues in $(0,+\infty)$, then it is injective. We prove that the same holds replacing $(0,+\infty)$ with any unbounded curve…

经典分析与常微分方程 · 数学 2022-02-14 Marco Sabatini

In this paper, we consider two ways of breaking a graph's symmetry: distinguishing labelings and fixing sets. A distinguishing labeling $\phi$ of $G$ colors the vertices of $G$ so that the only automorphism of the labeled graph $(G, \phi)$…

组合数学 · 数学 2025-07-15 Christine T. Cheng

We show various criteria to verify if a given nested fractal has a good labeling property, inter alia we present a characterization of GLP for fractals with an odd number of essential fixed points. We show a convenient reduction of area to…

度量几何 · 数学 2021-11-01 Mikołaj Nieradko , Mariusz Olszewski

We say that a fixed point of a diffeomorphism is non-degenerate if 1 is not an eigenvalue of the linearization at the fixed point. We use pseudo-holomorphic curves techniques to prove the following: the inclusion map $$i: \text{Diff} ^{1}…

辛几何 · 数学 2016-09-27 Yasha Savelyev

Let $P$ be a set of $n\geq 2$ points in general position in $R^2$. The edge disjointness graph $D(P)$ of $P$ is the graph whose vertices are all the closed straight line segments with endpoints in $P$, two of which are adjacent in $D(P)$ if…

组合数学 · 数学 2023-04-07 J. Leaños , Christophe Ndjatchi , L. M. Ríos-Castro

Let $\mathcal{C}(S^{m})$ denote the set of continuous maps from the unit sphere $S^{m}$ in $\mathbb{R}^{m+1}$ into itself endowed with the supremum norm. We prove that the set $\{f^n: f\in \mathcal{C}(S^{m})~\text{and}~n\ge 2\}$ of iterated…

动力系统 · 数学 2023-01-27 Chaitanya Gopalakrishna

An edge colouring of a graph is called distinguishing if there is no non-trivial automorphism which preserves it. We prove that every at most countable, finite or infinite, connected regular graph of order at least $7$ admits a…

组合数学 · 数学 2025-02-25 Jakub Kwaśny , Marcin Stawiski

We give synthetic proofs of many new results in triangle geometry, focusing especially on fixed points of certain affine maps which are defined in terms of the cevian triangle $DEF$ of a point $P$ with respect to a given triangle $ABC$, as…

综合数学 · 数学 2017-11-28 Igor Minevich , Patrick Morton

A reparametrization (of a continuous path) is given by a surjective weakly increasing self-map of the unit interval. We show that the monoid of reparametrizations (with respect to compositions) can be understood via ``stop-maps'' that allow…

一般拓扑 · 数学 2007-06-26 Martin Raussen , Ulrich Fahrenberg

Consider a multimodal interval map $f$ of $C^3$ with non-flat critical points. We establish several characterizations of the map $f$ is quasi-symmetrically conjugated to a piecewise affine map in the case $f$ is topologically exact and all…

动力系统 · 数学 2013-10-01 Huaibin Li

Let $q$ be a prime and $A$ an elementary abelian group of order at least $q^3$ acting by automorphisms on a finite $q'$-group $G$. It is proved that if $|\gamma_{\infty}(C_{G}(a))|\leq m$ for any $a\in A^{\#}$, then the order of…

群论 · 数学 2019-02-20 Emerson de Melo , Pavel Shumyatsky

A graph is reducible if it is the lexicographic product of two smaller non-trivial graphs. It is well-known a 1-planar graph with $n ~(\ge3)$ vertices has at most $4n-8$ edges, and a graph $G$ with $n$ vertices is optimal if $G$ has exactly…

组合数学 · 数学 2024-12-20 Licheng Zhang , Yuanqiu Huang
‹ 上一页 1 8 9 10 下一页 ›