Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

EJC
2006

favoriteEmaildiscussreport

99views Information Technology» more EJC 2006»

Product representations of polynomials

13 years 4 months ago

Product representations of polynomials

Download www.math.ucsd.edu

For a fixed polyomial f Z[X], let k(N) denote the maximum size of a set A {1, 2, . . . , N} such that no product of k distinct elements of A is in the value set of f. In this paper, we determine the asymptotic behaviour of k(N) for a wide class of polynomials. Our results generalize earlier theorems of Erdos, S

Jacques Verstraëte

Real-time Traffic

Distinct Elements | EJC 2006 | EJC 2007 | Fixed Polyomial | Maximum Size |

claim paper

Related Content

» A Case of Depth3 Identity Testing Sparse Factorization and Duality

» Solving nonlinear polynomial systems in the barycentric Bernstein basis

» G2 Tensor Product Splines over Extraordinary Vertices

» Arithmetic Circuits and the Hadamard Product of Polynomials

» On Representations of AlgebraicGeometric Codes for List Decoding

» A Tuttestyle proof of Brylawskis tensor product formula

» Factoring cardinal product graphs in polynomial time

» Distributed Representation of Syntactic Structure by Tensor Product Representation and Non...

» Kleene Theorems for Product Systems

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	EJC
Authors	Jacques Verstraëte

Comments (0)