Related papers: Maximal Circular Point Sets over Arbitrary Fields …
Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
For a continuous map on a topological graph containing a unique loop S, it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…
The aim of this work is to study duality of fractional ideals with respect to a fixed ideal and to investigate the relationship between value sets of pairs of dual ideals in admissible rings, a class of rings that contains the local rings…
We propose a unifying setting for dealing with monodromically atypical intersections that goes beyond the usual Zilber-Pink conjecture. In particular we obtain a new proof of finiteness of the maximal atypical orbit closures in each stratum…
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…
In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…
In this paper, we highlight that the point group structure of elliptic curves over finite or infinite fields, may be also observed on singular cubics with a quadratic component. Starting from this, we are able to introduce in a very general…
We are concerned with describing the structure of the set of points in the unit interval which, when subjected to rotation by irrational alpha modulo one, for all finite portions of the orbit contain at least as many points in the bottom…
Maximal Orders over an algebra are a generalization of the concept of a Dedekind domain. The definition given in Maximal Orders by Reiner, assumes that the field over which the algebra is defined is in the center of the order. Since we want…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
Integer geometry on a plane deals with objects whose vertices are points in $\mathbb Z^2$. The congruence relation is provided by all affine transformations preserving the lattice $\mathbb Z^2$. In this paper we study circumscribed circles…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
Given a rational function of degree at least two defined over a number field k, we study the cardinality of the set of rational iterated preimages. We prove bounds for the cardinality of this set as the rational function varies in certain…
In this paper, we study multi-rotation orbits on the unit circle. We obtain a natural generalization of a classical result which says that orbits of irrational rotations on the unit circle are dense. It is possible to show that this result…
Let $k$ be an arbitrary field. We classify the maximal reductive subgroups of maximal rank in any classical simple algebraic $k$-group in terms of combinatorial data associated to their indices. This result complements [S, 2022], which does…
The kernel of analysis, to me anyway, is the following idea: A point is arbitrarily close to a set if every neighborhood of the point intersects the set. Defining ``arbitrarily close'' in this way provides a foundation for classical results…
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…
Rosenthal et al. introduced and thoroughly studied the notion of Maximum Distance Profile (MDP) convolutional codes over (non-binary) finite fields refining the classical notion of optimum distance profile, see for instance [18, p.164].…