Related papers: Random covering by rectangles on self-similar carp…
This paper deals with (globally) random substitutions on a finite set of prototiles. Using renormalization tools applied to objects from operator algebras we establish upper and lower bounds on the rate of deviations of ergodic averages for…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
The classic rank-revealing QR factorization factorizes a matrix $A$ as $AP=QR$ where $P$ permutes the columns of $A$, $Q$ is an orthogonal matrix, and $R$ is upper triangular with non-increasing diagonal entries. This is called…
Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…
We consider transformation-optics based cloaking in acoustic and electromagnetic scattering. The blueprints for an ideal cloak use singular acoustic and electromagnetic materials, posing server difficulties to both theoretical analysis and…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
Among recent developments centered around Randomized Kaczmarz (RK), a row-sampling iterative projection method for large-scale linear systems, several adaptions to the method have inspired faster convergence. Focusing solely on…
We present a new random walk for uniformly sampling high-dimensional convex bodies. It achieves state-of-the-art runtime complexity with stronger guarantees on the output than previously known, namely in R\'enyi divergence (which implies…
The main theme of this paper is a modification of the likelihood ratio test (LRT) for testing high dimensional covariance matrix. Recently, the correct asymptotic distribution of the LRT for a large-dimensional case (the case $p/n$…
We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$…
Let $H$ be a fixed undirected graph on $k$ vertices. The $H$-hitting set problem asks for deleting a minimum number of vertices from a given graph $G$ in such a way that the resulting graph has no copies of $H$ as a subgraph. This problem…
In this article, we study K3 double structures on minimal rational surfaces $Y$. The results show there are infinitely many non-split abstract K3 double structures on $Y = \mathbb{F}_e$ parametrized by $\mathbb P^1$, countably many of which…
In this paper, we address the minimum-area rectangular and square annulus problem, which asks a rectangular or square annulus of minimum area, either in a fixed orientation or over all orientations, that encloses a set $P$ of $n$ input…
We use the techniques developed in [1] to study the local average of random fields with spectral density $1/f^{\alpha}$. We study their scaling properties and show that the self-similarity of $1/f$ random fields is preserved under the local…
For a large class of self-similar random sets F in R^d geometric parameters C_k(F), k=0,...,d, are introduced. They arise as a.s. (average or essential) limits of the volume C_d(F(\epsilon)), the surface area C_{d-1}(F(\epsilon)) and the…
Simultaneous tiling for several different translational sets has been studied rather extensively, particularly in connection with the Steinhaus problem. The study of orthonormal wavelets in recent years, particularly for arbitrary dilation…
We introduce a concept for random tilings which, comprising the conventional one, is also applicable to tiling ensembles without height representation. In particular, we focus on the random tiling entropy as a function of the tile…
In this paper we study the following problem: Given $k$ disjoint sets of points, $P_1, \ldots, P_k$ on the plane, find a minimum cardinality set $\mathcal{T}$ of arbitrary rectangles such that each rectangle contains points of just one set…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
We use geometrical optics and the caustic-touching theorem to study, in an exact way, the change in the topology of the image of an object obtained by reflections on an arbitrary smooth surface. Since the procedure that we use to compute…