相关论文: Pivotal decomposition schemes inducing clones of o…
We extend the well-known Shannon decomposition of Boolean functions to more general classes of functions. Such decompositions, which we call pivotal decompositions, express the fact that every unary section of a function only depends upon…
Function clones are sets of functions on a fixed domain that are closed under composition and contain the projections. They carry a natural algebraic structure, provided by the laws of composition which hold in them, as well as a natural…
There are continuum many clones on a three-element set even if they are considered up to \emph{homomorphic equivalence}. The clones we use to prove this fact are clones consisting of \emph{self-dual operations}, i.e., operations that…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
We determine all majority operations on a four-element set that generate a minimal clone.
We exhibit a way of "forcing a functional to be an effective operation" for arbitrary partial combinatory algebras (pcas). This gives a method of defining new pcas from old ones for some fixed functional, where the new partial functions can…
Action operads and cloning systems are, respectively, the main ingredients in two approaches for axiomatically constructing Thompson-like groups due to Thumann and Witzel-Zaremsky. In this paper, we prove that action operads are equivalent…
We introduce "fractalization", a procedure by which spin models are extended to higher-dimensional "fractal" spin models. This allows us to interpret type-II fracton phases, fractal symmetry-protected topological phases, and more, in terms…
We prove a conjecture of Crapo and Penne which characterizes isotopy classes of skew configurations with spindle-structure. We use this result in order to define an invariant, spindle-genus, for spindle-configurations. We also slightly…
Decomposable dependency models and their graphical counterparts, i.e., chordal graphs, possess a number of interesting and useful properties. On the basis of two characterizations of decomposable models in terms of independence…
We study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…
The C-minor partial orders determined by the clones generated by a semilattice operation (and possibly the constant operations corresponding to its identity or zero elements) are shown to satisfy the descending chain condition.
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple…
The clones of Boolean functions are classified in regard to set-reconstructibility via a strong dichotomy result: the clones containing only affine functions, conjunctions, disjunctions or constant functions are set-reconstructible, whereas…
A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…
No-Cloning and No-Deleting theorems are verified with the constraint on local state transformations via the existence of incomparable states. Assuming the existence of exact cloning or deleting operation defined on a minimum number of two…
We give a full description of all sets of functions on the group $(\mathbb{ Z}_p, +)$ of prime order which are closed under the composition with the clone generated by $+$ from both sides. Thereby, we also get a description of all iterative…
A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the pi-calculus,…
Programmers often reuse code from source code repositories to reduce the development effort. Code clones are candidates for reuse in exploratory or rapid development, as they represent often repeated functionality in software systems. To…
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…