Related papers: Euclidean Windows
The purpose of this book is to give an exposition of geometry, from a point of view which complements Klein's Erlangen program. The emphasis is on extending the classical Euclidean geometry to the finite case, but it goes beyond that. After…
We study the classification of minimal codewords of projective Reed-Muller codes of order $2$. This problem is equivalent to identifying quadrics over finite fields whose set of rational points is maximal with respect to the inclusion. We…
Several different versions of the theory of numerosities have been introduced in the literature. Here, we unify these approaches in a consistent frame through the notion of set of labels, relating numerosities with the Kiesler field of…
Self-similar sets with open set condition, the linear objects of fractal geometry, have been considered mainly for crystallographic data. Here we introduce new symmetry classes in the plane, based on rotation by irrational angles. Examples…
We propose and study a generalized continued fraction algorithm that can be executed in an arbitrary imaginary quadratic field, the novelty being a non-restriction to the five Euclidean cases. Many hallmark properties of classical continued…
This article presents simple and easy proofs of the Implicit Function Theorem and the Inverse Function Theorem, in this order, both of them on a finite-dimensional Euclidean space, that employ only the Intermediate Value Theorem and the…
We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…
We study the notion of dp-minimality, beginning by providing several essential facts, establishing several equivalent definitions, and comparing dp-minimality to other minimality notions. The rest of the paper is dedicated to examples. We…
We prove that a real number a greater than or equal to 2 is the irrationality exponent of some computable real number if and only if a is the upper limit of a computable sequence of rational numbers. Thus, there are computable real numbers…
In this paper, we obtain the limit formula of the observable diameter with non-Euclidean screen. In order to treat a sequence of observable diameters with varying screens, we define new types of observable diameters with errors.
We show that the S-Euclidean minimum of an ideal class is a rational number, generalizing a result of Cerri. We also give some corollaries which explain the relationship of our results with Lenstra's notion of a norm-Euclidean ideal class…
We consider the space of real-valued continuously differentiable functions on a compact subset of a euclidean space. We characterize the completeness of this space and prove that the space of restrictions of continuously differentiable…
As in a symmetric space of noncompact type, one can associate to an oriented geodesic segment in a Euclidean building a vector valued length in the Euclidean Weyl chamber; in addition to the metric length it contains information on the…
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
We estimate the number of principal ideals $ I $ of norm $ \mathrm{N}(I) \leq x $ in the family of the simplest cubic fields. The advantage of our result is that it provides the correct order of magnitude for arbitrary $ x \geq 1 $, even…
We prove that the Gauss curvature and the curvature of the normal connection of any minimal surface in the four dimensional Euclidean space satisfy an inequality, which generates two classes of minimal surfaces: minimal surfaces of general…
Combinatorial optimization is a fertile testing ground for statistical physics methods developed in the context of disordered systems, allowing one to confront theoretical mean field predictions with actual properties of finite dimensional…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
Given a set P of points in the plane, an Euclidean t-spanner for P is a geometric graph that preserves the Euclidean distances between every pair of points in P up to a constant factor t. The weight of a geometric graph refers to the total…