scholarly journals Eckhoff's Problem on Convex Sets in the Plane

10.37236/9978 ◽  
2021 ◽  
Vol 28 (3) ◽  
Author(s):  
Adam S. Jobson ◽  
André E. Kézdy ◽  
Jenő Lehel
Keyword(s):  
Convex Sets ◽  
Common Point ◽  
Finite Family ◽  
Helly’S Theorem ◽  
Uniform Hypergraphs ◽  
Special Cases

Eckhoff proposed a combinatorial version of the classical Hadwiger–Debrunner $(p,q)$-problems as follows. Let ${\cal F}$ be a finite family of convex sets in the plane and  let $m\geqslant 1$ be an integer. If among every ${m+2\choose 2}$ members of ${\cal F}$ all but at most $m-1$ members have a common point, then there is a common point for all but at most $m-1$ members of ${\cal F}$. The claim is an extension of Helly's theorem ($m=1$). The case $m=2$ was verified by Nadler and by Perles. Here we show that Eckhoff 's conjecture follows from an old conjecture due to Szemerédi and Petruska concerning $3$-uniform hypergraphs. This conjecture is still open in general; its  solution for a few special cases answers Eckhoff's problem for $m=3,4$. A new proof for the case $m=2$ is also presented.

A Krasnosel’skii-type theorem for certain orthogonal polytopes starshaped via k-staircase paths

2020 ◽  
Vol 20 (2) ◽  
pp. 169-177 ◽  
Author(s):  
Marilyn Breen
Keyword(s):  
Type Theorem ◽  
Common Point ◽  
Finite Family ◽  
Intersection Graph ◽  
Axis Parallel ◽  
Orthogonal Polytopes

AbstractLet 𝒞 be a finite family of distinct axis-parallel boxes in ℝd whose intersection graph is a tree, and let S = ⋃{C : C in 𝒞}. If every two points of S see a common point of S via k-staircase paths, then S is starshaped via k-staircase paths. Moreover, the k-staircase kernel of S will be convex via k-staircases.

scholarly journals On Reay's Relaxed Tverberg Conjecture and Generalizations of Conway's Thrackle Conjecture

10.37236/6516 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Megumi Asada ◽  
Ryan Chen ◽  
Florian Frick ◽  
Frederick Huang ◽  
Maxwell Polevy ◽  
...  
Keyword(s):  
Geometric Property ◽  
Convex Sets ◽  
Convex Hulls ◽  
Open Problems ◽  
Higher Dimensional ◽  
Special Cases ◽  
Minimum Number ◽  
Point Set ◽  
Colored Version ◽  
Special Case

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean $d$-space that guarantees any such point set admits a partition into $r$ parts, any $k$ of whose convex hulls intersect. Here we give new and improved lower bounds for this number, which Reay conjectured to be independent of $k$. We prove a colored version of Reay's conjecture for $k$ sufficiently large, but nevertheless $k$ independent of dimension $d$. Pairwise intersecting convex hulls have severely restricted combinatorics. This is a higher-dimensional analogue of Conway's thrackle conjecture or its linear special case. We thus study convex-geometric and higher-dimensional analogues of the thrackle conjecture alongside Reay's problem and conjecture (and prove in two special cases) that the number of convex sets in the plane is bounded by the total number of vertices they involve whenever there exists a transversal set for their pairwise intersections. We thus isolate a geometric property that leads to bounds as in the thrackle conjecture. We also establish tight bounds for the number of facets of higher-dimensional analogues of linear thrackles and conjecture their continuous generalizations.

scholarly journals On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane

10.37236/1805 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Seog-Jin Kim ◽  
Alexandr Kostochka ◽  
Kittikorn Nakprasit
Keyword(s):  
Chromatic Number ◽  
Convex Sets ◽  
Convex Set ◽  
Clique Number ◽  
Finite Family ◽  
Intersection Graph ◽  
Intersection Graphs ◽  
Homothetic Copies

Let $G$ be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number $k$ is $(3k-3)$-degenerate. This bound is sharp. As a consequence, we derive that $G$ is $(3k-2)$-colorable. We show also that the chromatic number of every intersection graph $H$ of a family of homothetic copies of a fixed convex set in the plane with clique number $k$ is at most $6k-6$.

Counterexamples Concerning Support Theorems for Convex Sets in Hilbert Space

1988 ◽  
Vol 31 (1) ◽  
pp. 121-128 ◽  
Author(s):  
R. R. Phelps
Keyword(s):  
Banach Space ◽  
Hilbert Space ◽  
Convex Function ◽  
Convex Subset ◽  
Convex Sets ◽  
Lower Semicontinuous ◽  
Nonempty Closed Convex Subset ◽  
Common Point ◽  
Support Points ◽  
Support Theorems

AbstractThe Bishop-Phelps theorem guarantees the existence of support points and support functionals for a nonempty closed convex subset of a Banach space; equivalently, it guarantees the existence of subdifferentials and points of subdifferentiability of a proper lower semicontinuous convex function on a Banach space. In this note we show that most of these results cannot be extended to pairs of convex sets or functions, even in Hilbert space. For instance, two proper lower semicontinuous convex functions need not have a common point of subdifferentiability nor need they have a subdifferential in common. Negative answers are also obtained to certain questions concerning density of support points for the closed sum of two convex subsets of Hilbert space.

scholarly journals Helly-Type Theorems in Property Testing

2018 ◽  
Vol 28 (04) ◽  
pp. 365-379
Author(s):  
Sourav Chakraborty ◽  
Rameshwar Pratap ◽  
Sasanka Roy ◽  
Shubhangi Saraf
Keyword(s):  
High Probability ◽  
Convex Sets ◽  
Property Testing ◽  
Geometric Object ◽  
Fundamental Result ◽  
Symmetric Convex ◽  
Helly’S Theorem ◽  
Convex Object ◽  
Constant Size ◽  
Testing Algorithm

Helly’s theorem is a fundamental result in discrete geometry, describing the ways in which convex sets intersect with each other. If [Formula: see text] is a set of [Formula: see text] points in [Formula: see text], we say that [Formula: see text] is [Formula: see text]-clusterable if it can be partitioned into [Formula: see text] clusters (subsets) such that each cluster can be contained in a translated copy of a geometric object [Formula: see text]. In this paper, as an application of Helly’s theorem, by taking a constant size sample from [Formula: see text], we present a testing algorithm for [Formula: see text]-clustering, i.e., to distinguish between the following two cases: when [Formula: see text] is [Formula: see text]-clusterable, and when it is [Formula: see text]-far from being [Formula: see text]-clusterable. A set [Formula: see text] is [Formula: see text]-far [Formula: see text] from being [Formula: see text]-clusterable if at least [Formula: see text] points need to be removed from [Formula: see text] in order to make it [Formula: see text]-clusterable. We solve this problem when [Formula: see text], and [Formula: see text] is a symmetric convex object. For [Formula: see text], we solve a weaker version of this problem. Finally, as an application of our testing result, in the case of clustering with outliers, we show that with high probability one can find the approximate clusters by querying only a constant size sample.

scholarly journals Theoretical framework for higher-order quantum theory

2019 ◽  
Vol 475 (2225) ◽  
pp. 20180706 ◽  
Author(s):  
Alessandro Bisio ◽  
Paolo Perinotti
Keyword(s):  
Quantum Theory ◽  
Convex Sets ◽  
Mathematical Structure ◽  
Higher Order ◽  
Equivalence Relations ◽  
Full Generality ◽  
Special Cases ◽  
Different Types ◽  
Causal Structures

Higher-order quantum theory is an extension of quantum theory where one introduces transformations whose input and output are transformations, thus generalizing the notion of channels and quantum operations. The generalization then goes recursively, with the construction of a full hierarchy of maps of increasingly higher order. The analysis of special cases already showed that higher-order quantum functions exhibit features that cannot be tracked down to the usual circuits, such as indefinite causal structures, providing provable advantages over circuital maps. The present treatment provides a general framework where this kind of analysis can be carried out in full generality. The hierarchy of higher-order quantum maps is introduced axiomatically with a formulation based on the language of types of transformations. Complete positivity of higher-order maps is derived from the general admissibility conditions instead of being postulated as in previous approaches. The recursive characterization of convex sets of maps of a given type is used to prove equivalence relations between different types. The axioms of the framework do not refer to the specific mathematical structure of quantum theory, and can therefore be exported in the context of any operational probabilistic theory.

scholarly journals Half-Space Relaxation Projection Method for Solving Multiple-Set Split Feasibility Problem

2020 ◽  
Vol 25 (3) ◽  
pp. 47
Author(s):  
Guash Haile Taddele ◽  
Poom Kumam ◽  
Anteneh Getachew Gebrie ◽  
Kanokwan Sitthithakerngkiet
Keyword(s):  
Convex Sets ◽  
Split Feasibility Problem ◽  
Finite Family ◽  
Feasibility Problem ◽  
Extended Form ◽  
Numerical Examples ◽  
Cq Algorithm ◽  
The Split Feasibility Problem ◽  
Convergent Algorithm ◽  
Split Feasibility

In this paper, we study an iterative method for solving the multiple-set split feasibility problem: find a point in the intersection of a finite family of closed convex sets in one space such that its image under a linear transformation belongs to the intersection of another finite family of closed convex sets in the image space. In our result, we obtain a strongly convergent algorithm by relaxing the closed convex sets to half-spaces, using the projection onto those half-spaces and by introducing the extended form of selecting step sizes used in a relaxed CQ algorithm for solving the split feasibility problem. We also give several numerical examples for illustrating the efficiency and implementation of our algorithm in comparison with existing algorithms in the literature.

scholarly journals Common Fixed Points of Multistep Noor Iterations with Errors for a Finite Family of Generalized Asymptotically Quasi-Nonexpansive Mappings

2009 ◽  
Vol 2009 ◽  
pp. 1-14 ◽  
Author(s):  
S. Imnang ◽  
S. Suantai
Keyword(s):  
Fixed Points ◽  
Banach Spaces ◽  
Iterative Scheme ◽  
Nonexpansive Mappings ◽  
Common Fixed Points ◽  
Iteration Scheme ◽  
Finite Family ◽  
Special Cases

We introduce a general iteration scheme for a finite family of generalized asymptotically quasi-nonexpansive mappings in Banach spaces. The new iterative scheme includes the multistep Noor iterations with errors, modified Mann and Ishikawa iterations, three-step iterative scheme of Xu and Noor, and Khan and Takahashi scheme as special cases. Our results generalize and improve the recent ones announced by Khan et al. (2008), H. Fukhar-ud-din and S. H. Khan (2007), J. U. Jeong and S. H. Kim (2006), and many others.

scholarly journals ON SOME GENERALIZATION OF SMOOTHING PROBLEMS

2015 ◽  
Vol 20 (3) ◽  
pp. 311-328 ◽  
Author(s):  
Svetlana Asmuss ◽  
Natalja Budkina
Keyword(s):  
Hilbert Spaces ◽  
Convex Sets ◽  
Special Cases

The paper deals with the generalized smoothing problem in abstract Hilbert spaces. This generalized problem involves particular cases such as the interpolating problem, the smoothing problem with weights, the smoothing problem with obstacles, the problem on splines in convex sets and others. The theorem on the existence and characterization of a solution of the generalized problem is proved. It is shown how the theorem gives already known theorems in special cases as well as some new results.

scholarly journals Convergence Theorems for a Common Point of Solutions of Equilibrium and Fixed Point of Relatively Nonexpansive Multivalued Mapping Problems

2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
H. Zegeye ◽  
N. Shahzad
Keyword(s):  
Fixed Point ◽  
Fixed Points ◽  
Equilibrium Problem ◽  
Banach Spaces ◽  
Multivalued Mapping ◽  
Iterative Process ◽  
Common Point ◽  
Finite Family ◽  
Relatively Nonexpansive ◽  
Nonexpansive Multivalued Mapping

We introduce an iterative process which converges strongly to a common point of set of solutions of equilibrium problem and set of fixed points of finite family of relatively nonexpansive multi-valued mappings in Banach spaces.

Sign in / Sign up

Export Citation Format

Share Document