Bounded combinatorial dimension along an admissible subsequence
Statement
Let be a field and let be a finite-dimensional -vector space. An infinite sequence is admissible if all its truncations are admissible; for an admissible sequence , write for the module associated to the -th term of an infinite subsequence of , and let denote combinatorial dimension. Bounded combinatorial-dimension conjecture. If is sufficiently large, then there exist an integer , an infinite admissible sequence , and an infinite subsequence of such that
for every . The conjecture predicts a uniformly bounded combinatorial dimension along a suitable infinite admissible subsequence; its status is not resolved in the supplied source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.