scholarly journals On Cartesian Products which Determine Few Distinct Distances

10.37236/7736 ◽  
2019 ◽  
Vol 26 (1) ◽  
Author(s):  
Cosmin Pohoata
Keyword(s):  
Lower Bound ◽  
Cartesian Products ◽  
Point Set ◽  
Set Of Points

Every set of points $\mathcal{P}$ determines $\Omega(|\mathcal{P}| / \log |\mathcal{P}|)$ distances. A close version of this was initially conjectured by Erdős in 1946 and rather recently proved by Guth and Katz. We show that when near this lower bound, a point set $\mathcal{P}$ of the form $A \times A$ must satisfy $|A - A| \ll |A|^{2-\frac{2}{7}} \log^{\frac{1}{7}} |A|$. This improves recent results of Hanson and Roche-Newton. 

FITTING FLATS TO POINTS WITH OUTLIERS

2011 ◽  
Vol 21 (05) ◽  
pp. 559-569
Author(s):  
GUILHERME D. DA FONSECA
Keyword(s):  
Lower Bound ◽  
Computer Science ◽  
Upper Bound ◽  
Arbitrary Constant ◽  
Fundamental Problem ◽  
Constant Factor ◽  
Infinite Cylinder ◽  
Running Time ◽  
Point Set ◽  
Set Of Points

Determining the best shape to fit a set of points is a fundamental problem in many areas of computer science. We present an algorithm to approximate the k-flat that best fits a set of n points with n - m outliers. This problem generalizes the smallest m-enclosing ball, infinite cylinder, and slab. Our algorithm gives an arbitrary constant factor approximation in O(nk+2/m) time, regardless of the dimension of the point set. While our upper bound nearly matches the lower bound, the algorithm may not be feasible for large values of k. Fortunately, for some practical sets of inliers, we reduce the running time to O(nk+2/mk+1), which is linear when m = Ω(n).

scholarly journals Finding Points in General Position

2017 ◽  
Vol 27 (04) ◽  
pp. 277-296 ◽  
Author(s):  
Vincent Froese ◽  
Iyad Kanj ◽  
André Nichterlein ◽  
Rolf Niedermeier
Keyword(s):  
Lower Bound ◽  
General Position ◽  
Subset Selection ◽  
Selection Problem ◽  
Fixed Parameter Tractability ◽  
Maximum Cardinality ◽  
Exponential Time ◽  
Running Time ◽  
Fixed Parameter ◽  
Set Of Points

We study the General Position Subset Selection problem: Given a set of points in the plane, find a maximum-cardinality subset of points in general position. We prove that General Position Subset Selection is NP-hard, APX-hard, and present several fixed-parameter tractability results for the problem as well as a subexponential running time lower bound based on the Exponential Time Hypothesis.

BASELINE BOUNDED HALF-PLANE VORONOI DIAGRAM

2013 ◽  
Vol 05 (03) ◽  
pp. 1350021 ◽  
Author(s):  
BING SU ◽  
YINFENG XU ◽  
BINHAI ZHU
Keyword(s):  
Voronoi Diagram ◽  
Half Plane ◽  
Line Segment ◽  
Euclidean Plane ◽  
Voronoi Region ◽  
Point Set ◽  
Set Of Points

Given a set of points P = {p1, p2, …, pn} in the Euclidean plane, with each point piassociated with a given direction vi∈ V. P(pi, vi) defines a half-plane and L(pi, vi) denotes the baseline that is perpendicular to viand passing through pi. Define a region dominated by piand vias a Baseline Bounded Half-Plane Voronoi Region, denoted as V or(pi, vi), if a point x ∈ V or(pi, vi), then (1) x ∈ P(pi, vi); (2) the line segment l(x, pi) does not cross any baseline; (3) if there is a point pj, such that x ∈ P(pj, vj), and the line segment l(x, pj) does not cross any baseline then d(x, pi) ≤ d(x, pj), j ≠ i. The Baseline Bounded Half-Plane Voronoi Diagram, denoted as V or(P, V), is the union of all V or(pi, vi). We show that V or(pi, vi) and V or(P, V) can be computed in O(n log n) and O(n2log n) time, respectively. For the heterogeneous point set, the same problem is also considered.

scholarly journals On the Baire Generic Validity of the t-Multifractal Formalism in Besov and Sobolev Spaces

2019 ◽  
Vol 2019 ◽  
pp. 1-14
Author(s):  
Moez Ben Abid ◽  
Mourad Ben Slimane ◽  
Ines Ben Omrane ◽  
Borhen Halouani
Keyword(s):  
Lower Bound ◽  
Hausdorff Dimension ◽  
Besov Space ◽  
Sobolev Spaces ◽  
Wavelet Coefficients ◽  
Multifractal Formalism ◽  
Spectrum Of A Function ◽  
Set Of Points

The t-multifractal formalism is a formula introduced by Jaffard and Mélot in order to deduce the t-spectrum of a function f from the knowledge of the (p,t)-oscillation exponent of f. The t-spectrum is the Hausdorff dimension of the set of points where f has a given value of pointwise Lt regularity. The (p,t)-oscillation exponent is measured by determining to which oscillation spaces Op,ts (defined in terms of wavelet coefficients) f belongs. In this paper, we first prove embeddings between oscillation and Besov-Sobolev spaces. We deduce a general lower bound for the (p,t)-oscillation exponent. We then show that this lower bound is actually equality generically, in the sense of Baire’s categories, in a given Sobolev or Besov space. We finally investigate the Baire generic validity of the t-multifractal formalism.

scholarly journals ADDITIVITY PROPERTIES OF SOFIC ENTROPY AND MEASURES ON MODEL SPACES

2016 ◽  
Vol 4 ◽  
Author(s):  
TIM AUSTIN
Keyword(s):  
Lower Bound ◽  
Probability Distributions ◽  
Cartesian Product ◽  
Sufficient Conditions ◽  
Entropy Theory ◽  
Reverse Inequality ◽  
Cartesian Products ◽  
Model Spaces ◽  
Sofic Entropy ◽  
Sofic Groups

Sofic entropy is an invariant for probability-preserving actions of sofic groups. It was introduced a few years ago by Lewis Bowen, and shown to extend the classical Kolmogorov–Sinai entropy from the setting of amenable groups. Some parts of Kolmogorov–Sinai entropy theory generalize to sofic entropy, but in other respects this new invariant behaves less regularly. This paper explores conditions under which sofic entropy is additive for Cartesian products of systems. It is always subadditive, but the reverse inequality can fail. We define a new entropy notion in terms of probability distributions on the spaces of good models of an action. Using this, we prove a general lower bound for the sofic entropy of a Cartesian product in terms of separate quantities for the two factor systems involved. We also prove that this lower bound is optimal in a certain sense, and use it to derive some sufficient conditions for the strict additivity of sofic entropy itself. Various other properties of this new entropy notion are also developed.

PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS

2002 ◽  
Vol 12 (05) ◽  
pp. 429-443 ◽  
Author(s):  
NAOKI KATOH ◽  
HISAO TAMAKI ◽  
TAKESHI TOKUYAMA
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Transportation Problem ◽  
Minimum Weight ◽  
Planar Point ◽  
Line Arrangement ◽  
Optimal Bound ◽  
Straight Line ◽  
Point Set ◽  
Multiple Levels

We give an optimal bound on the number of transitions of the minimum weight base of an integer valued parametric polymatroid. This generalizes and unifies Tamal Dey's O(k1/3 n) upper bound on the number of k-sets (and the complexity of the k-level of a straight-line arrangement), David Eppstein's lower bound on the number of transitions of the minimum weight base of a parametric matroid, and also the Θ(kn) bound on the complexity of the at-most-k level (the union of i-levels for i = 1,2,…,k) of a straight-line arrangement. As applications, we improve Welzl's upper bound on the sum of the complexities of multiple levels, and apply this bound to the number of different equal-sized-bucketings of a planar point set with parallel partition lines. We also consider an application to a special parametric transportation problem.

scholarly journals THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE GRAPHS

2013 ◽  
Vol 23 (04n05) ◽  
pp. 357-395 ◽  
Author(s):  
THERESE BIEDL ◽  
MARTIN VATSHELLE
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Line Drawing ◽  
Np Hard ◽  
Bounded Treewidth ◽  
Straight Line ◽  
Triangulated Graphs ◽  
Point Set ◽  
Fixed Embedding ◽  
Set Of Points

In this paper, we study the point-set embeddability problem, i.e., given a planar graph and a set of points, is there a mapping of the vertices to the points such that the resulting straight-line drawing is planar? It was known that this problem is NP-hard if the embedding can be chosen, but becomes polynomial for triangulated graphs of treewidth 3. We show here that in fact it can be answered for all planar graphs with a fixed combinatorial embedding that have constant treewidth and constant face-degree. We prove that as soon as one of the conditions is dropped (i.e., either the treewidth is unbounded or some faces have large degrees), point-set embeddability with a fixed embedding becomes NP-hard. The NP-hardness holds even for a 3-connected planar graph with constant treewidth, triangulated planar graphs, or 2-connected outer-planar graphs. These results also show that the convex point-set embeddability problem (where faces must be convex) is NP-hard, but we prove that it becomes polynomial if the graph has bounded treewidth and bounded maximum degree.

Saturated systems of symmetric convex domains; results of Eggleston, Bambah and Woods

1973 ◽  
Vol 74 (1) ◽  
pp. 107-116 ◽  
Author(s):  
Vishwa Chander Dumir ◽  
Dharam Singh Khassa
Keyword(s):  
Lower Bound ◽  
Lebesgue Measure ◽  
Convex Domain ◽  
Gauge Function ◽  
Symmetric Convex ◽  
Convex Domains ◽  
Strictly Convex ◽  
Point Set ◽  
Image Position

Let K be a closed, bounded, symmetric convex domain with centre at the origin O and gauge function F(x). By a homothetic translate of K with centre a and radius r we mean the set {x: F(x−a) ≤ r}. A family ℳ of homothetic translates of K is called a saturated family or a saturated system if (i) the infimum r of the radii of sets in ℳ is positive and (ii) every homothetic translate of K of radius r intersects some member of ℳ. For a saturated family ℳ of homothetic translates of K, let S denote the point-set union of the interiors of members of ℳ and S(l), the set S ∪ {x: F(x) ≤ l}. The lower density ρℳ(K) of the saturated system ℳ is defined bywhere V(S(l)) denotes the Lebesgue measure of the set S(l). The problem is to find the greatest lower bound ρK of ρℳ(K) over all saturated systems ℳ of homothetic translates of K. In case K is a circle, Fejes Tóth(9) conjectured thatwhere ϑ(K) denotes the density of the thinnest coverings of the plane by translates of K. In part I, we state results already known in this direction. In part II, we prove that ρK = (¼) ϑ(K) when K is strictly convex and in part III, we prove that ρK = (¼) ϑ(K) for all symmetric convex domains.

PERFECT MATCHINGS AND GENUS OF SOME CARTESIAN PRODUCTS OF GRAPHS

2012 ◽  
Vol 04 (02) ◽  
pp. 1250026
Author(s):  
FENGGEN LIN ◽  
LIANZHU ZHANG ◽  
FULIANG LU
Keyword(s):  
Lower Bound ◽  
Perfect Matchings ◽  
Cartesian Products ◽  
Elementary Graph ◽  
Cartesian Products Of Graphs

Lovász and Plummer conjectured that: for k ≥ 3 there exist constants c1(k) > 1 and c2(k) > 0 such that every k-regular elementary graph on 2n vertices, without forbidden edges, contains at least c2(k)⋅c1(k)nperfect matchings. Furthermore c1(k) → ∞ as k → ∞. In this paper, for some Cartesian products of graphs, we obtain a lower bound of their number of perfect matchings which is similar to that of Lovász and Plummer's conjecture. Furthermore, we compute the genus of some Cartesian products of graphs.

scholarly journals Packing Plane Perfect Matchings into a Point Set

2015 ◽  
Vol Vol. 17 no.2 (Graph Theory) ◽  
Author(s):  
Ahmad Biniaz ◽  
Prosenjit Bose ◽  
Anil Maheshwari ◽  
Michiel Smid
Keyword(s):  
Lower Bound ◽  
General Position ◽  
Perfect Matchings ◽  
Point Sets ◽  
Exact Answer ◽  
International Audience ◽  
Point Set

International audience Given a set $P$ of $n$ points in the plane, where $n$ is even, we consider the following question: How many plane perfect matchings can be packed into $P$? For points in general position we prove the lower bound of &#x230A;log<sub>2</sub>$n$&#x230B;$-1$. For some special configurations of point sets, we give the exact answer. We also consider some restricted variants of this problem.

Sign in / Sign up

Export Citation Format

Share Document