English
Related papers

Related papers: Limit key polynomials as $p$-polynomials

200 papers

For a natural extension of the circular unitary ensemble of order n, we study as n tends to infinity, the asymptotic behavior of the sequence of orthogonal polynomials with respect to the spectral measure. The last term of this sequence is…

Probability · Mathematics 2013-02-27 Joseph Najnudel , Ashkan Nikeghbali , Alain Rouault

If $E$ is a subset of the integers then the $n$-th characteristic ideal of $E$ is the fractional ideal of $\mathbb{Z} $ consisting of $0$ and the leading coefficients of the polynomials in $\mathbb{Q}[x]$ of degree no more than $n$ which…

Number Theory · Mathematics 2016-09-02 Marie-Andree B. Langlois

A positive integer k is a length of a polynomial if that polynomial factors into a product of k irreducible polynomials. We find the set of lengths of polynomials of the form x^n in R[x], where (R, m) is an Artinian local ring with m^2 = 0.

Commutative Algebra · Mathematics 2016-07-11 Richard Belshoff , Daniel Kline , Mark W. Rogers

In this article we provide a combinatorial sufficient (and conjecturally, necessary) condition (called $\alpha$-symmetry) for the mating of two postcritically finite polynomials in $\mathcal{S}_1$ to be obstructed. To do this, we study the…

Dynamical Systems · Mathematics 2023-03-20 Thomas Sharland

The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…

Computational Complexity · Computer Science 2008-09-07 Jerrald Meek

Let (K, v) be a henselian valued field of arbitrary rank. In this paper, we give an irreducibility criterion for multivariate polynomials over K using valuation theory.

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…

Number Theory · Mathematics 2026-04-17 Alice Bazzanella , Carlo Sanna

A first-order conditional logic is considered, with semantics given by a variant of epsilon-semantics, where p -> q means that Pr(q | p) approaches 1 super-polynomially --faster than any inverse polynomial. This type of convergence is…

Cryptography and Security · Computer Science 2008-12-18 Joseph Y. Halpern

Ramsey quantifiers are a natural object of study not only for logic and computer science, but also for the formal semantics of natural language. Restricting attention to finite models leads to the natural question whether all Ramsey…

Logic in Computer Science · Computer Science 2020-01-15 Ronald de Haan , Jakub Szymanik

We give an example of a polynomial of degree 4 in 5 variables that is the sum of squares of 8 polynomials and cannot be decomposed as the sum of 7 squares. This improves the current existing lower bound of 7 polynomials for the Pythagoras…

Algebraic Geometry · Mathematics 2023-06-12 Santiago Laplagne

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

Number Theory · Mathematics 2020-07-30 Igor E. Shparlinski , Qiang Wang

The object of the present paper is to study certain properties and characteristics of the operator $Q_{p,\beta}^{\alpha}$defined on p-valent analytic function by using technique of differential subordination.We also obtained result…

Complex Variables · Mathematics 2017-08-02 Ashok Kumar Sahoo

We begin a generalized study of sum-product type phenomenon in different fields by considering pairs $P(x,y)$ and $Q(x,y)$ of two variable polynomials that simultaneously exhibit small symmetric expansion. Our first result is that such…

Combinatorics · Mathematics 2019-10-15 Yifan Jing , Souktik Roy , Chieu-Minh Tran

Second-order polynomials generalize classical first-order ones in allowing for additional variables that range over functions rather than values. We are motivated by their applications in higher-order computational complexity theory,…

Logic in Computer Science · Computer Science 2023-05-23 Donghyun Lim , Martin Ziegler

In this paper we define the $p$-density of a finite subset $D\subset\ma{N}^r$, and show that it gives a good lower bound for the $p$-adic valuation of exponential sums over finite fields of characteristic $p$. We also give an application:…

Number Theory · Mathematics 2012-10-16 Régis Blache

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…

Number Theory · Mathematics 2018-09-07 Lucas Reis

We prove some sufficient conditions implying $l^p$ inequalities of the form $||x||_p \leq ||y||_p$ for vectors $ x, y \in [0,\infty)^n$ and for $p$ in certain positive real intervals. Our sufficient conditions are strictly weaker than the…

Classical Analysis and ODEs · Mathematics 2011-01-11 Ivo Klemes

In this paper, we consider a family of closed planar algebraic curves $\mathcal{C}$ which are given in parametrization form via a trigonometric polynomial $p$. When $\mathcal{C}$ is the boundary of a compact convex set, the polynomial $p$…

Algebraic Geometry · Mathematics 2013-12-17 Magali Bardet , Térence Bayen

In this paper we will investigate properties of modified q-Euler numbers and polynomials. The main purpose of this paper is to construct p-adic q-Euler measures.

Number Theory · Mathematics 2007-05-23 Hacer Ozden , Y. Simsek , I. N. Cangul , S. H. Rim

Any multilinear non-central polynomial $p$ (in several noncommuting variables) takes on values of degree $n$ in the matrix algebra $M_n(F)$ over an infinite field $F$. The polynomial $p$ is called {\it $\nu$-central} for $M_n(F)$ if $p^\nu$…

Algebraic Geometry · Mathematics 2017-12-05 Alexei Kanel-Belov , Sergey Malev , Louis Rowen