English
Related papers

Related papers: Principal specializations of Schubert polynomials,…

200 papers

Let S be a principally embedded sl_2 subalgebra in sl_n for n > 2. A special case of results of the third author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite-dimensional irreducible sl_n…

Representation Theory · Mathematics 2020-05-12 Alexander Heaton , Songpon Sriwongsa , Jeb F. Willenbring

Let $\mathcal{F}_n$ be the set of unitary polynomials of degree $n \ge 2$ that have their roots in $\mathbb{Z}^*$. We note $$ Q(x) := x^n+a_{1}x^{n-1}+\dots+a_{n}. $$ We show that any two fixed consecutive coefficients $(a_{j},a_{j+1})$ ($j…

Number Theory · Mathematics 2019-11-04 Patrick Letendre

A class of second order difference (discrete) operators with a partial algebraization of the spectrum is introduced. The eigenfuncions of the algebraized part of the spectrum are polinomials (discrete polinomials). Such difference operators…

Condensed Matter · Physics 2009-10-28 P. B. Wiegmann , A. V. Zabrodin

We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…

Dynamical Systems · Mathematics 2016-03-18 Todor Bilarev , Magnus Aspenberg , Dierk Schleicher

We show that $d$-variate polynomials of degree $R$ can be represented on $[0,1]^d$ as shallow neural networks of width $2(R+d)^d$. Also, by SNN representation of localized Taylor polynomials of univariate $C^\beta$-smooth functions, we…

Machine Learning · Statistics 2022-09-07 Aleksandr Beknazaryan

Let H(N) denote the set of all polynomials with positive integer coefficients which have their zeros in the open left half-plane. We are looking for polynomials in H(N) whose largest coefficients are as small as possible and also for…

Complex Variables · Mathematics 2013-08-02 Albrecht Boettcher

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

Combinatorics · Mathematics 2020-05-07 Olga Polverino , Ferdinando Zullo

In 2013, Pak and Panova proved the strict unimodality property of $q$-binomial coefficients $\binom{\ell+m}{m}_q$ (as polynomials in $q$) based on the combinatorics of Young tableaux and the semigroup property of Kronecker coefficients.…

Symbolic Computation · Computer Science 2023-09-04 Christoph Koutschan , Ali K. Uncu , Elaine Wong

Suppose $q$ is a prime power and $f\in\mathbb{F}_q[x]$ is a univariate polynomial with exactly $t$ monomial terms and degree $<q-1$. To establish a finite field analogue of Descartes' Rule, Bi, Cheng, and Rojas (2013) proved an upper bound…

Number Theory · Mathematics 2016-07-07 Qi Cheng , Shuhong Gao , J. Maurice Rojas , Daqing Wan

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

Combinatorics · Mathematics 2022-03-01 Tristram Bogart , Juan Andrés Valero

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

Information Theory · Computer Science 2013-08-28 Pingzhi Yuan , Cunsheng Ding

Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and…

Number Theory · Mathematics 2025-09-16 Thian Tromp

Permutation polynomials over finite fields have extensive applications in various areas. Particularly, permutation polynomials with simple forms are of great interest. In recent papers, several classes of permutation polynomials of the form…

Number Theory · Mathematics 2025-12-29 Xuan Pang , Danyao Wu , Pingzhi Yuan

We show that a specialization in Weyl character formula can be carried out in such a way that its right-hand side becomes simply a Schur Function. For this, we need the use of fundamental weights. In the generic definition, an Elementary…

Mathematical Physics · Physics 2007-05-23 Hasan R. Karadayi

Gelfand-Tsetlin polytopes are classical objects in algebraic combinatorics arising in the representation theory of $\mathfrak{gl}_n(\mathbb{C})$. The integer point transform of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ projects to…

Combinatorics · Mathematics 2019-03-28 Ricky Ini Liu , Karola Mészáros , Avery St. Dizier

Let S be a finite subset of a field. For multivariate polynomials the generalized Schwartz-Zippel bound [2], [4] estimates the number of zeros over Sx...xS counted with multiplicity. It does this in terms of the total degree, the number of…

Number Theory · Mathematics 2010-01-05 Olav Geil , Casper Thomsen

Regular semisimple Hessenberg varieties are a family of subvarieties of the flag variety that arise in number theory, numerical analysis, representation theory, algebraic geometry, and combinatorics. We give a "Giambelli formula" expressing…

Algebraic Geometry · Mathematics 2011-08-31 Dave Anderson , Julianna Tymoczko

The aim of this survey is to outline the state of the art in research on a class of linearized polynomials with coefficients over finite fields, known as scattered polynomials. These have been studied in several contexts, such as in [A.…

History and Overview · Mathematics 2025-10-08 Giovanni Longobardi

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

We show that univariate trinomials $x^n + ax^s + b \in \mathbb{F}_q[x]$ can have at most $\delta \Big\lfloor \frac{1}{2} +\sqrt{\frac{q-1}{\delta}} \Big\rfloor$ distinct roots in $\mathbb{F}_q$, where $\delta = \gcd(n, s, q - 1)$. We also…

Number Theory · Mathematics 2016-12-09 Zander Kelley , Sean Owen