Related papers: Generating sequences of rank 1 valuations

We work with rational rank 1 valuations centered in regular local rings. Given an algebraic function field $K$ of transcendence degree 3 over $k$, a regular local ring $R$ with $QF(R)=K$ and a $k$-valuation $\nu$ of $K$, we provide an…

In this paper we develop a method for constructing generating sequences for valuations dominating the ring of a two dimensional quotient singularity. Suppose that $K$ is an algebraically closed field of characteristic zero, $K[X,Y]$ is a…

In this paper we study the rank one discrete valuations of $k((X_1,... ,X_n))$ whose center in $k\lcor\X\rcor$ is the maximal ideal $(\X)$. In sections 2 to 6 we give a construction of a system of parametric equations describing such…

Consider a simple algebraic valued field extension $(L/K,v)$ and denote by $\mathcal O_L$ and $\mathcal O_K$ the corresponding valuation rings. The main goal of this paper is to present, under certain assumptions, a description of $\mathcal…

In this paper we study the rank one discrete valuations of the field $k((X_1,..., X_n))$ whose center in $k\lcor\X\rcor$ is the maximal ideal. In sections 2 to 6 we give a construction of a system of parametric equations describing such…

Suppose that (K, $\nu$) is a valued field, f (z) $\in$ K[z] is a unitary and irreducible polynomial and (L, $\omega$) is an extension of valued fields, where L = K[z]/(f (z)). Further suppose that A is a local domain with quotient field K…

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…

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

Let $R$ be a two-dimensional regular local ring. In this paper, we prove that there is a bijection between the set of all valuations of $Quot(R)$ centered at $R$ and valuations of $k(x,y)$ centered at $k[x,y]_{(x,y)}$, where $k$ is the…

For a finite valued field extension $(L/K,v)$ we describe the problem of find sets of generators for the corresponding extension $\mathcal O_L/\mathcal O_K$ of valuation rings. The main tool to obtain such sets are complete sets of (key)…

We note that a rational $3$-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational $3$-tangle diagrams up to isotopy. However, there is no perfect classification about rational…

We classify all possible extensions of a valuation from a ground field $K$ to a rational function field in one or several variables over $K$. We determine which value groups and residue fields can appear, and we show how to construct…

We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tensor decomposition as a sum of rank-one tensors, when given…

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

The main goal of this paper is to study the different definitions of generating sequences appearing in the literature. We present these definitions and show that under certain situations they are equivalent. We also present an example that…

Algorithms for computing rational generating functions of solutions of one-dimensional difference equations are well-known and easy to implement. We propose an algorithm for computing rational generating functions of solutions of…

Let $R$ be a complete equicharacteristic noetherian local domain with an algebraically closed residue field $k$. Let $\nu$ be a zero dimensional valuation of rank one centered in $R$ with value group $\Phi$. We show that there is a…

A new method for parallel generation of $q$-valued pseudorandom sequence based on the presentation of systems generating logical formulae by means of arithmetic polynomials is proposed. Fragment consisting of $k$-elements of $q$-valued…

Consider a subfield of the field of rational functions in several indeterminates. We present an algorithm that, given a set of generators of such a subfield, finds a simple generating set. We provide an implementation of the algorithm and…

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…