A set 
in 
is called 
-convex if, for any two distinct points in , there exists a third point in , such that one of the three points is equidistant from the others. In this paper we first investigate nondiscrete -convex sets, then discuss about the -convexity of the eleven Archimedean tilings, and treat subsequently finite subsets of the square lattice. Finally, we obtain a lower bound on the number of isosceles triples contained in an 
-point -convex set.
Isosceles triple convexity
Yuang, Liping, Zamfirescu, Tudor and Zhang, Yue
Abstract
carpathian_33_1_127_139_abstractFull PDF
carpathian_2017_33_1_127_139Additional Information
| Author(s) | Yuan, Liping, Zamfirescu, Tudor, Zhang, Yue |
|---|---|
| DOI | https://doi.org/10.37193/CJM.2017.01.13 |
Recently posted
-
An inertial method for solving the split equality fixed point problem with multiple output sets
-
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
-
Properties of isocompact spaces in topological groups
-
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
-
Global-fixed-point property of gyrogroup actions
-
On simple normal structure and best proximity points in reflexive Banach space
-
Unified Convergence Analysis of Certain At Least Fifth Order Methods
-
A set packing model for the Partition Coloring Problem
-
Cut-through connections of graphs
-
Positive solutions for multipoint boundary value problem of fractional differential equation with parameter