Papers
Topics
Authors
Recent
Search
2000 character limit reached

Determinants, Choices and Combinatorics

Published 26 Mar 2018 in math.CO | (1803.09554v2)

Abstract: We prove a formula which generalizes both Onn's colorful determinantal formula, related to Rota's basis conjecture, and Svrtan's $n!$ formula, related to the Atiyah-Sutcliffe problem. In some cases, our formula allows us to prove some results similar in spirit to the statement of Rota's basis conjecture. We prove such a result using Svrtan's $n!$ formula, generalizing one of Svrtan's arguments to a combinatorial setting.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.