Related papers: A Combinatorial Bound for Beacon-based Routing in …
We characterize all bounded orbits of two similar Collatz-type quadratic mappings of the set of non-negative integers. In one case, where cycles of all possible lengths may occur, an orbit is bounded if and only if it reaches a cycle. For…
There has been significant recent interest in graph-based nearest neighbor search methods, many of which are centered on the construction of navigable graphs over high-dimensional point sets. A graph is navigable if we can successfully move…
In this work, we initiate the research about the Gathering problem for robots with limited viewing range in the three-dimensional Euclidean space. In the Gathering problem, a set of initially scattered robots is required to gather at the…
We derive the asymptotic behavior of hitting probability at small target of size $O(\epsilon)$ for reflected Brownian motion in domains with suitable smooth boundary conditions, where the boundary of domain contains both reflecting part,…
Suppose that a polygon $P$ is given as an array containing the vertices in counterclockwise order. We analyze how many vertices (including the index of each of these vertices) we need to know before we can bound $P$, i.e., report a bounded…
We study the growing patterns in the rotor-router model formed by adding $N$ walkers at the center of a $L \times L$ two-dimensional square lattice, starting with a periodic background of arrows, and relaxing to a stable configuration. The…
This paper presents a new chaotic system having four attractors, including two fixed point attractors and two symmetrical chaotic strange attractors. Dynamical properties of the system, viz. sensitive dependence on initial conditions,…
We consider machine learning in a comparison-based setting where we are given a set of points in a metric space, but we have no access to the actual distances between the points. Instead, we can only ask an oracle whether the distance…
We give both efficient algorithms and hardness results for reconfiguring between two connected configurations of modules in the hexagonal grid. The reconfiguration moves that we consider are "pivots", where a hexagonal module rotates around…
This paper deals with the attractors of generic dynamical systems. We introduce the notion of epsilon-invisible set, which is an open set in which almost all orbits spend on average a fraction of time no greater than epsilon. For…
It is proved that one can choose a control function on an arbitrary small open subset of the boundary of an obstacle so that the total radiation from this obstacle for a fixed direction of the incident plane wave and for a fixed wave number…
Consider a d-dimensional Brownian motion in a random potential defined by attaching a nonnegative and polynomially decaying potential around Poisson points. We introduce a repulsive interaction between the Brownian path and the Poisson…
A cyclic random motion at finite velocity with orthogonal directions is considered in the plane and in $\mathbb{R}^3$. We obtain in both cases the explicit conditional distributions of the position of the moving particle when the number of…
The Orthogonal Watchman Route Problem (OWRP) entails the search for the shortest path, known as the watchman route, that a robot must follow within a polygonal environment. The primary objective is to ensure that every point in the…
Guarding a polygon with few guards is an old and well-studied problem in computational geometry. Here we consider the following variant: We assume that the polygon is orthogonal and thin in some sense, and we consider a point $p$ to guard a…
In this paper we introduce self-approaching graph drawings. A straight-line drawing of a graph is self-approaching if, for any origin vertex s and any destination vertex t, there is an st-path in the graph such that, for any point q on the…
This paper proposes a novel approach that enables a robot to learn an objective function incrementally from human directional corrections. Existing methods learn from human magnitude corrections; since a human needs to carefully choose the…
For d>=3, we construct a non-randomized, fair and translation-equivariant allocation of Lebesgue measure to the points of a standard Poisson point process in R^d, defined by allocating to each of the Poisson points its basin of attraction…
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the --exact…
Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. The topologies of random Boolean networks with one input per…