相关论文: Abstract algebra, projective geometry and time enc…

This paper studies Galois extensions over real quadratic number fields or cyclotomic number fields ramified only at one prime. In both cases, the ray class groups are computed, and they give restrictions on the finite groups that can occur…

We show that Galois theory of cyclotomic number fields provides a powerful tool to construct systematically integer-valued matrices commuting with the modular matrix S, as well as automorphisms of the fusion rules. Both of these…

While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…

Single-scale Feynman diagrams yield integrals that are periods, namely projective integrals of rational functions of Schwinger parameters. Algebraic geometry may therefore inform us of the types of number to which these integrals evaluate.…

We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically…

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

Galois orders, introduced in 2010 by V. Futorny and S. Ovsienko, form a class of associative algebras that contain many important examples, such as the enveloping algebra of $\mathfrak{gl}_n$ (as well as its quantum deformation),…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…

We discuss how basic notions of graph theory and associated graph polynomials define questions for algebraic geometry, with an emphasis given to an analysis of the structure of Feynman rules as determined by those graph polynomials as well…

The fundamental concepts in the Galois Theory are separable, normal and Galois field extensions. These concepts are central in proofs of the Galois Theory. In the paper, we introduce a new approach, a ring theoretic approach, to the Galois…

The topic of this thesis is the development of a versatile and geometrically motivated differential calculus on non-commutative or quantum spaces, providing powerful but easy-to-use mathematical tools for applications in physics and related…

We present solutions to a set of problems that arise in quantum entanglement theory, whose common trait is the use of algebraic methods. The backbone of the thesis consists of two general theorems, pertaining to specific convex sets of…

A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…

In this series of lectures directed towards a mainly mathematically oriented audience I try to motivate the use of operator algebra methods in quantum field theory. Therefore a title as ``why mathematicians are/should be interested in…

We show that under certain conditions every maximal symmetric subfield of a central division algebra with positive unitary involution $(B,\tau)$ will be a Galois extension of the fixed field of $\tau$ and will "real split" $(B,\tau)$. As an…

While geometry with transcendental curves, like the Quadratrix of Hippias and the Spiral of Archimedes, played a significant role in our modern developments of geometry and algebra. The investigation has fallen off in the modern era despite…

The monomial codes over a Galois field F_q that can be thought invariant subspaces are essential to us in this study. More specifically, we look into the link between monomial codes and characteristic subspaces and the decomposition of…

Simplest quantum teleportation algorithms can be represented in geometric terms in spaces of dimensions 3 (for real state-vectors) and 4 (for complex state-vectors). The geometric representation is based on geometric-algebra coding, a…

We determine the Galois module structure of the ring of integers for all cubic fields using roots of the generic cyclic cubic polynomial $f_n(X)=X^3-nX^2-(n+3)X-1$. Let $L_n=\mathbb Q(\rho_n)$ be a cyclic cubic field with Galois group…