Related papers: Orbits of turning points for maps of finite graphs…

Let $X$ be a regular curve and let $f: X\to X$ be a monotone map. In this paper, nonwandering set of $f$ and the structure of special $\alpha$-limit sets for $f$ are investigated. We show that AP$(f)= \textrm{R}(f) =\Omega(f)$, where…

We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the…

Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

We consider ruled surfaces with finite multiplicity. We study behaviors of the striction curves and the singularities of the ruled surfaces. We also give geometric meanings of invariants related to the ruled surfaces.

The farthest point map sends a point in a compact metric space to the set of points farthest from it. We focus on the case when this metric space is a convex centrally symmetric polyhedron, so that we can compose the farthest point map with…

We provide a complete characterisation of extreme points of the space of sofic representations. We also show that the restriction map $Sof(G,P^{\omega})$ to $Sof(H,P^{\omega})$, where $H\subset G$ is not always surjective. The first part of…

In this monography, it is proposed to consider the concepts of spectra of edge cuts and edge cycles of a graph as a basic mathematical structure for solving the problem of graph isomorphism. An edge cut is defined by an edge and the…

We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…

For convex domains with $C^{1,\epsilon}$ boundary we give a precise description of the automorphism group: if an orbit of the automorphism group accumulates on at least two different closed complex faces of the boundary, then the…

We will show that all inverse limits of finite rank free groups index by the natural numbers are isomorphic either to a finite rank free group or to a fixed universal group. In other words, any inverse system of finite rank free groups…

The shift graph is defined on the space of infinite subsets of natural numbers by letting two sets be adjacent if one can be obtained from the other by removing its least element. We show that this graph is not a minimum among the graphs of…

This is a survey of topological properties of open, complete nonpositively curved manifolds which may have infinite volume. Topics include topology of ends, restrictions on the fundamental group, as well as a review of known examples.

We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…

For a shift-invariant weighted directed graph with vertex set $\mathbb{Z}$, we examine the minimal weight $\kappa_0$ exiting a finite, strongly connected set of vertices. Although $\kappa_0$ is defined as an infimum, it has been shown that…

In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…

For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…

We consider the flip-width of geometric graphs, a notion of graph width recently introduced by Toru\'nczyk. We prove that many different types of geometric graphs have unbounded flip-width. These include interval graphs, permutation graphs,…

We consider the problem of determining the inducibility (maximum possible asymptotic density of induced copies) of oriented graphs on four vertices. We provide exact values for more than half of the graphs, and very close lower and upper…

If $f:\mathbb{R}^2\rightarrow \mathbb{R}^2$ is an orientation reversing fixed point free homeomorphism on the plane $\mathbb{R}^2$ with no unbounded orbit, then $f$ has infinitely many periodic orbits.