In mathematical programming and polyhedral combinatorics, the Hirsch conjecture is the generally false statement that the edge-vertex graph of an n-facet polytope in d-dimensional Euclidean space has ...
Vu graduated at the E?tv?s University, Budapest, in 1994, his M.Sc. thesis supervisor was Tamás Sz?nyi. He received his Ph.D. at Yale University, in 1998 under the direction of László Lovász (a ...
Tao was a child prodigy, one of the subjects in the longitudinal research on exceptionally gifted children by education researcher Miraca Gross. His father told the press that at the age of two, durin ...
In probability theory, more specifically the study of random matrices, the circular law describes the distribution of eigenvalues of an n × n random matrix with independent and identically distribute ...
A knot is an embedding of the circle (S1) into three-dimensional Euclidean space (E3). Two knots are defined to be equivalent if there is an ambient isotopy between them.Tame vs. wild knots A polygona ...
Gromov's style of geometry features a "coarse" or "soft" viewpoint, often analyzing asymptotic or large-scale properties.His impact has been felt most heavily in geometric group theory, where he chara ...
Daniel Alan Spielman (born March 1970, Philadelphia, Pennsylvania) has been a professor of Applied Mathematics and Computer Science at Yale University since 2006. In October 2012 he was named a recipi ...
Marcus completed his undergraduate studies at the Washington University in St. Louis. He later completed his doctoral studies under the supervision of Prasad Tetali at the Georgia Institute of Technol ...
Open problems 1/3–2/3 conjectureabc conjecture (proof claimed by Shinichi Mochizuki)Andrews–Curtis conjectureAngel problem (several proofs claimed in 2007)Agoh–Giuga conjectureAndrica's conjectureA ...
Let C be a Jordan curve. A polygon P is inscribed in C if all vertices of P belong to C. The inscribed square problem asks:Does every Jordan curve admit an inscribed square?It is not required that the ...
A lattice arrangement (commonly called a regular arrangement) is one in which the centers of the spheres form a very symmetric pattern which only needs n vectors to be uniquely defined (in n-dimension ...
The generalized star-height problem in formal language theory is the open question whether all regular languages can be expressed using generalized regular expressions with a limited nesting depth of ...
Let Γ be a second countable locally compact group (for instance a countable discrete group). One can define a morphism\mu\colon RK^\Gamma_*(\underline{E\Gamma}) \to K_*(C^*_\lambda(\Gamma)),called th ...
In algebra the Dixmier conjecture, asked by Dixmier (1968, problem 1), is the conjecture that any endomorphism of a Weyl algebra is an automorphism.Tsuchimoto (2005), and independently Belov-Kanel Ko ...
Abelian by cyclic groups resulting in Moufang loops Let L be a Moufang loop with normal abelian subgroup (associative subloop) M of odd order such that L/M is a cyclic group of order bigger than 3. (i ...
