搜索结果: 1-11 共查到“几何学 E-sets”相关记录11条 . 查询时间(0.046 秒)
Sets avoiding integral distances
excluded distances Euclidean Ramsey theory integral distances Erdos-type problems
2012/4/18
We study open point sets in Euclidean spaces $\mathbb{R}^d$ without a pair of points an integral distance apart. By a result of Furstenberg, Katznelson, and Weiss such sets must be of Lebesgue upper d...
On Approximating D-induced Polar Sets Of
Robust optimization Polyhedral approximation Second-order cone representable
2011/9/29
This article investigates approximatively describe the set F = {[Ao,...,An ] |An+∑si,Ai ∈ K,∨s ∈ U where K is a geometric cone while $\mathcal{U}$ is an ellipsoid. The idea of approximation of a secon...
An algorithm for computing the centered Hausdorff measure of self-similar sets
centered Hausdorff measure self-similar sets computability of fractal measures
2011/9/15
Abstract: We provide an algorithm for computing the centered Hausdorff measure of self-similar sets satisfying the strong separation condition. We prove the convergence of the algorithm and test its u...
On affine maps on non-compact convex sets and some characterizations of finite-dimensional solid ellipsoids
affine maps non-compact convex sets characterizations of finite-dimensional solid ellipsoids
2011/2/25
In recent studies, properties of the set of affine maps between two convex sets have been
investigated with intensive motivation from quantum physics, but in those preceding works
the underlying con...
Motivated by some questions in Euclidean Ramsey theory, our aim in this note is to show that there exists a cyclic quadrilateral that does not embed into any transitive set (in any dimension). We show...
A finite set X in some Euclidean space Rn is called Ramsey if for any k there is a d such that whenever Rd is k-coloured it contains a monochromatic set congruent to X. This notion was introduced by E...
We investigate subdivisions of simplicial, cyclic, and dihedral sets by using Drinfeld’s expression of geometric realization as a filtered colimit.
Let $E(k, \ell)$ denote the smallest integer such that any set of at least $E(k, \ell)$ points in the plane, no three on a line, contains either an empty convex polygon with $k$ vertices or an empty ...
The covering radius problem for sets of perfect matchings
Perfect matchings Lovasz local lemma
2010/11/30
Consider the family of all perfect matchings of the complete graph K2n with 2n vertices.Given any collection M of perfect matchings of size s, there exists a maximum number f(n; x) such that if s f(...
Boundary Points of Self-Affine Sets in R
Self-affine sets boundary points strict product-form digits
2010/3/1
Let A be an n \times n expanding matrix with integer entries and D = \{0, d1, ... , dN-1 \} \subseteq {\Bbb{Z}}n be a set of N distinct vectors, called an N-digit set. The unique non-empty compact set...
On the Lebesgue Measure of Self-Affine Sets
Multi-attractors self-affine tiles iterated function systems
2010/3/1
Flaherty and Wang studied Haar-type multiwavelets and multi-tiles. The information on what digit sets give multi-attractors with positive Lebesgue measure is very limited. In this note, we give a few ...