相关论文: Dense forests and Danzer sets

Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…

A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…

We study self-organization in a minimally nonlinear model of large random ecosystems. Populations evolve over time according to a piecewise linear system of ordinary differential equations subject to a non-negativity constraint resulting in…

In the present paper, taking a dynamical point on view, we study the growth rate and asymptotic behavior of the sequences of the Reidemeister numbers and the sequences of the Reidemeister and the Nielsen coincidence numbers. We also prove…

In this article, we study two problems concerning the size of the set of finite point configurations generated by a compact set $E\subset \mathbb{R}^d$. The first problem concerns how the Lebesgue measure or the Hausdorff dimension of the…

Recent researches have shown that deep forest ensemble achieves a considerable increase in classification accuracy compared with the general ensemble learning methods, especially when the training set is small. In this paper, we take…

We consider effective versions of two classical theorems, the Lebesgue density theorem and the Denjoy-Young-Saks theorem. For the first, we show that a Martin-Loef random real $z\in [0,1]$ is Turing incomplete if and only if every…

This paper studies visibility problems in Euclidean spaces $\mathbb{R}^d$ where the obstacles are the points of infinite discrete sets $Y\subseteq\mathbb{R}^d$. A point $x\in\mathbb{R}^d$ is called $\varepsilon$-visible for $Y$ (notation:…

We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…

Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…

In one-dimensional Diophantine approximation, the Diophantine properties of a real number are characterized by its partial quotients, especially the growth of its large partial quotients. Notably, Kleinbock and Wadleigh [Proc. Amer. Math.…

We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…

This paper introduces nondeterministic walks, a new variant of one-dimensional discrete walks. The main difference to classical walks is that its nondeterministic steps consist of sets of steps from a predefined set such that all possible…

In this paper we give a full classification of global solutions of the obstacle problem for the fractional Laplacian (including the thin obstacle problem) with compact coincidence set and at most polynomial growth in dimension $N \geq 3$.…

This paper uses a connection between bounded remainder sets in $\mathbb{R}^d$ and cut-and-project sets in $\mathbb{R}$ together with the fact that each one-dimensional Pisot substitution sequence is bounded distance equivalent to some…

Regardless of a system's complexity or scale, its growth can be considered to be a spontaneous thermodynamic response to a local convergence of down-gradient material flows. Here it is shown how growth can be constrained to a few distinct…

We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of…

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

This paper is concerned with Darcy's law for an incompressible viscous fluid flowing in a porous medium. We establish the sharp $O(\sqrt{\e})$ convergence rate in a periodically perforated and bounded domain in $R^d$ for $d\ge 2$, where…

We study two fundamental decremental dynamic graph problems. In both problems, we need to maintain a vertex-weighted forest of size $n$ under edge deletions, weight updates, and a certain information-retrieval query. Both problems can be…