Related papers: Generalized Maximal Orders
It is shown why the discriminant of a maximal order within a cyclic division algebra must be minimized in order to get the densest possible matrix lattices with a prescribed nonvanishing minimum determinant. Using results from class field…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
The concept of proximate order is widely used in the theories of entire, meromorphic, subharmonic and plurisubharmonic functions. We give a general interpretation of this concept as a proximate growth function relative to a model growth…
In this paper, we give a refinement of a generalized Dedekind's theorem. In addition, we show that all possible values of integer group determinants of any group are also possible values of integer group determinants of its any abelian…
We establish a dilation-theoretic characterization of the Choquet order on the space of measures on a compact convex set using ideas from the theory of operator algebras. This yields an extension of Cartier's dilation theorem to the…
In this article, we focus on orders in arbitrary number fields, consider their Picard groups and finally obtain ring class fields corresponding to them. The Galois group of the ring class field is isomorphic to the Picard group. As an…
We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…
We study almost Dedekind domains with respect to the failure of ideals to have radical factorization, that is, we study how to measure how far an almost Dedekind domain is from being an SP-domain. To do so, we consider the maximal space…
A crystallographic arrangement is a set of linear hyperplanes satisfying a certain integrality property and decomposing the space into simplicial cones. Crystallographic arrangements were completely classified in a series of papers by…
Let $k$ be a global field, let $A$ be a Dedekind domain with $\text{Quot}(A) = k$, and let $K$ be a finitely generated field. Using a unified approach for both elliptic curves and Drinfeld modules $M$ defined over $K$ and having a trivial…
Let $A$ be a finite-dimensional division algebra containing a base field $k$ in its center $F$. We say that $A$ is defined over a subfield $F_0$ of $F$ if $A = A_0\otimes_{F_0} F$ for some $F_0$-subalgebra $A_0$ of $A$. We show that: (1) In…
We use a reverse Easton forcing iteration to obtain a universe with a definable well-ordering, while preserving the GCH and proper classes of a variety of very large cardinals. This is achieved by coding using the principle diamond star at…
We generalize the Lagrangian-Hamiltonian formalism of Skinner and Rusk to higher order field theories on fiber bundles. As a byproduct we solve the long standing problem of defining, in a coordinate free manner, a Hamiltonian formalism for…
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…
We study the concept of hypervaluations on hyperfields. In particular, we show that any hypervaluation from a hyperfield onto an ordered canonical hypergroup is the composition of a hypervaluation onto an ordered abelian group (which…
This paper develops explicit class field theory for orders: of rank 1 in any global function field -- Hayes theory -- and of rank 2 in real quadratic function fields -- Real Multiplication. The essential ingredient in the development of the…
We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…
We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order…
Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based…
We supply basic tools for the study of the topological order of a multiplet which is an eigenspace of a finite-dimensional normal operator with continuous parameters. We allow intrinsic degeneracies within the multiplet where a well-known…