English
Related papers

Related papers: A universal coefficient theorem for Gauss's Lemma

200 papers

Loeb showed that a natural extension of the usual binomial coefficient to negative (integer) entries continues to satisfy many of the fundamental properties. In particular, he gave a uniform binomial theorem as well as a combinatorial…

Combinatorics · Mathematics 2018-02-09 Sam Formichella , Armin Straub

A Gauss-Lucas theorem is proved for multivariate entire functions, using a natural notion of separate convexity to obtain sharp results. Previous work in this area is mostly restricted to univariate entire functions (of genus no greater…

Complex Variables · Mathematics 2012-10-15 Marek Kanter

Let s and t be variables. Define polynomials {n} in s, t by {0}=0, {1}=1, and {n}=s{n-1}+t{n-2} for n >= 2. If s, t are integers then the corresponding sequence of integers is called a Lucas sequence. Define an analogue of the binomial…

Combinatorics · Mathematics 2009-11-18 Bruce Sagan , Carla Savage

We determine the class of finite T_0-spaces allowing for a universal coefficient theorem computing equivariant KK-theory by filtrated K-theory.

Operator Algebras · Mathematics 2012-02-21 Rasmus Bentmann , Manuel Köhler

It is proved that the roots of the derivative of a polynomial with quaternionic coefficients belong to the union of the intersections of sets defined in terms of certain projections of a polynomial. The result strengthens the quaternion…

Classical Analysis and ODEs · Mathematics 2026-03-03 I. Emizh , A. Guterman

We give a sheaf-theoretic version of the universal coefficient theorem.

Commutative Algebra · Mathematics 2024-10-25 Bruno Kahn

We prove that for every positive integer $k$ there exist an inclusion-exclusion polynomial $Q_{\{q_1,q_2,...,q_k\}}$ with the height at least $c^{2^k}\prod_{j=1}^{k-2}q_j^{2^{k-j-1}-1}$, where $c$ is a positive constant and…

Number Theory · Mathematics 2014-07-15 Bartlomiej Bzdega

Consider a monic polynomial of degree $n$ whose subleading coefficients are independent, identically distributed, nondegenerate random variables having zero mean, unit variance, and finite moments of all orders, and let $m \geq 0$ be a…

Probability · Mathematics 2024-09-12 Matthew C. King , Ashvin Swaminathan

In this short note we have proved an enhanced version of a theorem of Lorentz [1] and its generalization to the multivariate case which gives a non- uniform estimate of degree of approximation by a polynomial with positive coefficients. The…

Classical Analysis and ODEs · Mathematics 2016-11-30 Zhong Guan , Tao Wang

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

Number Theory · Mathematics 2011-10-20 Arnaud Bodin , Mireille Car

Let $p(z)=a_0+a_1z+a_2z^2+a_3z^3+\cdots+a_nz^n$ be a polynomial of degree $n,$ where the coefficients $a_j,$ $j \in \{0,1,2,\cdots n\},$ are real numbers. We impose some restriction on the coefficients and then prove some extensions and…

Complex Variables · Mathematics 2016-09-27 Eze R. Nwaeze

We give explicit upper bounds for coefficients of polynomials appearing in Gauss-Kra\"{i}tchik formula for cyclotomic polynomials. We use a certain relation between elementary symmetric polynomials and power sums polynomials.

Number Theory · Mathematics 2026-03-26 Tomohiro Yamada

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

General Mathematics · Mathematics 2016-10-07 Dhananjay P. Mehendale

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

Number Theory · Mathematics 2014-12-19 Qi-Fei Chen , Victor J. W. Guo

For the family of polynomials in one variable $P:=x^n+a_1x^{n-1}+\cdots +a_n$, $n\geq 4$, we consider its higher-order discriminant sets $\{ \tilde{D}_m=0\}$, where $\tilde{D}_m:=$Res$(P,P^{(m)})$, $m=2$, $\ldots$, $n-2$, and their…

Classical Analysis and ODEs · Mathematics 2023-02-14 Vladimir Petrov Kostov

A Lemma of Riemann--Lebesgue type for Fourier--Jacobi coefficients is derived. Via integral representations of Dirichlet--Mehler type for Jacobi polynomials its proof directly reduces to the classical Riemann--Lebesgue Lemma for Fourier…

Classical Analysis and ODEs · Mathematics 2016-09-06 George Gasper , Walter Trebels

In this article, we offer group-theoretic, field-theoretic, and topological interpretations of the Gaussian binomial coefficients and their sum. For a finite $p$-group $G$ of rank $n$, we show that the Gaussian binomial coefficient…

Group Theory · Mathematics 2021-08-26 Sunil K. Chebolu , Keir Lockridge

Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be ``large.'' For a fixed $\alpha \in \Q - \Z_{<0}$, Filaseta and Lam have shown that the $n$th degree Generalized Laguerre…

Number Theory · Mathematics 2007-05-23 Farshid Hajir

We introduce and study generalized Umemura polynomials $U_{n,m}^{(k)}(z,w;a,b)$ which are a natural generalization of the Umemura polynomials $U_n(z,w;a,b)$ related to Painlev\'e $VI$ equation. We will show that if $a=b$, or $a=0$, or $b=0$…

Combinatorics · Mathematics 2007-05-23 Anatol N. Kirillov , Makoto Taneda

We prove that for every pair of positive integers a, b there exists a number c_0 such that for every c>=c_0 one can find a tame polynomial automorphism of C^3 with multidegree equal to (a,b,c).

Commutative Algebra · Mathematics 2009-04-02 Jakub Zygadło