Related papers: Ergodicity of polygonal slap maps
We continue our study of the dynamics of mappings with small topological degree on (projective) complex surfaces. Previously, under mild hypotheses, we have constructed an ergodic ``equilibrium'' measure for each such mapping. Here we study…
The $\lambda$-perfect maps, a generalization of perfect maps (continuous closed maps with compact fibers) are presented. Using $P_\lambda$-spaces and the concept of $\lambda$-compactness some results regarding $\lambda$-perfect maps will be…
We show that the average size of self-avoiding polygons (SAP) with a fixed knot is much larger than that of no topological constraint if the excluded volume is small and the number of segments is large. We call it topological swelling. We…
We analyze a probabilistic algorithm for matching shapes modeled by planar regions under translations and rigid motions (rotation and translation). Given shapes $A$ and $B$, the algorithm computes a transformation $t$ such that with high…
We establish a higher dimensional counterpart of Bourgain's pointwise ergodic theorem along an arbitrary integer-valued polynomial mapping. We achieve this by proving variational estimates $V_r$ on $L^p$ spaces for all $1<p<\infty$ and…
In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not…
For random piecewise linear systems T of the interval that are expanding on average we construct explicitly the density functions of absolutely continuous T-invariant measures. In case the random system uses only expanding maps our…
We study the limiting behavior of multiple ergodic averages involving several not necessarily commuting measure preserving transformations. We work on two types of averages, one that uses iterates along combinatorial parallelepipeds, and…
In this paper, we construct the supersymmetric spinning polynomials. These are orthogonal polynomials that serve as an expansion basis for the residue or discontinuity of four-point scattering amplitudes, respecting four-dimensional super…
It is shown that the projection image of an oriented spatial arc to any oriented plane is approximated by a unique arc diagram (up to isomorphic arc diagrams) determined from the spatial arc and the projection. In a separated paper, the…
We introduce the notion of a one-way horseshoe and show that the polynomial entropy of an interval map is given by one-way horseshoes of iterates of the map, obtaining in such a way an analogue of Misiurewicz's theorem on topological…
We show, for several fake projective planes with nontrivial automorphism group, that the bicanonical map is an embedding.
We study the dynamics of compositions of a sequence of holomorphic mappings in projective space. We define ergodicity and mixing for non-autonomous dynamical systems, and we construct totally invariant measures for which our sequence…
The simplest version of the Spin-polynomial invariants of the underlying differentiable structures of algebraic surfaces were considered and the simplest arguments were used in order to distinguish the underlying smooth structures of…
This work is devoted to the investigation of the problem about inverse mapping systems expansions of ultrauniform spaces $X$ using polyhedra over non-Archimedean locally compact fields $\bf L$. Theorems about expansions of complete…
Given a uniformly expanding transitive Markov interval map, we show that within the set of ergodic measures the set of nonadapted ergodic measures is residual in with respect to the topology induced by the $\overline{d}$-metric. This set of…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
Let $X$ be a smooth projective variety. Define a stable map $f:C\to X$ to be "eventually smoothable" if there is an embedding $X\hookrightarrow\mathbb{P}^N$ such that $(C,f)$ occurs as the limit of a $1$-parameter family of stable maps to…
Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…
The asymptotic expansion method is generalized from the periodic setting to stationary ergodic stochastic geometries. This will demonstrate that results from periodic asymptotic expansion also apply to non-periodic structures of a certain…