Results 1  10
of
27
How many zeros of a random polynomial are real
 Bull. Amer. Math. Soc. (N.S
, 1995
"... Abstract. We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real zeros is simply the length of the moment curve (1, t, ..."
Abstract

Cited by 46 (0 self)
 Add to MetaCart
Abstract. We provide an elementary geometric derivation of the Kac integral formula for the expected number of real zeros of a random polynomial with independent standard normally distributed coefficients. We show that the expected number of real zeros is simply the length of the moment curve (1, t,..., t n) projected onto the surface of the unit sphere, divided by π. The probability density of the real zeros is proportional to how fast this curve is traced out. We then relax Kac’s assumptions by considering a variety of random sums, series, and distributions, and we also illustrate such ideas as integral geometry and the FubiniStudy metric. Contents 1.
Annular noncrossing permutations and partitions, and secondorder asymptotics for random matrices
 INT. MATH. RES. NOT
, 2004
"... ..."
Irreducible Symmetric Group Characters of Rectangular Shape
, 2002
"... this paper we give a new formula for the values of the character . Let be a partition of k n, and let (; 1 ) be the partition obtained by adding n k 1's to . Thus (; 1 ) ` n. De ne the normalized character ) by (n) k where ) denotes the dimension of the character ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
this paper we give a new formula for the values of the character . Let be a partition of k n, and let (; 1 ) be the partition obtained by adding n k 1's to . Thus (; 1 ) ` n. De ne the normalized character ) by (n) k where ) denotes the dimension of the character and (n) k = n(n 1) (n k + 1). Thus [5, (7.6)(ii)][8, p. 349] ) is the number f of standard Young tableaux of shape . Identify with its diagram f(i; j) : 1 j i g, and regard the points (i; j) 2 as squares (forming the Young diagram of ). We write diagrams in \English notation," with the rst coordinate increasing from top to bottom and the second coordinate from left to right. Let = ( 1 ; 2 ; : : :) and = ( 1 ; 2 ; : : :), where is the Partially supported by NSF grant #DMS9988459 and by the Isaac Newton Institute for Mathematical Sciences. conjugate partition to . The hook length of the square u = (i; j) 2 is de ned by h(u) = i + j i j + 1; and the FrameRobinsonThrall hook length formula [5, Exam. I.5.2][8, Cor. 7.21.6] states that n! Q u2 h(u) : For w 2 S n let (w) denote the number of cycles of w (in the disjoint cycle decomposition of w). The main result of this paper is the following
An Effective Implementation of Kopt Moves for the LinKernighan TSP
 Roskilde University, 2007. Case
, 2006
"... Local search with kchange neighborhoods, kopt, is the most widely used heuristic method for the traveling salesman problem (TSP). This report presents an effective implementation of kopt for the LinKernighan TSP heuristic. The effectiveness of the implementation is demonstrated with extensive ex ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
Local search with kchange neighborhoods, kopt, is the most widely used heuristic method for the traveling salesman problem (TSP). This report presents an effective implementation of kopt for the LinKernighan TSP heuristic. The effectiveness of the implementation is demonstrated with extensive experiments on instances ranging from 10,000 to 10,000,000 cities. 1.
Connection coefficients, matchings, maps and combinatorial conjectures for Jack symmetric functions
 TRANS. AMER. MATH. SOC
, 1996
"... A power series is introduced that is an extension to three sets of variables of the Cauchy sum for Jack symmetric functions in the Jack parameter α. We conjecture that the coefficients of this series with respect to the power sum basis are nonnegative integer polynomials in b, the Jack parameter sh ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
A power series is introduced that is an extension to three sets of variables of the Cauchy sum for Jack symmetric functions in the Jack parameter α. We conjecture that the coefficients of this series with respect to the power sum basis are nonnegative integer polynomials in b, the Jack parameter shifted by 1. More strongly, we make the MatchingsJack Conjecture, that the coefficients are counting series in b for matchings with respect to a parameter of nonbipartiteness. Evidence is presented for these conjectures and they are proved for two infinite families. The coefficients of a second series, essentially the logarithm of the first, specialize at values 1 and 2 of the Jack parameter to the numbers of hypermaps in orientable and locally orientable surfaces, respectively. We conjecture that these coefficients are also nonnegative integer polynomials in b, andwemake the HypermapJack Conjecture, that the coefficients are counting series in b for hypermaps in locally orientable surfaces with respect to a parameter of nonorientability.
All invariant moments of the Wishart distribution
, 2004
"... In this paper, we compute moments of a Wishart matrix variate U of the form E(Q(U)) where Q(u) is a polynomial with respect to the entries of the symmetric matrix u, invariant in the sense that it depends only on the eigenvalues of the matrix u. This gives us in particular the expectedvalue of any ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In this paper, we compute moments of a Wishart matrix variate U of the form E(Q(U)) where Q(u) is a polynomial with respect to the entries of the symmetric matrix u, invariant in the sense that it depends only on the eigenvalues of the matrix u. This gives us in particular the expectedvalue of any power of the Wishart matrix U or its inverse U1. For our proofs, we do not rely on traditional combinatorial methods but rather on the interplay between two bases of the space of invariant polynomials in U. This means that all moments can be obtainedthrough the multiplication of three matrices with known entries. Practically, the moments are obtainedby computer with an extremely simple Maple program.
Spiked Models in Wishart Ensemble
"... Great thanks are due to my advisor, Mark Adler, for his guidance and support throughout my development as a research mathematician, and particularly the process of producing this thesis. He has helped me in forming the big picture of mathematics and even helped me in details like the proof reading o ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
Great thanks are due to my advisor, Mark Adler, for his guidance and support throughout my development as a research mathematician, and particularly the process of producing this thesis. He has helped me in forming the big picture of mathematics and even helped me in details like the proof reading of this thesis. I also thank Jinho Baik for information on related literature, Ira Gessel for help in combinatorial, and Pierre van Moerbeke for the course in random matrix. Among graduate peers, HsinHong Lai not only elucidates algebraic geometry to me from his erudition, but also set a model of persistence, devotion to mathematics, and a healthy dose of idealism; Junbo Wang and ChaoJen Wang, who are also my roommates, chat a lot with me on every topic, and particular to Junbo who takes me shopping with his car; Alex Chris taught me a lot about the English language; others who helped me in some way are too many to mention. I thank them all. The understanding of my family is crucial for my graduate study abroad. At last, I am grateful to Sha Liu, my fiancée, whose support and encouragement are never in short supply.