Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

The number of maximal green sequences can never be obtained if the quiver isn't of finite type #10

Open
iajoiner opened this issue Feb 8, 2018 · 0 comments

Comments

@iajoiner
Copy link
Owner

iajoiner commented Feb 8, 2018

In the tame case we should be able to use Brustle-Dupont-Perotin and Hermes-Igusa to solve the problem (no gap/fixed gap theorems).

In the wild case we should simply use Brustle-Dupont-Perotin and use an empirical upper bound of the length of MGSes by assuming the fixed gaps conjecture.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant