Related papers: Generating sequences of rank 1 valuations

For a simple, normal and finite extension of a valued field, we prove that we can related the order of the ramification group of the field extension and the set of key polynomials associated to the extension of the valuation. More…

This paper deals with valuations of fields of formal meromorphic functions and their residue fields. We explicitly describe the residue fields of the monomial valuations. We also classify all the discrete rank one valuations of fields of…

The aim of this paper is the introduction of a new method for the numerical computation of the rank of a three-way array. We show that the rank of a three-way array over R is intimately related to the real solution set of a system of…

Sequences are often conveniently encoded in the form of a generating function depending on a formal variable. This note presents two observations that allow one to draw conclusions about the generated sequence from the generating function.…

Sequences of numbers (either natural integers, or integers or rational) of level $k \in \mathbb{N}$ have been defined in \cite{Fra05,Fra-Sen06} as the sequences which can be computed by deterministic pushdown automata of level $k$. This…

$\DeclareMathOperator{\IntR}{Int{}^\text{R}}$Integer-valued rational functions are a natural generalization of integer-valued polynomials. Given a domain $D$, the collection of all integer-valued rational functions over $D$ forms a ring…

Many natural language processing applications use language models to generate text. These models are typically trained to predict the next word in a sequence, given the previous words and some context such as an image. However, at test time…

This is a continuation of a previous paper by the same authors. In the former paper, it was proved that in order to obtain local uniformization for valuations centered on local domains, it is enough to prove it for rank one valuations. In…

In this paper, we study the structure of the graded ring associated to a limit key polynomial $Q_n$ in terms of the key polynomials that define $Q_n$. In order to do that, we use direct limits. In general, we describe the direct limit of a…

We propose a routing algorithm that takes a sequence of vectors and computes a new sequence with specified length and vector size. Each output vector maximizes "bang per bit," the difference between a net benefit to use and net cost to…

In these notes we investigate the rings of real polynomials in four variables, which are invariant under the action of the reflectiongroups [3,4,3] and [3,3,5]. It is well known that they are rationally generated in degree 2,6,8,12 and…

Given a well-ordered semi-group $\Gamma$ with a minimal system of generators of ordinal type at most $\omega n$ and of rational rank $r$, which satisfies a positivity and increasing condition, we construct a zero-dimensional valuation…

In this paper, we propose a convolutional neural network(CNN) with 3-D rank-1 filters which are composed by the outer product of 1-D filters. After being trained, the 3-D rank-1 filters can be decomposed into 1-D filters in the test time…

We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…

We give a proof of local strong factorization of a birational extension of regular local rings (of equicharacteristic zero) along a valuation of rank 1 and maximal rational rank. This gives an alternate proof to the geometric proof of this…

In this paper we give an introduction on how one can extend a valuation from a field $K$ to the polynomial ring $K[x]$ in one variable over $K$. This follows a similar line as the one presented by the author in his talk at ALaNT 5. We will…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

We analyze properties of the 2-adic valuations of an integer sequence that originates from an explicit evaluation of a quartic integral. We also give a combinatorial interpretation of the valuations of this sequence. Connections with the…

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We study the extension of valuations centered in a local domain to its henseliza-tion. We prove that a valuation $\nu$ centered in a local domain R uniquely determines a minimal prime H($\nu$) of the henselization R h of R and an extension…