Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Strong Factorial Conjecture

Published 14 Apr 2013 in math.AG and math.AC | (1304.3956v2)

Abstract: In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal L}(fk)=0$ for all $k\geq 1$, then $f=0$, where ${\cal L}$ is the $\C$-linear map from $\C[X_1,...,X_m]$ to $\C$ defined by ${\cal L}(X_1{l_1}... X_m{l_m})=l_1!... l_m!$. The Rigidity Conjecture asserts that a univariate polynomial map $a(X)$ with complex coefficients of degree at most $m+1$ such that $a(X)=X$ mod $X2$, is equal to $X$ if $m$ consecutive coefficients of the formal inverse of $a(X)$ are zero.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.