AbstractA subset X in k-dimensional Euclidean space Rk that contains n points (elements) is called a P(n)-set if every triplet of points selected from them forms an isosceles triangle. In this paper, we show that the P(8)-set in R3 is uniquely determined to the known example in Kelly’s paper [L.M. Kelly, Elementary problems and solutions. Isosceles n-points, Amer. Math. Monthly 54 (1947) 227–229]
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
We investigate the edge-isoperimetric problem (EIP) for sets of n points in the triangular lattice b...
A set K of type (m,n)2 in the projective space PG(3,q) is a set of points such that every plane cont...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス・フォア・イ...
AbstractA subset X in the k-dimensional Euclidean space Rk that contains n points (elements) is call...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and...
AbstractIt is shown that any set of three lattice points in n-dimensional Euclidean space Rn tiles t...
We show that, for any positive integers n and m, if a set S ⊂ Rm intersects every m − 1 dimensional ...
We give an example of a set P of 3n points in R3 such that, for any partition of P into triples, the...
The multi-solution phenomenon of P3P problem limits its applications in practices. In some specific ...
Abstract. We prove a vertex-isoperimetric inequality for [n] (r) , the set of all r-element subsets ...
AbstractLet d, n be positive integers, and P a set of n points in the d-dimensional Euclidean space....
We prove that the maximum number of k-sets in a set S of n points in IR 3 is O(nk 3=2 ). This im...
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles w...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
We investigate the edge-isoperimetric problem (EIP) for sets of n points in the triangular lattice b...
A set K of type (m,n)2 in the projective space PG(3,q) is a set of points such that every plane cont...
MI: Global COE Program Education-and-Research Hub for Mathematics-for-IndustryグローバルCOEプログラム「マス・フォア・イ...
AbstractA subset X in the k-dimensional Euclidean space Rk that contains n points (elements) is call...
AbstractFor some finite set A of points in Rn and some integer k∈N we consider the problem of recons...
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and...
AbstractIt is shown that any set of three lattice points in n-dimensional Euclidean space Rn tiles t...
We show that, for any positive integers n and m, if a set S ⊂ Rm intersects every m − 1 dimensional ...
We give an example of a set P of 3n points in R3 such that, for any partition of P into triples, the...
The multi-solution phenomenon of P3P problem limits its applications in practices. In some specific ...
Abstract. We prove a vertex-isoperimetric inequality for [n] (r) , the set of all r-element subsets ...
AbstractLet d, n be positive integers, and P a set of n points in the d-dimensional Euclidean space....
We prove that the maximum number of k-sets in a set S of n points in IR 3 is O(nk 3=2 ). This im...
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles w...
We prove a conjecture of Erdős, Purdy, and Straus on the number of distinct areas of triangles dete...
We investigate the edge-isoperimetric problem (EIP) for sets of n points in the triangular lattice b...
A set K of type (m,n)2 in the projective space PG(3,q) is a set of points such that every plane cont...