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
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios