Related papers: On a quasi-ordering on Boolean functions
This paper is a contribution to the study of a quasi-order on the set $\Omega$ of Boolean functions, the \emph{simple minor} quasi-order. We look at the join-irreducible members of the resulting poset $\tilde{\Omega}$. Using a two-way…
This paper is a contribution to the study of a quasi-order on the set $\Omega$ of Boolean functions, the \emph{simple minor} quasi-order. We look at the join-irreducible members of the resulting poset $\tilde{\Omega}$. Using a two-way…
We examine a hierarchy of equivalence classes of quasi-random properties of Boolean Functions. In particular, we prove an equivalence between a number of properties including balanced influences, spectral discrepancy, local strong…
We study the quasi-order of topological embeddability on definable functions between Polish zero-dimensional spaces. We first study the descriptive complexity of this quasi-order restricted to the space of continuous functions. Our main…
Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a…
We introduce a notion of quasiconvexity for continuous functions $f$ defined on the vector bundle of linear maps between the tangent spaces of a smooth Riemannian manifold $(M,g)$ and $\mathbb{R}^m$, naturally generalizing the classical…
In this article, we give a full description of the Wadge degrees of Borel functions from $\omega^\omega$ to a better quasi ordering $\mathcal{Q}$. More precisely, for any countable ordinal $\xi$, we show that the Wadge degrees of…
We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…
We study classes of graphs with bounded clique-width that are well-quasi-ordered by the induced subgraph relation, in the presence of labels on the vertices. We prove that, given a finite presentation of a class of graphs, one can decide…
We define integrals for functions on finite-dimensional algebras, adapting methods from Leinster's research. This paper discusses the relationships between the integrals of functions defined on subsets $\mathbb{I}_1 \subseteq…
We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…
A fundamental construction in formal language theory is the Myhill-Nerode congruence on words, whose finitedness characterizes regular language. This construction was generalized to functions from $\Sigma^*$ to $\mathbb{Z}$ by Colcombet,…
We consider semiflows in general Banach spaces motivated by monotone cyclic feedback systems or differential equations with integer-valued Lyapunov functionals. These semiflows enjoy strong monotonicity properties with respect to cones of…
A general notion of a quasi-finite algebra is introduced as an algebra graded by the set of all integers equipped with topologies on the homogeneous subspaces satisfying certain properties. An analogue of the regular bimodule is introduced…
In this paper we study quasiconformal curves which are a special case of quasiregular curves. Namely embeddings $\Omega\rightarrow\mathbb{R}^m$ from some domain $\Omega\subset\mathbb{R}^n$ to $\mathbb{R}^m$, where $n\leq m$, which belong in…
The class of threshold functions is known to be characterizable by functional equations or, equivalently, by pairs of relations, which are called relational constraints. It was shown by Hellerstein that this class cannot be characterized by…
Let $\Omega $ be an open subset of $\mathbb{R}^{N}$, and let $p,\, q:\Omega \rightarrow \left[ 1,\infty \right] $ be measurable functions. We give a necessary and sufficient condition for the embedding of the variable exponent space…
Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…
Recent results of Bucciarelli show that the semilattice of degrees of parallelism of first-order boolean functions in PCF has both infinite chains and infinite antichains. By considering a simple subclass of Sieber's sequentiality…
The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…