Related papers: Computation of Integral Bases

Irreducible polynomials play an important role till now, in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental…

A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…

Let $A$ be an absolutely simple abelian surface defined over a number field $K$ with a commutative (geometric) endomorphism ring. Let $\pi_{A, \text{split}}(x)$ denote the number of primes $\mathfrak{p}$ in $K$ such that each prime has norm…

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Let $C$ be a regular geometrically integral curve over an imperfect field $K$ and assume that it admits a non-smooth point $\mathfrak{p}$ which -- seen as a prime of the separable function field $K(C)|K$ -- is non-decomposed in the base…

By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…

Let $S$ be a Puiseux series of the germ of an analytically irreducible plane curve $Z$. We provide a new perspective to construct a set of polynomials $F=\{F_1,\ldots, F_{g-1}\}$ associated to $S$, which is a special choice of maximal…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

In this paper, we develop a Monte Carlo method for solving PDEs involving an integral fractional Laplacian (IFL) in multiple dimensions. We first construct a new Feynman-Kac representation based on the Green function for the fractional…

Integral bases, a minimal set of solutions to $Ax\leq b, x\in\Z^n$ that generate any other solution to $Ax\leq b, x\in\Z^n$, as a nonnegative integer linear combination, are always finite and are at the core of the Integral Basis Method…

Let $M\subset K$ be number fields. We consider the relation of relative power integral bases of $K$ over $M$ with absolute power integral bases of $K$ over $Q$. We show how generators of absolute power integral bases can be calculated from…

Already Dedekind and Weber considered the problem of counting integral ideals of norm at most $x$ in a given number field $K$. Here we improve on the existing results in case $K/\mathbb Q$ is abelian and has degree at least four. For these…

Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\M$ the maximal ideal of $A$. The first main result of this paper is a…

When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

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…

Given an arbitrary monic polynomial $f$ over a field $F$ of characteristic 0, we use companion matrices to construct a polynomial $M_f\in F[X]$ of minimum degree such that for each root $\alpha$ of $f$ in the algebraic closure of $F$,…

Let $A=\mathbb{F}_q[T]$ be the polynomial ring over $\mathbb{F}_q$, and $F$ be the field of fractions of $A$. Let $\phi$ be a Drinfeld $A$-module of rank $r\geq 2$ over $F$. For all but finitely many primes $\mathfrak{p}\lhd A$, one can…

Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…