{"paper":{"title":"Separable discrete functions: recognition and sufficient conditions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Endre Boros, Ondrej Cepek, Vladimir Gurvich","submitted_at":"2017-11-17T23:28:09Z","abstract_excerpt":"A discrete function of $n$ variables is a mapping $g : X_1 \\times \\ldots \\times X_n \\rightarrow A$, where $X_1, \\ldots, X_n$, and $A$ are arbitrary finite sets. Function $g$ is called {\\em separable} if there exist $n$ functions $g_i : X_i \\rightarrow A$ for $i = 1, \\ldots, n$, such that for every input $x_1, \\ldots ,x_n$ the function $g(x_1, \\ldots, x_n)$ takes one of the values $g_1(x_1), \\ldots ,g_n(x_n)$. Given a discrete function $g$, it is an interesting problem to ask whether $g$ is separable or not. Although this seems to be a very basic problem concerning discrete functions, the compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06772","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}