English
Related papers

Related papers: Genetics of polynomials over local fields

200 papers

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…

Algebraic Geometry · Mathematics 2009-10-16 Arnaud Bodin

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

In this paper we study the structure of polynomials of degree three and four that have high bias or high Gowers norm, over arbitrary prime fields. In particular we obtain the following results. 1. We give a canonical representation for…

Combinatorics · Mathematics 2010-01-01 Elad Haramaty , Amir Shpilka

Exceptional orthogonal polynomials are families of orthogonal polynomials that arise as solutions of Sturm-Liouville eigenvalue problems. They generalize the classical families of Hermite, Laguerre, and Jacobi polynomials by allowing for…

Classical Analysis and ODEs · Mathematics 2021-02-23 María Ángeles García-Ferrero , David Gómez-Ullate , Robert Milson

Optimal Mixing (OM) is a variation operator that integrates local search with genetic recombination. EAs with OM are capable of state-of-the-art optimization in discrete spaces, offering significant advantages over classic…

Neural and Evolutionary Computing · Computer Science 2025-06-19 Anton Bouter , Dirk Thierens , Peter A. N. Bosman

Orthogonal polynomials are of fundamental importance in many fields of mathematics and science, therefore the study of a particular family is always relevant. In this manuscript, we present a survey of some general results of the Hermite…

Numerical Analysis · Mathematics 2020-02-18 Keith Y. Patarroyo

Signature-based algorithms have become a standard approach for Gr\"obner basis computations for polynomial systems over fields, but how to extend these techniques to coefficients in general rings is not yet as well understood. In this…

Symbolic Computation · Computer Science 2019-05-28 Maria Francis , Thibaut Verron

This paper presents the concept of digit polynomials, which leads to a deterministic and unconditional integer factorization algorithm with the runtime complexity $\mathcal{O}(N^{1/4+\epsilon})$. Strassen's well known factoring approach is…

Number Theory · Mathematics 2015-12-22 Markus Hittmeir

We consider orthogonal polynomials on the surface of a double cone or a hyperboloid of revolution, either finite or infinite in axis direction, and on the solid domain bounded by such a surface and, when the surface is finite, by…

Classical Analysis and ODEs · Mathematics 2019-12-17 Yuan Xu

Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…

Data Structures and Algorithms · Computer Science 2026-02-11 Nick Fischer , Melvin Kallmayer , Leo Wennmann

Phylogenetic invariants are certain polynomials in the joint probability distribution of a Markov model on a phylogenetic tree. Such polynomials are of theoretical interest in the field of algebraic statistics and they are also of practical…

Populations and Evolution · Quantitative Biology 2008-01-21 Nicholas Eriksson

We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…

Combinatorics · Mathematics 2020-10-20 Adam W. Marcus

Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…

Discrete Mathematics · Computer Science 2025-09-29 Mehul Bafna , Shaghik Amirian

We study the question up to which power an irreducible integer-valued polynomial that is not absolutely irreducible can factor uniquely. For example, for integer-valued polynomials over principal ideal domains with square-free denominator,…

Commutative Algebra · Mathematics 2025-07-15 Sarah Nakato , Roswitha Rissner

We characterize the biorthogonal ensembles that are both a multiple orthogonal polynomial ensemble and a polynomial ensemble of derivative type (also called a P\'olya ensemble). We focus on the notions of multiplicative and additive…

Probability · Mathematics 2026-02-17 Thomas Wolfs

Let $f(x)=(x^{k}+c)^{m}-ax^{n}\in\mathbb{Z}[x]$ be an irreducible polynomial over $\mathbb{Q}$, where $k,m,n\in\mathbb{N}$ with $km>n$, and let $K=\mathbb{Q}(\theta)$, where $\theta$ is a root of $f(x)$. We investigate the arithmetic…

Number Theory · Mathematics 2026-02-24 Rupam Barman , Anuj Jakhar , Ravi Kalwaniya , Prabhakar Yadav

In this article we present a method to implement orthogonal polynomials and many other special functions in Computer Algebra systems enabling the user to work with those functions appropriately, and in particular to verify different types…

Classical Analysis and ODEs · Mathematics 2016-09-06 Wolfram Koepf

Consider a discrete valuation ring $R$ whose residue field is finite of cardinality at least $3$. For a finite torsion module, we consider transitive subsets $O$ under the action of the automorphism group of the module. We prove that the…

Representation Theory · Mathematics 2017-05-15 C. P. Anil Kumar

Among all states on the algebra of non-commutative polynomials, we characterize the ones that have monic orthogonal polynomials. The characterizations involve recursion relations, Hankel-type determinants, and a representation as a joint…

Combinatorics · Mathematics 2008-04-05 Michael Anshelevich

A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…

Classical Analysis and ODEs · Mathematics 2008-11-26 Satoru Odake , Ryu Sasaki
‹ Prev 1 8 9 10 Next ›