185 problems
- 0 votes0 replies0 views
Macdonald's positivity conjecture for modified Macdonald polynomials
Let be the coefficients obtained by expanding the modified Macdonald polynomial in a shifted Schur basis. Macdonald's positivity conjecture. The coefficients…
- 0 votes0 replies0 views
Bannai–Ito conjecture on large-diameter primitive distance-regular graphs
A primitive distance-regular graph is a distance-regular graph with no nontrivial equivalence relation coming from an imprimitive association scheme. Bannai–Ito conjecture. Any pri…
- 0 votes0 replies1 view
Alon–Tarsi conjecture on the parity of Latin squares
Let be a Latin square of order , and define its sign by the product of the signs of its row and column permutations. Let and denote the numbers of even and odd L…
- 0 votes0 replies1 view
Schur's conjecture that every S-ring is schurian
Let be a finite group and let an -ring over be a subring of that is a free -module spanned by a partition of closed under taking inverses a…
- 0 votes0 replies2 views
Mulmuley's \P conjecture for plethysm and Kronecker coefficients
Mulmuley's conjecture. These constants belong to .
- 0 votes0 replies1 view
Kohnert's diagrammatic interpretation conjecture for Schubert polynomials
Let Schubert polynomials be the polynomial family associated with permutations. Kohnert conjectured that each Schubert polynomial admits a generating-polynomial interpretation in t…
- 0 votes0 replies0 views
Kerov's positivity conjecture for character polynomials
For each permutation , let be the universal Kerov character polynomial defined by … For a cycle of length , write for the corresponding polynomial. Kerov's…
- 0 votes0 replies1 view
The Alon–Jaeger–Tarsi conjecture
Let be a field, let be a nonsingular matrix over , and let be a vector over . Alon–Jaeger–Tarsi conjecture. For any field …
- 0 votes0 replies0 views
Godsil's edge-connectivity conjecture for colour classes in association schemes
Godsil's conjecture. If is a connected graph which is a colour class in an association scheme, then
- 0 votes0 replies0 views
Diameter-boundedness conjecture for tight distance-regular graphs
Diameter-boundedness conjecture. The diameter of is bounded by a function in .
- 0 votes0 replies0 views
Diaconis–Eriksson conjecture on the generation degree of Birkhoff polytope ideals
Diaconis–Eriksson conjecture. The ideals of the Birkhoff polytopes are generated in degree .
- 0 votes0 replies0 views
Stahl's real-rootedness conjecture for genus polynomials
Stahl's conjecture. Every genus polynomial is real-rooted.
- 0 votes0 replies0 views
Koolen–Bang classification conjecture for geometric distance-regular graphs
Let be a fixed integer. A geometric distance-regular graph has diameter and intersection number . Koolen–Bang's classification conjecture. Any geo…
- 0 votes0 replies0 views
Bang–Koolen's classification conjecture for geometric distance-regular graphs
Bang–Koolen's classification conjecture. Any such graph is a Johnson graph, a Hamming graph, a Grassmann graph, a bilinear forms graph, or has a number of vertices bounded by a fun…
- 0 votes0 replies0 views
Dvir–Gopi rich-lines conjecture
Let , and let be a set of points. Write for the set of lines incident to at least points of…
- 0 votes0 replies1 view
The diagonal-harmonics Frobenius conjecture
Let be the space of diagonal harmonics, and let denote its Frobenius image. Let be the th elementary symmetric function, … and…
- 0 votes0 replies0 views
Lee's tridiagonal relations conjecture for circular Hessenberg systems
Lee's tridiagonal relations conjecture. If is circular, then there exist scalars such that
- 0 votes0 replies1 view
Buch's generation conjecture for stable Grothendieck polynomials
Let denote the stable Grothendieck polynomial indexed by a partition , and let and denote the elements indexed by the one-row and one-col…
- 0 votes0 replies0 views
Brouwer's vertex-connectivity conjecture for colour classes in association schemes
Brouwer's conjecture. The vertex-connectivity of equals its degree:
- 0 votes0 replies1 view
Convergence conjecture for the Temperley–Lieb algebra rewriting system
Convergence conjecture. This rewriting system is convergent, meaning that it is terminating and confluent.
- 0 votes0 replies0 views
Cameron's conjecture on strongly-regular graphs with Latin square parameters
Let a strongly-regular graph have Latin square or negative Latin square parameters, and suppose that its subconstituents are strongly regular. Cameron's conjecture. These are the o…
- 0 votes0 replies0 views
Monical–Tokcan–Yong's saturated Newton polytope conjecture
Let a polynomial have saturated Newton polytope (SNP) if its support is M-convex and its Newton polytope contains no lattice points other than those in its support. Monical–Tokcan–…
- 0 votes0 replies0 views
The Lorentzianity conjecture for homogenized Grothendieck polynomials
Grothendieck polynomials are multivariate polynomials associated to permutations . Their homogenization is obtained by introducing an additional homogeniz…
- 0 votes0 replies0 views
Toida's CI-digraph conjecture for unit circulant digraphs
A unit circulant digraph of order is a Cayley digraph , where is the set of units in . Toida's conjecture…
- 0 votes0 replies0 views
Fomin–Shapiro conjecture for the totally nonnegative unipotent link
Let be the unipotent radical of a Borel subgroup in a semisimple, simply connected algebraic group defined and split over . The totally nonnegative part of the link…