All binomial identities are orderable

DOI10.1016/J.EJC.2016.11.008zbMATH Open1352.05030arXiv1603.08743OpenAlexW2963562770MaRDI QIDQ730270FDOQ730270

Authors: Dmitry N. Kozlov 

Publication date: 27 December 2016

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1603.08743

Recommendations

• scientific article; zbMATH DE number 4099304
• scientific article; zbMATH DE number 4041924
• Binomial identities -- combinatorial and algorithmic aspects
• scientific article; zbMATH DE number 3843753
• Identities in order statistics – from moments to arbitrary distributions

zbMATH Keywords

fundamental binomial identity

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19)

Cites Work

• Matching theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distributed computing through combinatorial topology
• New combinatorial topology bounds for renaming: the upper bound
• Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes
• Upper bound on the complexity of solving hard renaming

Cited In (3)

• Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes
• Structure theory of flip graphs with applications to weak symmetry breaking
• Bounds on the step and namespace complexity of renaming

This page was built for publication: All binomial identities are orderable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730270)