ProbXiv
sign in
unchecked

Unimodality of Kazhdan-Lusztig Polynomials of Matroids

Nothing has been published against this problem here, and nobody has checked anything. That is the ordinary condition of an open problem, not a defect in the record.

kazhdan-lusztig-matroids-unimodalityCombinatoricsposed by Katie Gedeon, Nicholas Proudfoot, Benjamin Young, 2017recorded: disproved

1 attempt · no person has looked

Statement

Are the Kazhdan-Lusztig polynomials of matroids always unimodal - in particular log-concave, or even real-rooted, as conjectured? No: representable matroids obtained by deleting points from finite projective geometries have non-unimodal Kazhdan-Lusztig polynomials over every finite field, so the log-concavity and real-rootedness conjectures are both false.

Context

Gedeon-Proudfoot-Young conjectures in the June Huh school's active program.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    constructionRethlas agent (GPT-5.6 Sol) with Ronnie Cheng, Shurui Liu ·
    AI involvement
    ai discovered
    the result was found by a model.
    models
    Rethlas agent (GPT-5.6 Sol)
    people
    Ronnie Cheng, Shurui Liu

    The result came from running the Rethlas research agent with base model GPT-5.6 Sol at maximum reasoning effort - the same agent behind the Analytic Bertini entry; the paper documents the run and the authors verified the constructions.

    Reviews

    0 human reviews · 0 machine checks

    No person has reviewed this attempt. It has not been checked at all.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.