相关论文: On reduced Arakelov divisors of real quadratic fie…

Let $C \geq 1$. Inspired by the LLL-algorithm, we define strongly $C$-reduced divisors of a number field $F$ which are generalized from the concept of reduced Arakelov divisors. Moreover, we prove that strongly $C$-reduced Arakelov divisors…

We introduce the notion of an effective Arakelov divisor for a number field and the arithmetical analogue of the dimension of the space of sections of a line bundle. We study the analogue of the theta divisor for a number field.

No polynomial-time algorithm is known to test whether a sparse polynomial G divides another sparse polynomial $F$. While computing the quotient Q=F quo G can be done in polynomial time with respect to the sparsities of F, G and Q, this is…

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…

In this article, we consider an analogue of Arakelov theory of arithmetic surfaces over a trivially valued field. In particular, we establish an arithmetic Hilbert-Samuel theorem and studies the effectivity up to R-linear equivalence of…

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…

The size function for a number field is an analogue of the dimension of the Riemann-Roch spaces of divisors on an algebraic curve. It was conjectured to attain its maximum at the trivial class of Arakelov divisors. This conjecture was…

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

In this note we consider the Milnor fiber $F$ associated to a reduced projective plane curve $C$. A computational approach for the determination of the characteristic polynomial of the monodromy action on the first cohomology group of $F$,…

Let $f(x)=x^{n}+ax^{3}+bx+c$ be the minimal polynomial of an algebraic integer $\theta$ over the rationals with certain conditions on $a,~b,~c,$ and $n.$ Let $K=\mathbb{Q}(\theta)$ be a number field and $\mathcal{O}_{K}$ be the ring of…

We study some foundational properties on discriminant divisors for generically smooth conic bundles. In particular, we extend the formula $\Delta_f \equiv -f_*K_{X/T}^2$ to arbitrary characteristics.

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

Let n be an odd number and F an imaginary quadratic field with odd discriminant. We show that there exists infinitely many cubic fields K such that the class number of K is divisible by n and the Galois closure of K contains F.

An error analysis of a splitting method applied to the Zakharov system is given. The numerical method is a Lie-Trotter splitting in time that is combined with a Fourier collocation in space to a fully discrete method. First-order…

We give a Euclidean division algorithm for the real quadratic fields $\mathbb{Q}(\sqrt{m})$ for $m \in \{2, 3, 6, 7, 11, 19\}$, with the property that the norm of the remainder depends on the first Euclidean minimum of the field. In each…

Let $C$ be a depth-3 arithmetic circuit of size at most $s$, computing a polynomial $ f \in \mathbb{F}[x_1,\ldots, x_n] $ (where $\mathbb{F}$ = $\mathbb{Q}$ or $\mathbb{C}$) and the fan-in of the product gates of $C$ is bounded by $d$. We…

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…