All binomial identities are orderable

March 29, 2016 · The Ethereal · 🏛 European journal of combinatorics (Print)

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Dmitry N. Kozlov arXiv ID 1603.08743 Category cs.DM: Discrete Mathematics Cross-listed cs.DC, math.CO Citations 5 Venue European journal of combinatorics (Print) Last Checked 2 months ago
Abstract
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on the round complexity of the weak symmetry breaking task. Furthermore, we introduce the notion of a fundamental binomial identity and find an infinite family of values, other than the prime powers, for which no fundamental binomial identity can exist.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Discrete Mathematics