Related papers: What is a stable log map?
We give some basic properties of strongly topologically transitive, supermixing, and hypermixing maps on general topological spaces. Then we present some other results for which our mappings need to be continuous.
Topological data analysis can provide insight on the structure of weighted graphs and digraphs. However, some properties underlying a given (di)graph are hardly mappable to simplicial complexes. We introduce \textit{steady} and…
We introduce the notion of a relative log scheme with boundary: a morphism of log schemes together with a (log schematically) dense open immersion of its source into a third log scheme. The sheaf of relative log differentials naturally…
A graph homomorphism between two graphs is a map from the vertex set of one graph to the vertex set of the other graph, that maps edges to edges. In this note we study the range of a uniformly chosen homomorphism from a graph G to the…
A rooted planar map is a connected graph embedded in the 2-sphere, with one edge marked and assigned an orientation. A term of the pure lambda calculus is said to be linear if every variable is used exactly once, normal if it contains no…
Let $X$ be a compact toric variety. Let $Hol$ denote the space of based holomorphic maps from $CP^1$ to $X$ which lie in a fixed homotopy class. Let $Map$ denote the corresponding space of continuous maps. We show that $Hol$ has the same…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
Let $f: X \to Y$ be a regular covering of a surface $Y$ of finite type with nonempty boundary, with finitely-generated (possibly infinite) deck group $G$. We give necessary and sufficient conditions for an integral homology class on $X$ to…
A stabilized polydisc is a product of a symplectic polydisc and several copies of the complex plane. This paper gives a complete characterization of symplectic embeddings of stabilized polydiscs into other stabilized polydiscs.
We use twisted stable maps to compute the number of rational degree d plane curves having prescribed contacts to a smooth plane cubic.
With the aid of the concept of stable independence we can construct, in an efficient way, a compact representation of a semi-graphoid independence relation. We show that this representation provides a new necessary condition for the…
We study the dynamics in the neighborhood of fixed points in a 4D symplectic map by means of the color and rotation method. We compare the results with the corresponding cases encountered in galactic type potentials and we find that they…
The logarithmic multiplicative group is a proper group object in logarithmic schemes, which morally compactifies the usual multiplicative group. We study the structure of the stacks of logarithmic maps from rational curves to this…
We introduce the notion of a conical symplectic variety, and show that any symplectic resolution of such a variety is isomorphic to the Springer resolution of a nilpotent orbit in a semisimple Lie algebra, composed with a linear projection.
(This is an updated version; following an idea of Voevodsky, we have strengthened our results so all of them apply to one form of motivic homotopy theory). We give two general constructions for the passage from unstable to stable homotopy…
We show that any smooth one-dimensional link in the real projective three-plane is the fixed-point locus of a smooth symplectic surface in the complex projective three-plane which is invariant under complex conjugation. The degree of the…
We examine shifted symplectic and Poisson structures on spaces of framed maps. We prove some results about shifted Poisson structures analogous to those in existing ones about symplectic structures. Then, we consider the space Map(X,D,Y) of…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
We consider stabilities for the weighted length or energy functional of a discrete map from a finite weighted graph $(X,m_{E})$ into a smooth Riemannian manifold $(M,g)$. We prove the non-existence of a stable discrete minimal immersion or…