Related papers: Shrinking targets and eventually always hitting po…
In this article, we study the Hausdorff measure of shrinking target sets on self-conformal sets. The Hausdorff dimension of the sets we are interested in here was established by Hill and Velani in 1995. However, until recently, little more…
The Milnor problem on one-dimensional attractors is solved for S-unimodal maps with a non-degenerate critical point c. It provides us with a complete understanding of the possible limit behavior for Lebesgue almost every point. This theorem…
Enumerating the minimal hitting sets of a hypergraph is a problem which arises in many data management applications that include constraint mining, discovering unique column combinations, and enumerating database repairs. Previously, Eiter…
In this work, we reveal a rich combinatorial structure underlying exact minimax optimal algorithms for classical nonexpansive fixed-point problems. This viewpoint unifies all extremal optimal methods and provides a systematic and practical…
This work addresses the finite-time enclosing control problem where a set of followers are deployed to encircle and rotate around multiple moving targets with a predefined spacing pattern in finite time. A novel distributed and continuous…
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non-intersecting. The problem is also known as the Independent…
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…
The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in…
We study a class of semi-discrete variational problems that arise in economic matching and game theory, where agents with continuous attributes are matched to a finite set of outcomes with a one dimensional structure. Such problems appear…
The work [8] established memory loss in the time-dependent (non-random) case of uniformly expanding maps of the interval. Here we find conditions under which we have convergence to the normal distribution of the appropriately scaled…
Let $ T\colon[0,1]^d\to [0,1]^d $ be a piecewise expanding map with an absolutely continuous invariant measure $ \mu $. Let $ \{H_n\} $ be a sequence of hyperrectangles or hyperboloids centered at the origin. Denote by $ \mathcal R(\{H_n\})…
$ $We study the $d$-Uniform Hypergraph Matching ($d$-UHM) problem: given an $n$-vertex hypergraph $G$ where every hyperedge is of size $d$, find a maximum cardinality set of disjoint hyperedges. For $d\geq3$, the problem of finding the…
We study the statistical properties of the entropic optimal (self) transport problem for smooth probability measures. We provide an accurate description of the limit distribution for entropic (self-)potentials and plans as the…
Suppose $k\nmid n$ and $H$ is an $n$-vertex $k$-uniform hypergraph. A near perfect matching in $H$ is a matching of size $\lfloor n/k\rfloor$. We give a divisibility barrier construction that prevents the existence of near perfect matchings…
We show that for any quasimeromorphic mapping with an essential singularity at infinity, there exist points whose iterates tend to infinity arbitrarily slowly. This extends a result by Nicks for quasiregular mappings, and Rippon and…
Under a set of assumptions on a family of submanifolds $\subset {\mathbb R}^D$, we derive a series of geometric properties that remain valid after finite-dimensional and almost isometric Diffusion Maps (DM), including almost uniform…
Given a finite family of squares in the plane, the packing problem asks for the maximum number $\nu$ of pairwise disjoint squares among them, while the hitting problem for the minimum number $\tau$ of points hitting all of them. Clearly,…
Hitting rate and escape rate are two examples of recurrence laws for a dynamical system, and a general limit connects them. We show that for both Gibbs-Markov systems or any systems with the $\phi$-mixing measure, for a sequence of nested…
Eigenmaps are important in analysis, geometry, and machine learning, especially in nonlinear dimension reduction. Approximation of the eigenmaps of a Laplace operator depends crucially on the scaling parameter $\epsilon$. If $\epsilon$ is…
In the stochastic matching problem, we are given a general (not necessarily bipartite) graph $G(V,E)$, where each edge in $E$ is realized with some constant probability $p > 0$ and the goal is to compute a bounded-degree (bounded by a…