相关论文: On the tame kernels of imaginary cyclic quartic fi…

The number of non-isomorphic cubic fields L sharing a common discriminant d(L) = d is called the multiplicity m = m(d) of d. For an assigned value of d, these fields are collected in a multiplet M(d) = (L(1) ,..., L(m)). In this paper, the…

It has recently been shown that the NP-hard problem of calculating the minimum number of hybridization events that is needed to explain a set of rooted binary phylogenetic trees by means of a hybridization network is fixed-parameter…

We prove an asymptotic formula for class numbers of totlally imaginary quartic number fields, ie for number fields of degree 4 over Q with only complex embeddings. After previous work for real quadratic fields (Sarnak) and complex cubic…

In this paper, we obtain an asymptotic formula for the number of imaginary quadratic fields with prime discriminant and class number up to $H$, as $H\to \infty$. Previously, such an asymptotic was only known under the assumption of the…

Square-tiled surfaces can be classified by their number of squares and their cylinder diagrams (also called realizable separatrix diagrams). For the case of $n$ squares and two cone points with angle $4 \pi$ each, we set up and parametrize…

Let $K$ be an imaginary quadratic field of discriminant less than or equal to -7 and $K_{(N)}$ be its ray class field modulo $N$ for an integer $N$ greater than 1. We prove that singular values of certain Siegel functions generate $K_{(N)}$…

The P\'olya group ${\rm Po}(K)$ of a number field $K$ is the subgroup of the ideal class group ${\rm Cl}(K)$ of $K$ generated by the classes of all the products of the prime ideals of $K$ with the same norm. Motivated by the classical "one…

Deciding whether an ideal of a number field is principal and finding a generator is a fundamental problem with many applications in computational number theory. For indefinite quaternion algebras, the decision problem reduces to that in the…

The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…

Let $\mathds{k}$ be a real quadratic number field. Denote by $\mathrm{Cl}_2(\mathds{k})$ its $2$-class group and by $\mathds{k}_2^{(1)}$ (resp. $\mathds{k}_2^{(2)}$) its first (resp. second) Hilbert $2$-class field. The aim of this paper is…

We determine some properties of the narrow 2-class field tower of those real quadratic number fields whose discriminants are not a sum of two squares and for which their 2-class groups are elementary of order $4$. Here in Part I, we…

The main aim of this paper is to prove $R$-triviality for simple, simply connected algebraic groups with Tits index $E_{8,2}^{78}$ or $E_{7,1}^{78}$, defined over a field $k$ of arbitrary characteristic. Let $G$ be such a group. We prove…

We derive general bounds on operator dimensions, central charges, and OPE coefficients in 4D conformal and N=1 superconformal field theories. In any CFT containing a scalar primary phi of dimension d we show that crossing symmetry of <phi…

For a finite group $G$, let $K(G)$ denote the field generated over $\mathbb{Q}$ by its character values. For $n>24$, G. R. Robinson and J. G. Thompson proved that $$K(A_n)=\mathbb{Q}\left (\{ \sqrt{p^*} \ : \ p\leq n \ {\text{ an odd prime…

The use of kernel functions is a common technique to extract important features from data sets. A quantum computer can be used to estimate kernel entries as transition amplitudes of unitary circuits. Quantum kernels exist that, subject to…

Let $d>1$ be an integer and $K_0$ a perfect field such that $char(K_0)$ does not divide $d$. Let $n>d$ be an integer that is prime to $d$. Let $f(x)\in K_0[x]$ be a degree $n$ monic polynomial without repeated roots, and $\mathcal{C}_{f,d}$…

This paper presents an efficient and scalable tensor network framework for quantum kernel circuit simulation, alleviating practical costs associated with increasing qubit counts and data size. The framework enables systematic large-scale…

It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…

We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$,…

For a square-free integer $t$, Byeon \cite{byeon} proved the existence of infinitely many pairs of quadratic fields $\mathbb{Q}(\sqrt{D})$ and $\mathbb{Q}(\sqrt{tD})$ with $D > 0$ such that the class numbers of all of them are indivisible…