Related papers: Partitions of $n$-valued maps
This paper concerns various models of ``at-most-$n$-valued maps''. That is, multivalued maps $f:X\multimap Y$ for which $f(x)$ has cardinality at most $n$ for each $x$. We consider 4 classes of such maps which have appeared in the…
We study the fixed point theory of n-valued maps of a space X using the fixed point theory of maps between X and its configuration spaces. We give some general results to decide whether an n-valued map can be deformed to a fixed point free…
This paper defines, for each graph $G$, a flag vector $fG$. The flag vectors of the graphs on $n$ vertices span a space whose dimension is $p(n)$, the number of partitions on $n$. The analogy with convex polytopes indicates that the linear…
A fractal can be simply understood as a set or pattern in which there are far more small things than large ones, e.g., far more small geographic features than large ones on the earth surface, or far more large-scale maps than small-scale…
We give an axiomatic characterization of the fixed point index of an $n$-valued map. For $n$-valued maps on a polyhedron, the fixed point index is shown to be unique with respect to axioms of homotopy invariance, additivity, and a splitting…
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.
Many classes of maps are characterized as (possibly multi-valued) maps preserving particular types of compact filters.
Determining the range of complex maps plays a fundamental role in the study of several complex variables and operator theory. In particular, one is often interested in determining when a given holomorphic function is a self-map of the unit…
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
This paper deepens the connections between critically finite rational maps and finite subdivision rules. The main theorem is that if f is a critically finite rational map with no periodic critical points, then for any sufficiently large…
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
Partitions of unity in ${\mathbf R}^d$ formed by (matrix) scales of a fixed function appear in many parts of harmonic analysis, e.g., wavelet analysis and the analysis of Triebel-Lizorkin spaces. We give a simple characterization of the…
In this paper we construct $n$-valued maps on $k$-dimensional tori, where $n,k\geq 2$, that are not homotopic to affine $n$-valued maps. This is in high contrast with the single valued case, where any such map is homotopic to an affine…
We characterize which graph invariants are partition functions of a spin model over the complex numbers, in terms of the rank growth of associated `connection matrices'.
We consider a modified notion of planarity, in which two nations of a map are considered adjacent when they share any point of their boundaries (not necessarily an edge, as planarity requires). Such adjacencies define a map graph. We give…
In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
In this paper, we explore the fixed point theory of $n$-valued maps using configuration spaces and braid groups, focussing on two fundamental problems, the Wecken property, and the computation of the Nielsen number. We show that the…
We study maps from a 2D world-sheet to a 2D target space which include folds. The geometry of folds is discussed and a metric on the space of folded maps is written down. We show that the latter is not invariant under area preserving…
A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…