English
Related papers

Related papers: Genetics of polynomials over local fields

200 papers

Neural networks have the ability to serve as universal function approximators, but they are not interpretable and don't generalize well outside of their training region. Both of these issues are problematic when trying to apply standard…

Machine Learning · Computer Science 2023-08-21 Colby Fronk , Linda Petzold

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

Number Theory · Mathematics 2008-10-31 Jordi Guardia , Jesus Montes , Enric Nart

We find arbitrarily large configurations of irreducible polynomials over finite fields that are separated by low degree polynomials. Our proof adapts an argument of Pintz from the integers, in which he combines the methods of…

Number Theory · Mathematics 2015-03-06 Hans Parshall

We discuss rather systematically the principle, implicit in earlier works, that for a "random" element in an arithmetic subgroup of a (split, say) reductive algebraic group over a number field, the splitting field of the characteristic…

Number Theory · Mathematics 2012-01-25 F. Jouve , E. Kowalski , D. Zywina

Discrete dynamical systems defined by the iteration of a polynomial map of the unit simplex to itself appear in the context of population genetic systems evolving under mutation, recombination and weak selection. Although exceptional…

Dynamical Systems · Mathematics 2013-07-15 Sergio Lukic

Let $\iota:K\hookrightarrow L\cong K(x)$ be a simple transcendental extension of valued fields, where $K$ is equipped with a valuation $\nu$ of rank 1. That is, we assume given a rank 1 valuation $\nu$ of $K$ and its extension $\nu'$ to…

Algebraic Geometry · Mathematics 2022-06-30 F. J. Herrera Govantes , W. Mahboub , M. A. Olalla Acosta , M. Spivakovsky

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,…

Logic · Mathematics 2014-07-23 Leigh Evron , Joseph R. Mileti , Ethan Ratliff-Crain

Let $(K,v)$ be a valued field, and $\mu$ an inductive valuation on $K[x]$ extending $v$. Let $G_\mu$ be the graded algebra of $\mu$ over $K[x]$, and $\kappa$ the maximal subfield of the subring of $G_\mu$ formed by the homogeneous elements…

Algebraic Geometry · Mathematics 2020-05-01 Nathália Moraes de Oliveira , Enric Nart

Diaconis and Griffiths (2014) study the multivariate Krawtchouk polynomials orthogonal on the multinomial distribution. In this paper we derive the reproducing kernel orthogonal polynomials Q_n(x,y};N,p) on the multinomial distribution…

Probability · Mathematics 2019-02-06 Persi Diaconis , Robert Griffiths

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…

Number Theory · Mathematics 2024-09-16 Jose Felipe Voloch

Denote by $\mathfrak{o}$ the valuation ring of a non-Archimedean local field with prime ideal $\mathfrak{p}$ and finite residue field, and let $r\geq 1$ be an integer. We prove that for every smooth affine group scheme $G$ over…

Representation Theory · Mathematics 2024-05-24 Alexander Jackson

Let $D$ be an integrally closed domain with quotient field $K$ and $n$ a positive integer. We give a characterization of the polynomials in $K[X]$ which are integer-valued over the set of matrices $M_n(D)$ in terms of their divided…

Rings and Algebras · Mathematics 2018-10-03 Giulio Peruginelli

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Commutative Algebra · Mathematics 2009-08-22 Ivan V. Arzhantsev , Anatoliy P. Petravchuk

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

Rings and Algebras · Mathematics 2026-01-15 Maithri K. , Vadiraja Bhatta G. R. , Indira K. P. , Prasanna Poojary

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

Commutative Algebra · Mathematics 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…

Number Theory · Mathematics 2015-03-13 Simone Ugolini

For $(K,v)$ a Henselian valued field, let $\theta\in\overline{K}$ with minimal polynomial $F$ over $K$. Okutsu sequences of $\theta$ have been defined only when the extension $K(\theta)/K$ is defectless. In this paper, we extend this…

Number Theory · Mathematics 2024-07-16 Enric Nart

Let $\F_q$ be a finite field of characteristic $p>0$. We prove that, given $F(t,x)\in \F_q[t][x]$ an irreducible separable monic polynomial in the variable $x$ and a generic monic polynomial $\phi(t)$ in the variable $t$, the polynomial…

Number Theory · Mathematics 2023-08-16 Sushma Palimar

Let $K$ be a number field of degree $n$ with ring of integers $O_K$. By means of a criterion of Gilmer for polynomially dense subsets of the ring of integers of a number field, we show that, if $h\in K[X]$ maps every element of $O_K$ of…

Number Theory · Mathematics 2018-10-03 Giulio Peruginelli

We show that some hard to detect properties of quadratic ODEs (eg certain preserved integrals and measures) can be deduced more or less algorithmically from their Kahan discretization, using Darboux Polynomials (DPs). Somewhat similar…

Classical Analysis and ODEs · Mathematics 2021-04-14 G. R. W. Quispel , D. I. McLaren , C. Evripidou