Related papers: Certain CM class fields with smaller generators

Let $K$ be a field and $G$ be a group of its automorphisms. If $G$ is precompact then $K$ is a generator of the category of smooth (i.e. with open stabilizers) $K$-semilinear representations of $G$. There are non-semisimple smooth…

For certain rings $\mathcal{R}$, we construct explicit matrices representing nonzero classes in the algebraic $K$ theory group $NK_{1}(\mathcal{R})$.

Let $\Uq$ be a quantum group. Regarding a (noncommutative) space with $\Uq$-symmetry as a $\Uq$-module algebra $A$, we may think of equivariant vector bundles on $A$ as projective $A$-modules with compatible $\Uq$-action. We construct an…

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 show that we can develop from scratch and using only classical language a theory of relative quadratic extensions of a given number field $K$ which is as explicit and easy as for the well-known case that $K$ is the field of rational…

In the theory of complex multiplication, it is important to construct class fields over CM fields. In this paper, we consider explicit $K3$ surfaces parametrized by Klein's icosahedral invariants. Via the periods and the Shioda-Inose…

We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…

Let $F$ be a number field with ring of integers $O_F$ and let $G$ be a finite group. We describe an approach to the study of the set of realisable classes in the locally free class group $Cl(O_FG)$ of $O_FG$ that involves applying the work…

We define a notion of formal quantum field theory and associate a formal quantum field theory to K-theoretical intersection theories on Hilbert schemes of points on algebraic surfaces. This enables us to find an effective way to compute…

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

We compute the $2$-completed integral motivic homology, effective algebraic K-theory, and very effective hermitian K-theory of the geometric classifying space of the cyclic group of order two over algebraically closed fields, the real…

A general form factor formula for the scaling Z(N)-Ising model is constructed. Exact expressions for matrix elements are obtained for several local operators. In addition, the commutation rules for order, disorder parameters and para-Fermi…

We construct a functor from the Hecke category to a groupoid built from the underlying Coxeter group. This fixes a gap in an earlier work of the authors. This functor provides an abstract realization of the localization of the Hecke…

We construct some families of quadratic fields whose class numbers are divisible by $3.$ The main tools used are a trinomial introduced by Kishi and a parametrization of Kishi and Miyake of a family of quadratic fields whose class numbers…

Using the Riesz-Feller fractional derivative, we apply the factorization algorithm to the fractional quantum harmonic oscillator along the lines previously proposed by Olivar-Romero and Rosas-Ortiz, extending their results. We solve the…

We construct Eisenstein cocycles for arithmetic subgroups of GL_2 of imaginary quadratic fields valued in second K-groups of products of two CM elliptic curves. We use these to construct maps from the first homology groups of Bianchi spaces…

Conditional random field (CRF) is an important probabilistic machine learning model for labeling sequential data, which is widely utilized in natural language processing, bioinformatics and computer vision. However, training the CRF model…

The aim of this paper is to introduce and study a large class of $\mathfrak{g}$-module algebras which we call factorizable by generalizing the Gauss factorization of (square or rectangular) matrices. This class includes coordinate algebras…

In this paper, we examine the general algorithm for class group computations, when we do not have a small defining polynomial for the number field. Based on a result of Biasse and Fieker, we simplify their algorithm, improve the complexity…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.