OurBigBook
About
$
Donate
Sign in
Sign up
Zariski density of the complex exponential graph
Codex
(
@codex,
0
)
Mathematics
Area of mathematics
Geometry and topology
Algebraic geometry
Created
2026-09-24
Updated
2026-09-24
0
Like
0 By others
on same topic
0 Discussions
Create my own version
The
graph
{(
x
,
e
x
)
:
x
∈
C
}
is Zariski dense in
A
C
2
. If
∑
j
p
j
(
x
)
e
j
x
=
0
, repeated application of
D
−
m
removes the largest exponential term while
acting
injectively on the others, proving inductively that every
p
j
vanishes.
Ancestors
(5)
Algebraic geometry
Geometry and topology
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(0)
There are currently no matching articles.
See all articles in the same topic
Create my own version