English
Related papers

Related papers: Key polynomials and minimal pairs

200 papers

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

Combinatorics · Mathematics 2026-05-05 Tristram Bogart , Federico Castillo , Damián de la Fuente , David Plaza

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

Logic in Computer Science · Computer Science 2015-07-01 Friedrich Neurauter , Aart Middeldorp

We show how $\ell$-ifications, which are companion forms of matrix polynomials, namely, lower order matrix polynomials with the same eigenvalues as a given complex square matrix polynomial, can be used in combination with other recent…

Rings and Algebras · Mathematics 2017-02-22 Aaron Melman

Let $\Bbbk$ be an algebraically closed field of characteristic $p>2$. Let $\mathcal{O}_n=\Bbbk[X_1,\ldots,X_n]/(X_1^p,\ldots, X_n^p)$, a truncated polynomial ring in $n$ variables, and denote by $\mathcal{L}$ the derivation algebra of…

Rings and Algebras · Mathematics 2014-07-23 Alexander Premet

Matrix-valued analogues of the little q-Jacobi polynomials are introduced and studied. For the 2x2-matrix-valued little q-Jacobi polynomials explicit expressions for the orthogonality relations, Rodrigues formula, three-term recurrence…

Classical Analysis and ODEs · Mathematics 2015-07-15 Noud Aldenhoven , Erik Koelink , Ana M. de los Ríos

We show that the reduced point variety of a quantum polynomial algebra is the union of specific linear subspaces in $\mathbb{P}^n$, we describe its irreducible components and give a combinatorial description of the possible configurations…

Rings and Algebras · Mathematics 2016-07-14 Pieter Belmans , Kevin De Laet , Lieven Le Bruyn

We show that every definable nested family of closed and bounded subsets of a $P$-minimal field $K$ has non-empty intersection. As an application we answer a question of Darni\`ere and Halupczok showing that $P$-minimal fields satisfy the…

Logic · Mathematics 2020-07-16 Pablo Cubides Kovacsics , Françoise Delon

Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…

Number Theory · Mathematics 2023-10-20 S. Rajagopal , P. Vanchinathan

Suppose $F$ is a field with valuation $v$ and valuation ring $O_{v}$, $E$ is a finite field extension and $w$ is a quasi-valuation on $E$ extending $v$. We study quasi-valuations on $E$ that extend $v$; in particular, their corresponding…

Commutative Algebra · Mathematics 2013-01-23 Shai Sarussi

Let $K$ be a field and let $\mathbb N = \{1,2, \dots \}$. Let $R_n=K[x_{ij} \mid 1\le i\le n, j\in \mathbb N]$ be the ring of polynomials in $x_{ij}$ $(1 \le i \le n, j \in \mathbb N)$ over $K$. Let $S_n = Sym (\{1,2, \ldots, n \})$ and…

Rings and Algebras · Mathematics 2015-09-30 Eudes Antonio da Costa , Alexei Krasilnikov

Polynomial identity testing and arithmetic circuit lower bounds are two central questions in algebraic complexity theory. It is an intriguing fact that these questions are actually related. One of the authors of the present paper has…

Computational Complexity · Computer Science 2012-02-17 Bruno Grenet , Pascal Koiran , Natacha Portier , Yann Strozecki

We prove the $\Lambda$-variation diminishing property of the Bernstein and Kantorovich polynomials. Next we apply this result to characterize the space $C\Lambda BV_c$ as the closure of the space of polynomials in the $\Lambda BV$ norm. A…

Functional Analysis · Mathematics 2017-03-07 Klaudiusz Czudek

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the valuation of the discriminant, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater…

Algebraic Geometry · Mathematics 2019-11-06 Adrien Poteaux , Martin Weimann

Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…

Combinatorics · Mathematics 2019-07-23 Qing-Hu Hou , Yan-Ping Mu , Doron Zeilberger

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

Combinatorics · Mathematics 2008-11-25 Tewodros Amdeberhan , Richard P. Stanley

A number $\lambda \in \mathbb C $ is called an {\it eigenvalue} of the matrix polynomial $P(z)$ if there exists a nonzero vector $x \in \mathbb C^n$ such that $P(\lambda)x = 0$. Note that each finite eigenvalue of $P(z)$ is a zero of the…

Spectral Theory · Mathematics 2019-02-19 Công-Trình Lê , Thi-Hoa-Binh Du , Tran-Duc Nguyen

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

Combinatorics · Mathematics 2017-03-24 Shizuo Kaji , Toshiaki Maeno , Koji Nuida , Yasuhide Numata

In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…

Logic · Mathematics 2023-06-22 Karim Nour , Mohamad Ziadeh

A small value estimate is a statement providing necessary conditions for the existence of certain sequences of non-zero polynomials with integer coefficients taking small values at points of an algebraic group. Such statements are desirable…

Number Theory · Mathematics 2014-01-14 Damien Roy

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

Computational Complexity · Computer Science 2024-10-04 Abhranil Chatterjee , Sumanta Ghosh , Rohit Gurjar , Roshan Raj