Downloads & Free Reading Options - Results

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in (P(X)\cup \{\emptyset \},\subset) are characterized as the order types of compact (resp. compact and nowhere dense) sets of reals having the minimum non-isolated.

Let R be the ring of algebraic integers in a number field K and let L be a maximal order in a semisimple K-algebra B. Building on our previous work, we compute the smallest number of algebra generators of L considered as an R-algebra. This reproves and vastly extends the results of P.A.B. Pleasants, who considered the case when B is a number field. In order to achieve our goal, we obtain several results about counting generators of algebras which have finitely many elements. These results should be of independent interest.

Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the maximal chains between two elements. These posets generalize W equipped with its Bruhat order. They include the (W x W)-orbits of the Renner monoids of reductive algebraic monoids and of some infinite dimensional generalizations which are equipped with the partial orders obtained by the closure relations of the Bruhat and Birkhoff cells. They also include the (W x W)-orbits of certain posets obtained by generalizing the closure relation of the Bruhat cells of the wonderful compactification.

We calculate the topological Hochschild homology groups of a maximal order in a central algebra over the rationals. Since the positive-dimensional THH groups consist only of torsion, we do this one prime ideal at a time for all the nonzero prime ideals in the center of the maximal order. This allows us to reduce the problem to studying the THH groups of maximal orders A in simple algebras over Q_p. We show that the topological Hochschild homology of A/(p) splits as the tensor product of its Hochschild homology and the topological Hochschild homology of F_p. We use this result in Brun's spectral sequence to calculate THH(A; A/(p)), and then we analyze the torsion to get the homotopy groups of the completion at p of THH(A).

This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experimental evidence our approach to the automated runtime complexity analysis is not only feasible, but compared to existing methods incredibly fast. As an application in the context of ICC we provide an order-theoretic characterisation of the polytime computable functions. To be precise, the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*.

We construct pairs of compact Riemannian orbifolds which are isospectral for the Laplace operator on functions such that the maximal isotropy order of singular points in one of the orbifolds is higher than in the other. In one type of examples, isospectrality arises from a version of the famous Sunada theorem which also implies isospectrality on $p$-forms; here the orbifolds are quotients of certain compact normal homogeneous spaces. In another type of examples, the orbifolds are quotients of Euclidean $\R^3$ and are shown to be isospectral on functions using dimension formulas for the eigenspaces. In the latter type of examples the orbifolds are not isospectral on 1-forms. Along the way we also give several additional examples of isospectral orbifolds which do not have maximal isotropy groups of different size but other interesting properties.

Crystalline graded rings are generalizations of certain classes of rings like generalized twisted group rings, generalized Weyl algebras, and generalized skew crossed products. When the base ring is a commutative Dedekind domain, two constructions are given for producing maximal graded orders. On the way, a new concept appears, so-called, spectrally twisted group. Some general properties of it are studied. At the end of the paper several examples are considered.

Let G be a finite group that acts on an abelian monoid A. If f: A -> G is a map so that f(a f(a)(b)) = f(a)f(b), for all a, b in A, then the submonoid S = {(a, f(a)) | a in A} of the associated semidirect product of A and G is said to be a monoid of IG-type. If A is a finitely generated free abelian monoid of rank n and G is a subgroup of the symmetric group Sym_n of degree n, then these monoids first appeared in the work of Gateva-Ivanova and Van den Bergh (they are called monoids of I-type) and later in the work of Jespers and Okninski. It turns out that their associated semigroup algebras share many properties with polynomial algebras in finitely many commuting variables. In this paper we first note that finitely generated monoids S of IG-type are epimorphic images of monoids of I-type and their algebras K[S] are Noetherian and satisfy a polynomial identity. In case the group of fractions of S also is torsion-free then it is characterized when K[S] is a maximal order. It turns out that they often are, and hence these algebras again share arithmetical properties with natural classes of commutative algebras. The characterization is in terms of prime ideals of S, in particular G-orbits of minimal prime ideals in A play a crucial role. Hence, we first describe the prime ideals of S. It also is described when the group of fractions is torsion-free.

Using depth of coherent sheaves on noetherian algebraic stacks, we construct non-Azumaya maximal orders in unramified central simple algebras over schemes of dimension at least $3$.

We generalize the existence of maximal orders in a semi-simple algebra for general ground rings. We also improve several statements in Chapter 5 and 6 of Reiner's book concerning separable algebras by removing the separability condition, provided the ground ring is only assumed to be Japanese, a very mild condition. Finally, we show the existence of maximal orders as endomorphism rings of abelian varieties in each isogeny class.

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 to define maximal orders over a Crystalline Graded Ring (defined in Nauwelaerts, E.; Van Oystaeyen, F., Introducing crystalline graded algebras, Algebras and Representation Theory vol 11(2008), no. 2, 133--148.), this concept needs to be generalized. In this paper, we will weaken the condition that the field needs to be in the center, and still retain many of the desired properties of a maximal order.

We present a deterministic and explicit algorithm to compute the endomorphism rings of supersingular elliptic curves. As an example we compute the endomorphism rings of all supersingular elliptic curves defined over characteristic p=29,...,97.

We study moduli spaces of maximal orders in a ramified division algebra over the function field of a smooth projective surface. As in the case of moduli of stable commutative surfaces, we show that there is a Koll\'ar-type condition giving a better moduli problem with the same geometric points: the stack of blt Azumaya algebras. One virtue of this refined moduli problem is that it admits a compactification with a virtual fundamental class.

If H and D are two orders in a central simple algebra A with D of maximal rank and containing H, the theory of representation fields describes the set of spinor genera of orders in the genus of D representing the order H. When H is contained in a maximal subfield of A and the dimension of A is the square of a prime p, the proportion of spinor genera representing H has the form r/p, in fact, when the representation field exists, this proportion is either 1 or 1/p. In the later case the order H is said to be selective for the genus. The condition for selectivity is known when D is maximal and also when p = 2 and D is an Eichler order. In this work we describe the orders H that are selective for at least one genus of orders of maximal rank in A.

We reduce a study of polarized abelian varieties over finite fields to the classification problem of skew-Hermitian modules over (possibly non-maximal) local orders. The main result of this paper gives a complete classification of these skew-Hermitian modules in the case when the ground ring is a dyadic non-maximal local order.

Let O be a maximal order in the quaternion algebra Q_p ramified at p and infinity. Our main result is that, under certain conditions on a rank three sublattice O^T of O, the order O is effectively characterized by the three successive minima and two other short vectors of O^T. The desired conditions turn out to hold whenever the j-invariant j(O) of the elliptic curve associated to the maximal order O lies in F_p. We introduce Algorithm 1, which, given a maximal order O, computes j(O) using the reduction of Hilbert class polynomials to F_p, and we use Theorem 1 to prove that Algorithm 1 terminates within running time O(p^{1+\epsilon}) under the aforementioned conditions. As an application we present Algorithm 2, with running time O(p^{2.5 + \epsilon}), which is a more efficient alternative to Cervino's algorithm to simultaneously match all maximal order types with their associated j-invariants.

The problem of determining when a (classical) crossed product $T=S^f*G$ of a finite group $G$ over a discrete valuation ring $S$ is a maximal order, was answered in the 1960's for the case where $S$ is tamely ramified over the subring of invariants $S^G$. The answer was given in terms of the conductor subgroup (with respect to $f$) of the inertia. In this paper we solve this problem in general when $S/S^G$ is residually separable. We show that the maximal order property entails a restrictive structure on the sub-crossed product graded by the inertia subgroup. In particular, the inertia is abelian. Using this structure, one is able to extend the notion of the conductor. As in the tame case, the order of the conductor is equal to the number of maximal two sided ideals of $T$ and hence to the number of maximal orders containing $T$ in its quotient ring. Consequently, $T$ is a maximal order if and only if the conductor subgroup is trivial.

In this paper we prove an analogue of Mordell's inequality for lattices in finite-dimensional complex or quaternionic Hermitian space that are modules over a maximal order in an imaginary quadratic number field or a totally definite rational quaternion algebra. This inequality implies that the 16-dimensional Barnes-Wall lattice has optimal density among all 16-dimensional lattices with Hurwitz structures.

We show that, in general, over a regular integral noetherian affine scheme X of dimension at least 6, there exist Brauer classes on X for which the associated division algebras over the generic point have no Azumaya maximal orders over X. Despite the algebraic nature of the result, our proof relies on the topology of classifying spaces of algebraic groups.

Necessary and sufficient conditions are given for a prime Noetherian algebra K[S] of a submonoid S of a polycyclic-by-finite group G to be a maximal order. These conditions are entirely in terms of the monoid S. This extends earlier results of Brown concerned with the group ring case and of the authors for the case where K[S] satisfies a polynomial identity.

We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions are based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions and can be extended to a larger number of Tx antennas. The usage of ideals guarantees a non-vanishing determinant larger than one and an easy way to present the exact proofs for the minimum determinants. The idea of finding denser sublattices within a given division algebra is then generalized to a multiple-input multiple-output (MIMO) case with an arbitrary number of Tx antennas by using the theory of cyclic division algebras (CDA) and maximal orders. It is also shown that the explicit constructions in this paper all have a simple decoding method based on sphere decoding. Related to the decoding complexity, the notion of sensitivity is introduced, and experimental evidence indicating a connection between sensitivity, decoding complexity and performance is provided. Simulations in a quasi-static Rayleigh fading channel show that our dense quaternionic constructions outperform both the earlier rectangular lattices and the rotated ABBA lattice as well as the DAST lattice. We also show that our quaternionic lattice is better than the DAST lattice in terms of the diversity-multiplexing gain tradeoff.

A saturated D-optimal design is a {+1,-1} square matrix of given order with maximal determinant. We search for saturated D-optimal designs of orders 19 and 37, and find that known matrices due to Smith, Cohn, Orrick and Solomon are optimal. For order 19 we find all inequivalent saturated D-optimal designs with maximal determinant, 2^30 x 7^2 x 17, and confirm that the three known designs comprise a complete set. For order 37 we prove that the maximal determinant is 2^39 x 3^36, and find a sample of inequivalent saturated D-optimal designs. Our method is an extension of that used by Orrick to resolve the previously smallest unknown order of 15; and by Chadjipantelis, Kounias and Moyssiadis to resolve orders 17 and 21. The method is a two-step computation which first searches for candidate Gram matrices and then attempts to decompose them. Using a similar method, we also find the complete spectrum of determinant values for {+1,-1} matrices of order 13.