English
Related papers

Related papers: The structures of pointwise recurrent quasi-graph …

200 papers

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

Combinatorics · Mathematics 2018-01-03 Chaya Keller , Yael Stein

A curve \gamma in the plane is t-monotone if its interior has at most t-1 vertical tangent points. A family of t-monotone curves F is \emph{simple} if any two members intersect at most once. It is shown that if F is a simple family of n…

Combinatorics · Mathematics 2013-07-10 Andrew Suk

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

Combinatorics · Mathematics 2023-05-09 Hajime Tanaka

Let $X$ be a compact Riemann surface. Let $f$ be a holomorphic self-correspondence of $X$ with dynamical degrees $d_1$ and $d_2$. Assume that $d_1\neq d_2$ or $f$ is non-weakly modular. We show that the graphs of the iterates $f^n$ of $f$…

Dynamical Systems · Mathematics 2026-05-27 Muhan Luo

Let $G$ be a group of permutations acting on an $n$-vertex set $V$, and $X$ and $Y$ be two simple graphs on $V$. We say that $X$ and $Y$ are $G$-isomorphic if $Y$ belongs to the orbit of $X$ under the action of $G$. One can naturally…

Combinatorics · Mathematics 2007-05-23 Bhalchandra D. Thatte

Given $X$ a smooth projective toric variety, we construct a morphism from a closed substack of the moduli space of stable maps to $X$ to the moduli space of quasimaps to $X$. If $X$ is Fano, we show that this morphism is surjective. The…

Algebraic Geometry · Mathematics 2024-12-24 Alberto Cobos Rabano

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\lambda$ be a simplicial map of the complex of curves, $\mathcal{C}(N)$, on $N$ which satisfies the following: $[a]$ and $[b]$ are…

Geometric Topology · Mathematics 2012-04-06 Elmas Irmak

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

Combinatorics · Mathematics 2014-08-26 K. Győry , L. Hajdu , R. Tijdeman

We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…

Geometric Topology · Mathematics 2014-10-14 Ariadna Fossas , Hugo Parlier

Consider the set $\chi^0_{\mathrm{nw}}$ of non-wandering continuous flows on a closed surface. Then such a flow can be approximated by regular non-wandering flows without heteroclinic connections nor locally dense orbits in…

Dynamical Systems · Mathematics 2017-07-19 Tomoo Yokoyama

Let f be a germ of holomorphic self-map of C^2 at the origin O tangent to the identity, and with O as a non-dicritical isolated fixed point. A parabolic curve for f is a holomorphic f-invariant curve, with O on the boundary, attracted by O…

Complex Variables · Mathematics 2011-11-10 Laura Molino

This paper considers the task of connecting points on a piece of paper by drawing a curve between each pair of them. Under mild assumptions, we prove that many pairwise disjoint curves are unavoidable if either of the following rules is…

Computational Geometry · Computer Science 2026-03-06 Alexandra Weinberger , Ji Zeng

We consider a one-parameter family of piecewise isometries of a rhombus. The rotational component is fixed, and its coefficients belong to the quadratic number field $K=\mathbb{Q}(\sqrt{2})$. The translations depend on a parameter $s$ which…

Dynamical Systems · Mathematics 2014-06-27 John H. Lowenstein , Franco Vivaldi

Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective…

Combinatorics · Mathematics 2012-10-18 Jan Hubicka , Jürgen Jost , Yangjing Long , Peter F. Stadler , Ling Yang

In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using…

Combinatorics · Mathematics 2009-07-10 Joy Morris , Cheryl E. Praeger , Pablo Spiga

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

Group Theory · Mathematics 2023-03-07 Gareth A. Jones , Martin Mačaj

Let $p$ be a real number greater number greater than one. Suppose that a graph $G$ of bounded degree is quasi-isometric with a Riemannian manifold $M$ with certain properties. Under these conditions we will show that the $p$-harmonic…

Functional Analysis · Mathematics 2010-02-05 Michael J. Puls

Two given orbits of a minimal circle homeomorphism $f$ are said to be geometrically equivalent if there exists a quasisymmetric circle homeomorphism identifying both orbits and commuting with $f$. By a well-known theorem due to Herman and…

Dynamical Systems · Mathematics 2021-10-04 Edson de Faria , Pablo Guarino

In this paper we show that the group of automorphisms of a non-recurrent tent map inverse limit is very simple by demonstrating that every homeomorphism of such a space is isotopic to a power of the induced shift homeomorphism.

Dynamical Systems · Mathematics 2019-03-29 Louis Block , James Keesling , Brian Raines , Sonja Stimac

Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…

Combinatorics · Mathematics 2016-11-08 Ameneh Farhadian
‹ Prev 1 8 9 10 Next ›