15 problems
- 0 votes0 replies0 views
Anstee–Sali conjecture on forbidden configuration growth
Let be a matrix with . Let be the identity matrix, its (0,1)-complement, and the…
- 0 votes0 replies0 views
The forbidden-configuration bound for binary matrices
Let be given, and let denote the maximum number of columns in an -rowed binary matrix avoiding the configuration …
- 0 votes0 replies0 views
Anstee–Sali conjecture on extremal numbers for forbidden matrices
Anstee–Sali conjecture. The extremal number for is governed by a product construction using singleton, cosingleton, and chain factors.
- 0 votes0 replies0 views
Forbidden-configuration product conjecture for simple matrices
Let be a simple -matrix. A product of matrices is obtained by stacking, in order, one column from each factor; the factors here are identity matrices ,…
- 0 votes0 replies0 views
The general equality conjecture for and
General equality conjecture.
- 0 votes0 replies0 views
The equality conjecture for and
Let and denote the two quantities defined in the paper for integers . Equality conjecture. … Consequently, the paper's forbidden-configuration function…
- 0 votes0 replies0 views
Anstee–Sali conjecture for forbidden configurations
Let be a family of subsets, and let be its incidence matrix. For a binary matrix , write for the associate…
- 0 votes0 replies0 views
Anstee–Raggi monotonicity conjecture for forbidden configurations
Anstee–Raggi monotonicity conjecture. For sufficiently large ,
- 0 votes0 replies0 views
Frankl–Füredi special simplex conjecture
The special -dimensional simplex is a hypergraph consisting of sets such that … for every , and the sets…
- 0 votes0 replies1 view
Nonexistence conjecture for 5-rowed minimal cubic configurations
A minimal cubic configuration is a minimal configuration associated with the cubic forbidden-configuration problem; a configuration is minimal when deleting any row or column destr…
- 0 votes0 replies0 views
The forbidden Berge hypergraph conjecture for the 4-cycle
Forbidden Berge hypergraph conjecture for the 4-cycle.
- 0 votes0 replies0 views
Asymptotic maximality of the modular middle-layer family
Let be a family of subsets with for all . For , let be th…
- 0 votes0 replies0 views
NP-hardness of determining the Anstee–Sali exponent
Let be a configuration and let be the exponent defined by the Anstee–Sali product construction. Anstee's NP-hardness conjecture. Determining from is NP-hard.…
- 0 votes0 replies0 views
Infinite induced-system freeness conjecture
Let be a possibly infinite set of systems of induced equations, and let a Boolean function be -free when it contains no induced solution of any system in…
- 0 votes0 replies0 views
Shapira's infinite forbidden-systems conjecture
Let be a possibly infinite set of induced systems of linear equations. A Boolean function is…