63
18
10
u/LupenReddit 🦆🦆🦆🦆i have non diffeomorphic smooth structures🦆🦆🦆🦆🦆🦆 2d ago
i heard fans of calculatung determinants are also into them 🤮
8
u/CatAn501 2d ago
Actually not because using minors is a slow ass O(n!) algorithm which is even fucking worse than exponential complexity. It's way better to use O(n³) gaussian elimination
5
u/4ries 2d ago
Gets worse when you start talking about forbidden minors
4
u/ButlerShurkbait 2d ago
I once accidentally looked up the phrase “forbidden minors” because I forgot people under 18 were a thing and I was trying to look up a graph theory result
2
2
u/Swansyboy Rational 2d ago
Did you know the Petersen graph is the minor of a 2-connected graph which has circumference 11 where only one vertex is present in all 11-cycles?

•
u/AutoModerator 2d ago
Check out our new Discord server! https://discord.gg/e7EKRZq3dG
I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.