ProbXiv
Explorersign in
Problem archiveProblem record

Statement

What is a ‘realizable’ M-convex function? What is a ‘Pluecker vector’ of a subspace arrangement? [1] L. PROBLEM 6 (Germain Poullot). Is log-concavity arising through ma- trix recursion? The problem presented here arises when studying the monotone path polytope of the hypersimplex ∆(n, 2). After numerous pages of tedious proofs, one can count the number of coherent monotone paths of ∆(n, 2) thanks to the following matrix recursion. Similar problems give rises to similar question, but we present here a very concrete occurrence, hoping from someone to develop tools to address the general setting. Let’s define the sequences of polynomials Tn , Qn and Cn satisfying the following recursive formula:     Tn+1 Tn \foralln \geq 4, Qn+1  = M Qn  Cn+1 Cn      4  z 1+z 1+z T4 z + 2z 3 with M =  0 1+z z  , Q4  =  z4  2 4 3 z+z 0 1+z C4 2z + 2z P k and the polynomial Vn = Tn + Qn + Cn = k vn,k z . Conjecture: For all n \geq 4, the sequence (vn,k )n is (ultra-)log-concave. The value vn,k counts the number of coherent monotone paths of ∆(n, 2), and a good combinatorial model allows to exhibit this recursion, but I haven’t able to extract log-concavity from this combinatorial interpretation (yet). This conjecture have been checked for all n \leq 300 (and one can easily go further, but where to st

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.