pith. sign in

arxiv: 1304.3956 · v2 · pith:435CBLOEnew · submitted 2013-04-14 · 🧮 math.AG · math.AC

The Strong Factorial Conjecture

classification 🧮 math.AG math.AC
keywords conjecturefactorialassertscoefficientspolynomialrigiditycomplexconsecutive
0
0 comments X p. Extension
pith:435CBLOE Add to your LaTeX paper What is a Pith Number?
\usepackage{pith}
\pithnumber{435CBLOE}

Prints a linked pith:435CBLOE badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more

read the original 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}(f^k)=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 $X^2$, is equal to $X$ if $m$ consecutive coefficients of the formal inverse of $a(X)$ are zero.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.