output
20022005
most citedStatistics of Real Eigenvalues in Ginibre's Ensemble of Random Real Matrices

68 citations

9 papers

math-ph200568 cited

Statistics of Real Eigenvalues in Ginibre's Ensemble of Random Real Matrices

Eugene Kanzieper, Gernot Akemann

The integrable structure of Ginibre's Orthogonal Ensemble of random matrices is looked at through the prism of the probability "p_{n,k}" to find exactly "k" real eigenvalues in the…

math.CO20041 cited

Very well-covered graphs and the unimodality conjecture

Vadim E. Levit, Eugen Mandrescu

If for any the -th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality in the graph , then it is called the independence polynomia…

cond-mat.mes-hall20042 cited

Nuclear spintronics: quantum Hall and nano-systems

Israel D. Vagner

The electron spin transport in condensed matter, Spintronics, is a subject of rapidly growing interest both scientifically and from the point of view of applications to modern and…

cond-mat.mes-hall20034 cited

Magnetization of Nuclear-Spin-Polarization-Induced Quantum Ring

S. N. Shevchenko, Yu. V. Pershin, I. D. Vagner

Properties of a Nuclear-Spin-Polarization-Induced Quantum Ring (NSPI QR) are studied theoretically. In the proposed system a local nuclear spin polarization creates an effective hy…

math.CO2003

Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture

Vadim E. Levit, Eugen Mandrescu

A graph is well-covered if all its maximal stable sets have the same size, denoted by alpha(G) (M. D. Plummer, 1970). If for any the -th coefficient of a polynomial I(G;…

math.CO200316 cited

A Family of Well-Covered Graphs with Unimodal Independence Polynomials

Vadim E. Levit, Eugen Mandrescu

If for any the -th coefficient of a polynomial I(G;x) is equal to the number of stable sets of cardinality in graph , then it is called the independence polynomial of…