Entry Ekhad:1993:SEE from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Ekhad:1993:SEE,
author = "Shalosh B. Ekhad",
title = "A short, elementary, and easy, {WZ} proof of the
{Askey-Gasper} inequality that was used by {de Branges}
in his proof of the {Bieberbach} conjecture",
journal = j-THEOR-COMP-SCI,
volume = "117",
number = "1--2",
pages = "199--202",
day = "30",
month = aug,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:30 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=117&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=117&issue=1-2&aid=1421",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
conflocation = "Bordeaux, France; 2-5 May 1991",
conftitle = "Conference on Formal Power Series and Algebraic
Combinatorics",
corpsource = "Dept. of Math., Temple Univ., Philadelphia, PA, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "Askey-Gasper inequality; Bieberbach conjecture;
combinatorial mathematics; formal power series; series
(mathematics); WZ proof",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- B0250,
71(1)133,
75(3)311,
79(1)179,
91(1)119,
92(2)227,
92(2)291,
94(2)261,
95(2)307,
99(2)231,
100(1)243,
110(1)79,
110(1)197,
115(2)359,
117(1)3,
117(1)23,
117(1)45,
117(1)67,
117(1)99,
117(1)137,
117(1)169,
117(1)227,
117(1)243,
117(1)273,
117(1)289,
117(1)z,
119(2)331,
123(1)89,
123(1)145,
123(2)351,
123(2)377,
124(2)329,
127(2)395,
129(2)385,
132(1)209,
132(1)337,
134(1)87,
134(2)455
- conjecture,
71(1)29,
81(1)155,
83(2)337,
88(2)365,
89(2)207,
95(2)187,
104(2)161,
123(1)21,
129(2)309,
132(1)427
- easy,
74(2)217,
74(2)249,
121(1)71
- elementary,
70(1)3,
71(1)133,
77(3)267,
79(1)37,
88(1)139,
94(1)141,
95(1)97,
96(1)3,
96(1)z,
100(2)385,
108(1)119,
121(1)351,
132(1)229,
135(2)361
- power,
70(1)159,
71(1)47,
73(2)177,
74(2)163,
79(1)3,
79(1)25,
79(1)163,
79(1)179,
79(1)195,
79(1)209,
79(1)257,
79(1)263,
80(1)1,
80(1)35,
80(2)125,
80(2)337,
81(2)269,
81(2)305,
83(2)261,
83(2)301,
85(1)171,
88(2)231,
92(2)269,
93(1)1,
93(1)43,
93(2)265,
98(1)27,
98(1)53,
98(1)99,
98(1)z,
98(2)163,
98(2)249,
99(2)291,
99(2)327,
101(1)35,
101(1)143,
108(1)3,
108(2)385,
109(1)7,
110(1)131,
111(1)59,
111(1)z,
112(2)291,
113(1)75,
114(1)119,
114(2)201,
115(2)191,
115(2)359,
116(1)33,
116(1)95,
117(1)39,
117(1)113,
117(1)131,
117(1)169,
117(1)289,
117(1)z,
127(1)171,
134(2)545,
136(1)21
- short,
121(1)1
- used,
79(1)111