ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The question is: how different are the counting sequences of A and B? Is their ratio a constant? Is their ratio a polynomial? What is that polynomial? How close can they be? How different can they be? The domino subclass [Av(132) | Av(231)] (where we also require the whole thing to avoid 1324) is one of the main things used in the proof of the known bounds. Can we prove the inversion conjecture on the domino subclass? 3. Natasha Blitvic and Andrew Elvey-Price Definition: A moment sequence is a sequence (a0 , a1 , . . .) such that there exists a measure µ on R such that Z an = xn dµ(x). R And the sequence is a Stieltjes moment sequence if the support of µ is contained in (0, \infty). R\infty Example: n! = 0 xn e−x dx; so n! is a Stieltjes moment sequence with dµ(x) = e−x dx. Question: When are the counting sequences of a permutation class a moment sequence (or Stiltjes moment sequence)? Conjecture: It is a Stiltjes moment sequence for all principal classes. This conjecture is supported by computational intuition from Elvey-Price and Tony Guttmann, and it is also supported by structural intuition from Blitvic and Steingrı́msson. If you have a Stiltjes moment sequence, then you get surprisingly good lower bounds on the growth rate. (This includes a better lower bound for 1324-avoiders!) Next, define a k-arrangement to be a permutation with a k-coloring of its fixed points. For k = 0, this is interpreted to be a derangement. Let Akn denote the number of k-arrangements of size n. It is a fact that Z \infty k An = xn e−x+(k−1) dx. k−1

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.