Related papers: Higher Newton polygons and integral bases

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…

Let $F$ be a local field over $\mathbf{Q}_p$ or $\mathbf{F}_p((t))$, and let $D$ be a central simple division algebra over $F$ of degree $d$. In the $p$-adic case, we assume $p>de+1$ where $e$ is the ramification degree over $\mathbf{Q}_p$;…

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…

In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…

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 $K=\mathbb{Q}(\sqrt[n]{a})$ be an extension of degree $n$ of the field $\Q$ of rational numbers, where the integer $a$ is such that for each prime $p$ dividing $n$ either $p\nmid a$ or the highest power of $p$ dividing $a$ is coprime to…

By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

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…

For every prime integer $p$, an explicit factorization of the principal ideal $p\z_K$ into prime ideals of $\z_K$ is given, where $K$ is a quartic number field defined by an irreducible polynomial $X^4+aX+b\in\z[X]$.

We design a Quasi-Polynomial time deterministic approximation algorithm for computing the integral of a multi-dimensional separable function, supported by some underlying hyper-graph structure, appropriately defined. Equivalently, our…

We establish a higher dimensional counterpart of Bourgain's pointwise ergodic theorem along an arbitrary integer-valued polynomial mapping. We achieve this by proving variational estimates $V_r$ on $L^p$ spaces for all $1<p<\infty$ and…

In this paper, we present a new method for computing bounded-degree factors of lacunary multivariate polynomials. In particular for polynomials over number fields, we give a new algorithm that takes as input a multivariate polynomial f in…

Let $(K,v)$ be a henselian valued field. Let $\mathbb{P}^{dless}\subset K[x]$ be the set of monic, irreducible polynomials which are defectless and have degree greater than one. For a certain equivalence relation $\,\approx\,$ on…

Suppose $m$ be a $12$-th power free integer. Let $K=\mathbb{Q}(\theta)$ be an algebraic number field defined by a complex root $\theta$ of an irreducible polynomial $x^{12}-m$ and $O_K$ be its ring of integers. In this paper, we determine…

Let p be a monic polynomial in one complex variable and K a measurable subset of the complex plane. In terms of the area of K, we give an upper bound on the area of the preimage of K under p and a lower bound on the area of the image of K…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…