Related papers: Triangular bases of integral closures

Let F:K be a Galois extension of number fields and Q a prime ideal of O_F lying over the prime P of O_K. By analyzing the Q-adic closure of O_K in O_F we characterize those rings of integers O_K for which every residue class ring of…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

Given a number field $k$ with the ring of integers $\mathcal{O}_k$ and a matrix $M\in \mathrm{M}_{n}(\mathcal{O}_k)$. We prove that if $\mathcal{O}_k$ is a principal ideal domain, the local-global principle for triangularizability and…

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

The problem of evaluating potential integrals on planar triangular elements has been addressed using a polar coordinate decomposition. The resulting formulae are general, exact, easily implemented, and have only one special case, that of a…

We give a polynomial-time constant-factor approximation algorithm for maximum independent set for (axis-aligned) rectangles in the plane. Using a polynomial-time algorithm, the best approximation factor previously known is $O(\log\log n)$.…

The main result in this paper is to supply a recursive formula, on the number of minimal primes, for the colength of a fractional ideal in terms of the maximal points of the value set of the ideal itself. The fractional ideals are taken in…

We develop the basic properties of an essentially new closure operation on submodules, the \emph{liftable integral closure} of a submodule, including its relationships with the two prevailing notions of integral closure of submodules. We…

The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of…

In this article we present a parallel modular algorithm to compute all solutions with multiplicities of a given zero-dimensional polynomial system of equations over the rationals. In fact, we compute a triangular decomposition using…

Let $P_N(R)$ be the space of all real polynomials in $N$ variables with the usual inner product $<, >$ on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form…

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $M_{n,t}=(x^{e_1},\ldots, x^{e_n})$ be a monomial ideal of $R$, where $x^{e_i}=x_1^t\ldots x_{i-1}^tx_{i+1}^t\ldots x_n^t$. We study the unmixedness…

When $E$ is an $R$-module over a commutative unital ring $R$, the Zariski closure of its support is of the form $\mathrm V(\mathcal O(E))$ where $\mathcal O(E)$ is a unique radical ideal. We give an explicit form of $\mathcal O(E)$ and…

The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Primal-Dual Circle Packing Theorem for 3-connected planar…

Computing well-rounded twists of ideals in number fields has been done when the field degree is $2$. In this paper, we develop a new algorithm to detect whether a basis of an ideal $\mathfrak{I}$ in a cyclic cubic field $F$ yields a…

For a prime $p$, the OM algorithm finds the $p$-adic factorization of an irreducible polynomial $f\in\mathbb{Z}[x]$ in polynomial time. This may be applied to construct $p$-integral bases in the number field $K$ defined by $f$. In this…

Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

We analyze the approximation by radial basis functions of a hypersingular integral equation on an open surface. In order to accommodate the homogeneous essential boundary condition along the surface boundary, scaled radial basis functions…

We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…