相关论文: A Combinatorial Classification of Postcritically F…
Postnikov constructed a decomposition of a totally nonnegative Grassmannian into positroid cells. We provide combinatorial formulas that allow one to decide which cell a given point belongs to and to determine affine coordinates of the…
In this paper we study the existence and uniqueness of fixed points of a class of mappings defined on complete, (sequentially compact) cone metric spaces, without continuity conditions and depending on another function.
The purpose of this article is to explore a few properties of polynomial shift-like automorphisms of $\mathbb{C}^k.$ We first prove that a $\nu-$shift-like polynomial map (say $S_a$) degenerates essentially to a polynomial map in…
This article is meant as a mathematical appendix or comment on [BT]. We first consider the notion of transcritical bifurcations of fixed points of general area-preserving maps, and then adress some questions related to [BT] on bifurcation…
We extend Sullivan's complex a priori bounds to real quadratic polynomials with essentially bounded combinatorics. Combined with the previous results of the first author, this yields complex bounds for all real quadratics. Local…
This paper investigates conditions under which canonical cofinal maps of the following three types exist: continuous, generated by finitary end-extension preserving maps, and generated by finitary maps. The main theorems prove that every…
New fixed point results are presented for ${\cal U}_c^{\kappa}(X,X)$ maps in extension type spaces.
We consider the family of dynamical modular curves associated to quadratic polynomial maps and determine precisely which of these curves have infinitely many cubic points. We use this to prove a classification statement on preperiodic…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.
By a fixed continuous map from a $3$-space to itself, a knot in the $3$-space may be mapped to another knot in the $3$-space. We analyze possible knot types of them. Then we map a knot repeatedly by a fixed continuous map and analyze…
We introduce and study a new type of mappings in metric spaces termed $n$-point Kannan-type mappings. A fixed-point theorem is proved for these mappings. In general case such mappings are discontinuous in the domain but necessarily…
Kakutani's fixed point theorem is a generalization of Brouwer's fixed point theorem to upper semicontinuous multivalued maps and is used extensively in game theory and other areas of economics. Earlier works have shown that Sperner's lemma…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
In the paper "Infinite product representations for kernels and iterations of functions", the authors associate certain Fatou subsets with reproducing kernel Hilbert spaces. They also present a method for constructing an orthonormal basis…
Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…
Dynamics on parabolic immediate basins for rational Newton maps of entire functions have been studied. It is proved that every parabolic immediate basin contains invariant accesses to the parabolic fixed point at infinity. Moreover, among…
We investigate elementary topological properties of sets of completely positive (CP) maps that arise in quantum Perron-Frobenius theory. We prove that the set of primitive CP maps of fixed Kraus rank is path-connected and we provide a…
Let $X$, $Y$ be sets and let $\Phi$, $\Psi$ be mappings with domains $X^{2}$ and $Y^{2}$ respectively. We say that $\Phi$ and $\Psi$ are combinatorially similar if there are bijections $f \colon \Phi(X^2) \to \Psi(Y^{2})$ and $g \colon Y…
In this paper, we revisit the chaotic number of iterations needed by Newton's method to converge to a root. Here, we consider a simple modified Newton method depending on a parameter. It is demonstrated using polynomiography that even in…