Related papers: Random covering by rectangles on self-similar carp…
We consider a random self-affine carpet $F$ based on an $n\times m$ subdivision of rectangles and a probability $0<p<1$. Starting by dividing $[0,1]^2$ into an $n\times m$ grid of rectangles and selecting these independently with…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts that increase coverage are accepted. The process continues indefinitely on an infinite substrate, and we analyze the…
We describe the shrinking target set for the Bedford-McMullen carpets, with targets being either cylinders or geometric balls.
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…
The relative configurational entropy per cell as a function of length scale is a sensitive detector of spatial self-similarity. For Sierpinski carpets the equally separated peaks of the above function appear at the length scales that depend…
We study random covers of a closed hyperbolic surface $\Sigma$, subject to the condition that, for $k\geq 2$, the fundamental group is isomorphic to the free group $F_k$. We show that asymptotically they distribute according to a specific…
A rectangle blanket is a set of non-overlapping axis-aligned rectangles, used to approximately represent the two dimensional image of a shape approximately. The use of a rectangle blanket is a widely considered strategy for speeding-up the…
We initiate the study of random iteration of automorphisms of real and complex projective surfaces, or more generally compact K{\"a}hler surfaces, focusing on the fundamental problem of classification of stationary measures. We show that,…
We establish periodic quasiconformal extension theorems for periodic orientation-preserving quasisymmetric self homeomorphisms of quasicircles or quasi-round carpets. As applications, we prove that, if $f$ is a periodic…
We prove upper and lower bounds for the threshold of the q-overlap-k-Exact cover problem. These results are motivated by the one-step replica symmetry breaking approach of Statistical Physics, and the hope of using an approach based on that…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…
The Random Sequential Adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here…
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-dimensional matching problem asks whether there is a disjoint collection of the hyperedges which…
In this article, we discuss the numerical solution of diffusion equations on random surfaces within the isogeometric framework. We describe in detail, how diffusion problems on random surfaces can be modelled and how quantities of interest…
In this paper, we study the problem of reproducing the world lighting from a single image of an object covered with random specular microfacets on the surface. We show that such reflectors can be interpreted as a randomized mapping from the…
The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…
A Gelfand-Tsetlin scheme of depth N is a triangular array with m integers at level m, m=1,...,N, subject to certain interlacing constraints. We study the ensemble of uniformly random Gelfand-Tsetlin schemes with arbitrary fixed N-th row. We…
In this paper, we study a class of set cover problems that satisfy a special property which we call the {\em small neighborhood cover} property. This class encompasses several well-studied problems including vertex cover, interval cover,…
Let $F \subseteq \mathbb{R}^2$ be a Bedford-McMullen carpet defined by multiplicatively independent exponents, and suppose that either $F$ is not a product set, or it is a product set with marginals of dimension strictly between $0$ and…
We analyse the convergence of sampling algorithms for functions in reproducing kernel Hilbert spaces (RKHS). To this end, we discuss approximation properties of kernel regression under minimalistic assumptions on both the kernel and the…