Related papers: Clonoids of Boolean functions with a monotone or d…
We find all subsets of $\mathbb{N}$ which occur as the set of possible cardinalities of preimages of a continuous function. We also study and answer this question for various subclasses of continuous functions.
A monotonous polyomino is formed by all lattice unit squares met by the graph of some fixed monotonous continuous function $f:[a,b] \to \mathbb{R}$ with $f(k) \notin \mathbb{Z}$ whenever $k \in \mathbb{Z}$. Our main result says that the…
We are interested in representations and characterizations of lattice polynomial functions f:L^n -> L, where L is a given bounded distributive lattice. In companion papers [arXiv 0901.4888, arXiv 0808.2619], we investigated certain…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…
A cluster expansion is proposed, that applies to both continuous and discrete systems. The assumption for its convergence involves an extension of the neat Kotecky-Preiss criterion. Expressions and estimates for correlation functions are…
We investigate the second-order correlation function of the characteristic polynomial of a sample covariance matrix. Starting from an explicit formula for the generating function, we re-obtain several well-known kernels from random matrix…
We establish a theory of NC functions on a class of von Neumann algebras with a particular direct sum property, e.g. $B(\mathcal{H})$. In contrast to the theory's origins, we do not rely on appealing to results from the matricial case. We…
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
Groupoid cardinality is an invariant of locally finite groupoids which has many of the properties of the cardinality of finite sets, but which takes values in all non-negative real numbers, and accounts for the morphisms of a groupoid.…
A Brill-Noether degeneracy locus is closure in $\Pic^d(C)$ of the locus of line bundles with a specified rank function $r(a,b) = h^0(C,L(-ap-bq))$. These loci generalize the classical Brill-Noether loci $W^r_d(C)$ as well as Brill-Noether…
A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…
We show that the coefficients of the representing polynomial of any monotone Boolean function are the values of the M\"obius function of an atomistic lattice related to this function. Using this we determine the representing polynomial of…
A prescription for constructing dictionaries for cardinal spline spaces on a compact interval is provided. It is proved that such spaces can be spanned by dictionaries which are built by translating a prototype B-spline function of fixed…
We study the class of cooperative Boolean networks whose only regulatory functions are COPY, binary AND, and binary OR. We prove that for all sufficiently large N and c < 2 there exist Boolean networks in this class that have an attractor…
There are several examples of spaces of univariate functions for which we have a characterization of all sets of knots which are poised for the interpolation problem. For the standard spaces of univariate polynomials, or spline functions…
The theory of symmetric functions has been extended to the case where each variable is paired with an anticommuting one. The resulting expressions, dubbed superpolynomials, provide the natural N=1 supersymmetric version of the classical…
We prove a montonicity property of the new basis of C[(Z/2)^D]. We also study the matrix coefficients of the Fourier transform with respect to the new basis and formulate a conjecture for them.
A continuous selection of polynomial functions is a continuous function whose domain can be partitioned into finitely many pieces on which the function coincides with a polynomial. Given a set of finitely many polynomials, we show that…
The matrix convexity and the matrix monotony of a real $C^1$ function $f$ on $(0,\infty)$ are characterized in terms of the conditional negative or positive definiteness of the Loewner matrices associated with $f$, $tf(t)$, and $t^2f(t)$.…