Related papers: On the characteristic of integral point sets in $\…
A point set $M$ in Euclidean plane is called an integral point set in semi-general position if all the distances between the elements of $M$ are integers, and $M$ does not contain collinear triples. We improve the lower bound for diameter…
Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
In this article, we introduce a new type of mapping contracting perimeters of triangles in a complete metric space and present related fixed point theorem. We study the metric completeness property of the underlying space in terms of fixed…
There are many papers studying properties of point sets in the Euclidean space $\mathbb{E}^m$ or on integer grids $\mathbb{Z}^m$, with pairwise integral or rational distances. In this article we consider the distances or coordinates of the…
The higher characteristics w_m(G) for a finite abstract simplicial complex G are topological invariants that satisfy k-point Green function identities and can be computed in terms of Euler characteristic in the case of closed manifolds,…
For general thinning procedures, its inverse operation, the condensing, is studied and a link to integration-by-parts formulas is established. This extends the recent results on that link for independent thinnings of point processes to…
A point set $M$ in the Euclidean plane is called a planar integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on a straight line. A planar integral point set is called to be in…
Since ancient times mathematicians consider geometrical objects with integral side lengths. We consider plane integral point sets $\mathcal{P}$, which are sets of $n$ points in the plane with pairwise integral distances where not all the…
In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.
It has been shown that the edge structure of the characteristic imset polytope is closely connected to the question of causal discovery. The diameter of a polytope is an indicator of how connected the polytope is and moreover gives us a…
Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…
We study the possibility of a continuous extension of a class of mappings to an isolated point on the boundary of a domain. We show that if some characteristic of this mapping is integrable on almost all spheres in the neighborhood of at…
A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…
We introduce several classes of set-valued maps with generalized convexity. We obtain minimax theorems for set-valued maps which satisfy the introduced properties and are not continuous, by using a fixed point theorem for weakly naturally…
Points of interest on a map such as restaurants, hotels, or subway stations, give rise to categorical point data: data that have a fixed location and one or more categorical attributes. Consequently, recent years have seen various set…
Efficient characteristic set methods for computing solutions of polynomial equation systems in a finite field are proposed. The concept of proper triangular sets is introduced and an explicit formula for the number of solutions of a proper…
One of the most famous results in Complex Analysis is the Little Picard Theorem, that characterizes the image set of an arbitrary entire function. Specifically, the theorem states that this image set is either the whole complex plane or the…