Related papers: Functional Clones and Expressibility of Partition …
Functional equations (FE) arise quite naturally in the analysis of stochastic systems of different kinds : queueing and telecommunication networks, random walks, enumeration of planar lattice walks, etc. Frequently, the object is to…
For a class C of operations on a nonempty base set A, an operation f is called a C-subfunction of an operation g, if f = g(h_1, ..., h_n), where all the inner functions h_i are members of C. Two operations are C-equivalent if they are…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
Conventional functional/path integrals used in physics are most often defined and understood, either explicitly or implicitly, as the infinite-dimensional analog of Fourier transform. In this paper, the infinite-dimensional analog of Mellin…
In this paper we study generating functions resembling the rank of strongly unimodal sequences. We give combinatorial interpretations, identities in terms of mock modular forms, asymptotics, and a parity result. Our functions imitate a…
We reduce the computation of three point function of three spinning operators with arbitrary polarizations to a statistical mechanics problem via the hexagon formalism. The central building block of these correlation functions is the…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein. These notions, definitions, unsolved problems, questions, theorems corollaries, formulae, conjectures, examples, mathematical criteria, etc.…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
By using the space of fuzzy numbers, in e.g. [5] have been considered several complete metric spaces (called here {\bf FN}-type spaces) endowed with addition and scalar multiplication, such that the metrics have nice properties but the…
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…
Non-monotone inductive definitions were studied in the late 1960's and early 1970's with the aim of understanding connections between the complexity of the formulas defining the induction steps and the size of the ordinals measuring the…
This paper studies partitions in the space of antimonotonic boolean functions on sets of n elements. The antimonotonic functions are the antichains of the partially ordered set of subsets. We analyse and characterise a natural partial…
Snakes are analogues of alternating permutations defined for any Coxeter group. We study these objects from the point of view of combinatorial Hopf algebras, such as noncommutative symmetric functions and their generalizations. The main…
Clonoids are sets of finitary functions from an algebra $\mathbb{A}$ to an algebra $\mathbb{B}$ that are closed under composition with term functions of $\mathbb{A}$ on the domain side and with term functions of $\mathbb{B}$ on the codomain…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
We present a numerical method to evaluate partition functions and associated correlation functions of inhomogeneous 2--D classical spin systems and 1--D quantum spin systems. The method is scalable and has a controlled error. We illustrate…
The primary goal of this paper is to present a unified way to transform the syntax of a logic system into certain initial algebraic structure so that it can be studied algebraically. The algebraic structures which one may choose for this…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…
The reuse of code fragments by copying and pasting is widely practiced in software development and results in code clones. Cloning is considered an anti-pattern as it negatively affects program correctness and increases maintenance efforts.…
We study pivotal decomposition schemes and investigate classes of pivotally decomposable operations. We provide sufficient conditions on pivotal operations that guarantee that the corresponding classes of pivotally decomposable operations…