Related papers: A Note on Euclidean Order Types

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…

We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…

Order-enriched solid functors, as presented in this paper in two versions, enjoy many of the strong properties of their ordinary counterparts, including the transfer of the existence of weighted (co)limits from their codomains to their…

We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…

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…

In the paper, properties of orbit functions are reviewed and further developed. Orbit functions on the Euclidean space $E_n$ are symmetrized exponential functions. The symmetrization is fulfilled by a Weyl group corresponding to a…

A Euclidean $t$-design, as introduced by Neumaier and Seidel (1988), is a finite set ${\cal X} \subset \mathbb{R}^n$ with a weight function $w: {\cal X} \rightarrow \mathbb{R}^+$ for which $$\sum_{r \in R} W_r \overline{f}_{S_{r}} =…

Motivated by an application of semigroup variants to the discrete log problem in groups and related cryptographic applications, we introduce a new kind of totient function, related to both Euler's function and a generalisation of Euler's…

It is shown by the author in 2017 that for the union of N orthants in the n-dimensional space there exists an efficient and systematic way to find the exact value, using a suitable partial order relation construction. In this paper our…

Motivated by classical results of Aubry, Davenport and Cassels, we define the notion of a Euclidean quadratic form over a normed integral domain and an ADC form over an integral domain. The aforementioned classical results generalize to:…

We consider the further development of the formalism of the estimates of higher-order perturbative corrections in the Euclidean region, which is based on the application of the scheme-invariant methods, namely the principle of minimal…

E158 in the Enestrom index. Translation of the Latin original "Observationes analyticae variae de combinationibus" (1741). This paper introduces the problem of partitions, or partitio numerorum (the partition of integers). In the first part…

The usual division algorithms on $\mathbb{Z}$ and $\mathbb{Z}[i]$ measure the size of remainders using the norm function. These rings are Euclidean with respect to several functions. The pointwise minimum of all Euclidean functions $f: R…

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

In this article, we consider a class of functions on $\mathbb{R}^d$, called positive homogeneous functions, which interact well with certain continuous one-parameter groups of (generally anisotropic) dilations. Generalizing the Euclidean…

The Euclidean division of two formal series in one variable produces a sequence of series that we obtain explicitly, remarking that the case where one of the two initial series is 1 is sufficiently generic. As an application, we define a…

In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…

We develop algorithms to turn quotients of rings of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and…

The notion of the magnitude of a metric space was introduced by Leinster in [8] and developed in [10], [9], [11] and [16], but the magnitudes of familiar sets in Euclidean space are only understood in relatively few cases. In this paper we…

There are (at least) two different approaches to define equivariant analogue of the Euler charateristic for a space with a finite group action. The first one defines it as an element of the Burnside ring of the group. The second approach…