Nonnegative inverse eigenvalue problem
Which lists of numbers can be the eigenvalues of a square matrix whose entries are all nonnegative?
Which lists of numbers can be the eigenvalues of a square matrix whose entries are all nonnegative?
Given n bases of an n-dimensional space, can their vectors always be rearranged into n new bases, each taking one vector from every original base?
If every vertex of a directed graph points to many others, must the graph contain a correspondingly short directed cycle?
A sufficiently large fractal set is predicted to determine a set of pairwise distances with positive ordinary length.
How densely can identical nonoverlapping spheres fill five-dimensional Euclidean space?
Delete each vertex of a graph in turn and keep the resulting graphs without labels. Does this collection determine the original graph?
How many points in the plane guarantee a convex polygon with a specified number of vertices? The proposed exact threshold remains unproved.
Can every fraction 4/n, with n at least 2, be written as the sum of three reciprocals of positive integers?
Must a prime number occur between n squared and the next integer’s square, however large n becomes?
For a fixed eligible integer, how often do its powers generate every nonzero residue modulo a prime?
Do the independent units of a number field remain independent when measured using p-adic arithmetic?
Does the arithmetic Möbius sequence average to zero against every sequence generated by a system with zero topological entropy?
A set can contain a unit line segment pointing in every direction and still have zero volume. Must it nevertheless have full fractal dimension?
How many triples can a large collection of points contain while never containing all four triples on any four points?
Can every graph without a bridge carry a balanced flow that never vanishes and uses only four positive magnitudes?
Can the edges of any graph be split into only a constant times its number of vertices worth of cycles and individual edges?
The difference between the harmonic series and a logarithm approaches a famous constant. Is that constant a ratio of integers?
Can a power of an integer equal the sum of the same powers of every smaller positive integer, apart from 1 + 2 = 3?
Do prime numbers of the form 2 to a prime exponent, minus 1, continue forever?
Can finding three integers with a specified additive relation be done faster than essentially quadratic time?
Can a fixed Boolean matrix answer a sequence of arriving vectors in truly subcubic total time when each answer is needed before the next vector arrives?
Does the linear-algebraic rank of a Boolean table control how many bits two people must exchange to evaluate an entry?
Given every output of a Boolean function, how hard is it to decide whether a small circuit can produce that table?
Can one exhibit propositional truths whose proofs must be superpolynomially long even in a flexible standard deductive system?