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

For squarefree $d>1$, let $M$ denote the ring class field for the order $Z[\sqrt{-3d}]$ in $F=Q(\sqrt{-3d})$. Hasse proved that $3$ divides the class number of $F$ if and only if there exists a cubic extension $E$ of $Q$ such that $E$ and…

We study two fundamental problems related to finding subgraphs: (1) given graphs G and H, Subgraph Test asks if H is isomorphic to a subgraph of G, (2) given graphs G, H, and an integer t, Packing asks if G contains t vertex-disjoint…

The vast and complicated large-qubit state space forbids us to comprehensively capture the dynamics of modern quantum computers via classical simulations or quantum tomography. Recent progress in quantum learning theory prompts a crucial…

Let $K$ be any field with $\textup{char}K\neq 2,3$. We classify all cubic homogeneous polynomial maps $H$ over $K$ with $\textup{rk} JH\leq 2$. In particular, we show that, for such an $H$, if $F=x+H$ is a Keller map then $F$ is invertible,…

In the Trivially Perfect Editing problem one is given an undirected graph $G = (V,E)$ and an integer $k$ and seeks to add or delete at most $k$ edges in $G$ to obtain a trivially perfect graph. In a recent work, Dumas, Perez and Todinca…

Conner and Hurrelbrink established a method of determining the structure of the 2-Sylow subgroup of the tame kernel $K_2(\mathcal{O})$ for certain quadratic number fields. Specifically, the 4-rank for these fields was characterized in terms…

An ideal is a classical object of study in the field of algebraic number theory. In maximal quadratic orders of number fields, ideals usually represented by the $\mathbb Z$-basis. This form of representation is used in most of the…

Kernel methods are a highly effective and widely used collection of modern machine learning algorithms. A fundamental limitation of virtually all such methods are computations involving the kernel matrix that naively scale quadratically…

We present a quantum algorithm for implementing $\phi^4$ lattice scalar field theory on qubit computers. The field is represented in the discretized field amplitude basis. The number of qubits and elementary gates required by the…

Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…

We consider the problem of characterizing all number fields $K$ such that all algebraic integers $\alpha\in K$ can be written as the sum of distinct units of $K$. We extend a method due to Thuswaldner and Ziegler that previously did not…

The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with…

For a finite collection of graphs ${\cal F}$, the ${\cal F}$-M-DELETION (resp. ${\cal F}$-TM-DELETION) problem consists in, given a graph $G$ and an integer $k$, decide whether there exists $S \subseteq V(G)$ with $|S| \leq k$ such that $G…

This paper introduces two classes of totally real quartic number fields, one of biquadratic extensions and one of cyclic extensions, each of which has a non-principal Euclidean ideal. It generalizes techniques of Graves used to prove that…

We introduce the notion of differential largeness for fields equipped with several commuting derivations (as an analogue to largeness of fields). We lay out the foundations of this new class of "tame" differential fields. We state several…

Algebraic integers in totally imaginary quartic number fields are not discrete in the complex plane under a fixed embedding, which makes it impossible to visualize all integers in the plane, unlike the quadratic imaginary algebraic…

Feature selection is a common step in many ranking, classification, or prediction tasks and serves many purposes. By removing redundant or noisy features, the accuracy of ranking or classification can be improved and the computational cost…

We propose a novel framework for fast integral operations by uncovering hidden geometries in the row and column structures of the underlying operators. This is accomplished through the \texttt{Questionnaire} algorithm, an iterative…

We use the circle method to count $\mathbb{F}_q(t)$-rational points of bounded naive height on a quadric hypersurface $X\subseteq \mathbb{P}^{n-1}$ defined over $\mathbb{F}_q$, provided that $\mathrm{char}(\mathbb{F}_q)>2$ and $n\ge 3$.…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…