Related papers: Functional Clones and Expressibility of Partition …
Physical Unclonable Functions evaluate manufacturing variations to generate secure cryptographic keys for embedded systems without secure key storage. It is explained how methods from coding theory are applied in order to ensure reliable…
We characterize when the level sets of a continuous quasi-monotone functional defined on a suitable convex subset of a normed space can be uniquely represented by a family of bounded continuous functionals. Furthermore, we investigate how…
We propose learning flexible but interpretable functions that aggregate a variable-length set of permutation-invariant feature vectors to predict a label. We use a deep lattice network model so we can architect the model structure to…
Functorial semi-norms are semi-normed refinements of functors such as singular (co)homology. We investigate how different types of representability affect the (non-)triviality of finite functorial semi-norms on certain functors or classes.…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
The application of code clone technology accelerates code search, improves code reuse efficiency, and assists in software quality assessment and code vulnerability detection. However, the application of code clones also introduces software…
In a previous paper: A. Paszkiewicz, T. Sobieszek, Additive Entropies of Partitions, we have given a description of additive partition entropies that is real functions $I$ on the set of finite partitions that are additive on stochastically…
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite discrete-time dynamical systems. Endowed with the direct sum and product, functional digraphs form a…
Assuming a cloning oracle, satisfiability, which is an NP complete problem, is shown to belong to $BPP^C$ and $BQP^C$ (depending on the ability of the oracle C to clone either a binary random variable or a qubit). The same result is…
The pseudospherical functions on one-sheet, two-dimensional hyperboloid are discussed. The simplest method of construction of these functions is introduced using the Fock space structure of the representation space of the su(1,1) algebra.…
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…
Starting from an extension of the Poisson bracket structure and Kubo-Martin-Schwinger-property of classical statistical mechanics of continuous systems to spin systems, defined on a lattice, we derive a series of, as we think, new and…
For given non-negative real numbers $\alpha_k$ with $ \sum_{k=1}^{m}\alpha_k =1$ and normalized analytic functions $f_k$, $k=1,\dotsc,m$, defined on the open unit disc, let the functions $F$ and $F_n$ be defined by $…
Lattice scalar field theories encounter a sign problem when the coupling constant is complex. This is a close cousin of the real-time sign problems that afflict the lattice Schwinger-Keldysh formalism, and a more distant relative of the…
This study presents miscellaneous properties of pseudo-factorials, which are numbers whose recurrence relation is a twisted form of that of usual factorials. These numbers are associated with special elliptic functions, most notably, a…
Functional decomposition is a powerful tool for systems analysis because it can reduce a function of arbitrary input dimensions to the sum and superposition of functions of a single variable, thereby mitigating (or potentially avoiding) the…
Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little…
In this paper, we study uniqueness problems for an entire function that shares small functions of finite order with their difference operators. In particular, we give a generalization of results in [2,3,13].
We introduce a new approach to the description of multi-sorted clones (sets of $k$-tuples of operations of the same arity, closed under coordinatewise composition and containing all projection tuples) on a two-element domain. Leveraging the…
Clustering is a fundamental task in unsupervised learning. The focus of this paper is the Correlation Clustering functional which combines positive and negative affinities between the data points. The contribution of this paper is two fold:…