Decomposition Lemmas
Discrete Mathematics
2013-06-11 v1 Combinatorics
Abstract
We define two recursive functions obtained by decomposition of a given interval into four close parts and prove two lemmas which determine features of these functions.
Keywords
Cite
@article{arxiv.1306.1857,
title = {Decomposition Lemmas},
author = {Mark Korenblit and Vadim E. Levit},
journal= {arXiv preprint arXiv:1306.1857},
year = {2013}
}
Comments
18 pages