Related papers: Formalizing Factorization on Euclidean Domains and…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…
The decomposition of arbitrary unitary transformations into sequences of simpler, physically realizable operations is a foundational problem in quantum information science, quantum control, and linear optics. We establish a 1D Quantum Field…
Recently there has been a flurry of research on generalized factorization techniques in both integral domains and rings with zero-divisors, namely $\tau$-factorization. There are several ways that authors have studied factorization in rings…
Much work has been done on generalized factorization techniques in integral domains, namely $\tau$-factorization. There has also been substantial progress made in investigating factorization in commutative rings with zero-divisors. This…
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…
Number fields and their rings of integers, which generalize the rational numbers and the integers, are foundational objects in number theory. There are several computer algebra systems and databases concerned with the computational aspects…
In this paper I generalize the notion of a polynomial over an ordered field to that of a naked polynomial over a non-Archimedean ordered field, subsequently showing that the notion of a naked polynomial ring forms an Euclidean domain. This…
Formal Concept Analysis has proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notions of attribute continuous formal context and continuous formal concept are introduced by…
This article focuses on some rings of integers of number fields which are known to be norm-Euclidean domains, but for which no explicit algorithm computing the Euclidean division has yet been studied or implemented. The rings of integers we…
Euclidean distance matrices corresponding to an arithmetic progression have rich spectral and structural properties. We exploit those properties to develop completely positive factorizations of translations of those matrices. We show that…
The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and…
This is mainly a small exposition on extensions of valuation rings as a filtered union of smooth algebras.
A classical tool in the study of real closed fields are the fields $K((G))$ of generalised power series (i.e., formal sums with well-ordered support) with coefficients in a field $K$ of characteristic 0 and exponents in an ordered abelian…
Let $F$ be an affine flat group scheme over a commutative ring $R$, and $S$ an $F$-algebra (an $R$-algebra on which $F$ acts). We define an equivariant analogue $Q_F(S)$ of the total ring of fractions $Q(S)$ of $S$. It is the largest…
Analytic properties of function spaces over the real and the complex fields are different in some ways. This reflects in algebraic properties which are different at times and similar in some other respects. For instance, the ring of…
$\DeclareMathOperator{\Int}{Int}\DeclareMathOperator{\IntR}{Int{}^\text{R}}$For a domain $D$, the ring $\Int(D)$ of integer-valued polynomials over $D$ is atomic if $D$ satisfies the ascending chain condition on principal ideals. However,…
We propose a general quantum Hamiltonian formalism of a renormalization group (RG) flow with an emphasis on generalized symmetry by interpreting the elementary relationship between homomorphism, quotient ring, and projection. In our…
$\DeclareMathOperator{\IntR}{Int{}^\text{R}}$Integer-valued rational functions are a natural generalization of integer-valued polynomials. Given a domain $D$, the collection of all integer-valued rational functions over $D$ forms a ring…
We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of…
It has been a well-known fact since Euclid's time that there exist infinitely many rational primes. Two natural questions arise: In which other rings, sufficiently similar to the integers, are there infinitely many irreducible elements? Is…