Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A ternary Permutation-CSP is specified by a subset @P of the symmetric group S"3. An instance of such a problem consists of a set of variables V and a multiset of constraints, which are ordered triples of distinct variables of V. The objective is to find a linear ordering @a of V that maximizes the number of triples whose rearrangement (under @a) follows a permutation in @P.  prove that every ternary Permutation-CSP parameterized above average has a kernel with a quadratic number of variables.
['Gregory Gutin', 'Leo van Iersel', 'Matthias Mnich', 'Anders Yeo']
I am writing a research paper on a idea Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables
[{"from": "human", "value": "I am writing a research paper on a idea Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A ternary Permutation-CSP is specified by a subset @P of the symmetric group S\"3. An instance of such a problem consists of a set of variables V and a multiset of constraints, which are ordered triples of distinct variables of V. The objective is to find a linear ordering @a of V that maximizes the number of triples whose rearrangement (under @a) follows a permutation in @P.  prove that every ternary Permutation-CSP parameterized above average has a kernel with a quadratic number of variables."}]