English
Related papers

Related papers: Triangular bases of integral closures

200 papers

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

Symbolic Computation · Computer Science 2020-05-11 Simon Abelard

Let $K$ be a finite $p$-adic field with uniformiser $\pi$. In this paper we study the image of the logarithm attached to a Lubin-Tate series $[\pi](X)$ on the maximal ideal of so-called $\pi$-regular extensions of $K$; for such an extension…

Number Theory · Mathematics 2026-05-01 Georgia Harbor-Collins

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

Number Theory · Mathematics 2012-04-23 Jens-Dietrich Bauch , Enric Nart , Hayden D. Stainsby

Algorithmic computation in polynomial rings is a classical topic in mathematics. However, little attention has been given to the case of rings with an infinite number of variables until recently when theoretical efforts have made possible…

Commutative Algebra · Mathematics 2017-08-04 Christopher J. Hillar , Robert Krone , Anton Leykin

Let $I$ be a monomial ideal in a polynomial ring $S=K[x_1,\ldots,x_n]$ over a field $K$ with $n=2$ or $3$, and let $\overline{I}$ be its integral closure. We will show that $\text{reg} (\overline{I}) \le \text{reg} (I)$. Furthermore, if $I$…

Commutative Algebra · Mathematics 2026-03-05 Yijun Cui , Cheng Gong , Guangjun Zhu

Given real numbers whose sum is an integer, we study the problem of finding integers which match these real numbers as closely as possible, in the sense of L^p norm, while preserving the sum. We describe the structure of solutions for this…

Data Structures and Algorithms · Computer Science 2015-01-05 Rama Cont , Massoud Heidari

Let I be an ideal of a regular local ring Q with residue field k. The length of the minimal free resolution of R=Q/I is called the codepth of R. If it is at most 3, then the resolution carries a structure of a differential graded algebra,…

Commutative Algebra · Mathematics 2016-01-20 Lars Winther Christensen , Oana Veliche

Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of $\mathbb{P}^n$ of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings…

Algebraic Geometry · Mathematics 2023-11-28 Martin Kreuzer , Le Ngoc Long , Lorenzo Robbiano

Let $R$ be a Dedekind ring, $K$ its quotient field, and $L=K(\alpha)$ a finite field extension of $K$ defined by a monic irreducible polynomial $f(x)\in R[x]$. We give an easy version of Dedekind's criterion which computationally improves…

Number Theory · Mathematics 2018-10-09 A. Deajim , L. El Fadil

The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2^(O(k)) + k2 * nm) on graphs with n vertices and m…

Data Structures and Algorithms · Computer Science 2011-04-13 Fedor V. Fomin , Yngve Villanger

Let $b$ be a fractional ideal of a one-dimensional Cohen-Macaulay local ring $O$ containing a perfect field $k$. This paper is devoted to the study some $O$-modules associated with $b$. In addition, different motivic Poincar\'e series are…

Algebraic Geometry · Mathematics 2011-07-01 Julio José Moyano-Fernández

We present an $O(1)$-round fully-scalable deterministic massively parallel algorithm for computing the min-plus matrix multiplication of unit-Monge matrices. We use this to derive a $O(\log n)$-round fully-scalable massively parallel…

Data Structures and Algorithms · Computer Science 2024-04-23 Jaehyun Koo

Suppose that $(K,v_0)$ is a valued field, $f(x)\in K[x]$ is a monic and irreducible polynomial and $(L,v)$ is an extension of valued fields, where $L=K[x]/(f(x))$. Let $A$ be a local domain with quotient field $K$ dominated by the valuation…

Commutative Algebra · Mathematics 2023-08-11 Razieh Ahmadian , Steven Dale Cutkosky

The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…

Signal Processing · Electrical Eng. & Systems 2018-08-07 Luke Pfister , Yoram Bresler

We give a fast algorithm for computing an irreducible triangulation $T^\prime$ of an oriented, connected, boundaryless, and compact surface $S$ in $E^d$ from any given triangulation $T$ of $S$. If the genus $g$ of $S$ is positive, then our…

Geometric Topology · Mathematics 2023-12-19 Suneeta Ramaswami , Marcelo Siqueira

We present a new algorithm to compute the integral closure of a reduced Noetherian ring in its total ring of fractions. A modification, applicable in positive characteristic, where actually all computations are over the original ring, is…

Commutative Algebra · Mathematics 2010-06-08 Gert-Martin Greuel , Santiago Laplagne , Frank Seelisch

A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…

Commutative Algebra · Mathematics 2008-01-30 Matthias Aschenbrenner , Christopher J. Hillar

In this paper we exhibit an example of a three-dimensional regular local domain (A, n) having a height-two prime ideal P with the property that the extension PA^ of P to the n-adic completion A^ of A is not integrally closed. We use a…

Commutative Algebra · Mathematics 2007-05-23 William Heinzer , Christel Rotthaus , Sylvia Wiegand

We characterise ideals in two-dimensional regular local rings that arise as ideals of maximal minors of indecomposable integrally closed modules of rank two.

Commutative Algebra · Mathematics 2023-04-20 Futoshi Hayasaka , Vijay Kodiyalam

The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…

Symbolic Computation · Computer Science 2009-07-25 Xin Li , Marc Moreno Maza , Wei Pan