Related papers: Over-rotation intervals of bimodal interval maps
Given a set of endomorphisms on $\mathbb{P}^N$, we establish an upper bound on the number of points of bounded height in the associated monoid orbits. Moreover, we give a more refined estimate with an associated lower bound when the monoid…
Assume that the interval $I=[0,1)$ is partitioned into finitely many intervals $I_1,\dots,I_r$ and consider a map $T\colon I\to I$ so that $T_{\vert I_s}$ is a translation for each $1 \le s \le r$. We do not assume that the images of these…
Twisted homomorphisms of bialgebras are bialgebra homomorphisms from the first into Drinfeld twistings of the second. They possess a composition operation extending composition of bialgebra homomorphisms. Gauge transformations of twists,…
Optimal transport maps define a one-to-one correspondence between probability distributions, and as such have grown popular for machine learning applications. However, these maps are generally defined on empirical observations and cannot be…
Robots deployed in settings such as warehouses and parking lots must cope with frequent and substantial changes when localizing in their environments. While many previous localization and mapping algorithms have explored methods of…
The score of a vertex $x$ in an oriented graph is defined to be its outdegree, \emph{i.e.}, the number of arcs with initial vertex $x$. The score sequence of an oriented graph is the sequence of all scores arranged in nondecreasing order.…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…
We develop a theory of umkehr maps for twisted generalized homology theories. In this theory, interesting umkehr maps, including generalizations of important classical ones, are induced by cartesian morphisms of a certain category opfibred…
We present a computational study of finite-time mixing of a line segment by cutting and shuffling. A family of one-dimensional interval exchange transformations is constructed as a model system in which to study these types of mixing…
The main objective of this paper is to introduce a new method for qualitative analysis of various designs of robot arms. To this end we define the complexity of a map, examine its main properties and develop some methods of computation. In…
Stick graphs are defined as follows. Let A (respectively B) be a set of vertical (respectively horizontal) segments in the plane such that the bottom endpoints of the segments in A and the left endpoints of the segments in B lie on the same…
In this paper we establish a kind of bijection between the orbits of a polygonal outer billiards system and the orbits of a related (and simpler to analyze) system called the pinwheel map. One consequence of the result is that the outer…
A less studied numerical characteristic of periodic orbits of area preserving twist maps of the annulus is the twist or torsion number, called initially the amount of rotation. It measures the average rotation of tangent vectors under the…
We prove a sufficient condition for a \emph{pattern} $\pi$ on a \emph{triod} $T$ to have \emph{rotation number} $\rho_{\pi}$ coincide with an end-point of its \emph{forced rotation interval} $I_{\pi}$. Then, we demonstrate the existence of…
Neural networks have become a prominent approach to solve inverse problems in recent years. Amongst the different existing methods, the Deep Image/Inverse Priors (DIPs) technique is an unsupervised approach that optimizes a highly…
Homomorphically full graphs are those for which every homomorphic image is isomorphic to a subgraph. We extend the definition of homomorphically full to oriented graphs in two different ways. For the first of these, we show that…
We introduce a natural notion of quaternionic map between almost quaternionic manifolds and we prove the following, for maps of rank at least one: 1) A map between quaternionic manifolds endowed with the integrable almost twistorial…
It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…
Plotting solution sets for particular equations may be complicated by the existence of turning points. Here we describe an algorithm which not only overcomes such problematic points, but does so in the most general of settings. Applications…
We introduce partial duality of hypermaps, which include the classical Euler-Poincar\'e duality as a particular case. Combinatorially, hypermaps may be described in one of three ways: as three involutions on the set of flags (bi-rotation…