Related papers: On a quasi-ordering on Boolean functions
In this paper we give various characterizations of quasiopen sets and quasicontinuous functions on metric spaces. For complete metric spaces equipped with a doubling measure supporting a p-Poincar\'e inequality we show that quasiopen and…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
Computational models typically assume that operations are applied in a fixed sequential order. In recent years several works have looked at relaxing this assumption, considering computations without any fixed causal structure and showing…
We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…
In this paper, we investigate the boundedness of composition operators defined on a quasi-Banach space continuously included in the space of smooth functions on a manifold. We prove that the boundedness of a composition operator strongly…
We introduce partially ordered two-way B\"uchi automata and characterize their expressive power in terms of fragments of first-order logic FO[<]. Partially ordered two-way B\"uchi automata are B\"uchi automata which can change the direction…
Let $X$ be a rearrangement-invariant space over a non-atomic $\sigma$-finite measure space $(\mathscr{R},\mu)$ and let $\alpha\in(0,\infty)$. We define the functional \begin{equation*} \|f\|_{X^{\langle \alpha \rangle}} =…
Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…
Let $B_{1}(\Omega, \mathbb R)$ be the first Baire class of real functions in the pluri-fine topology on an open set $\Omega \subseteq \mathbb C^{n}$ and let $H_{1}^{*}(\Omega, \mathbb R)$ be the first functional Lebesgue class of real…
We prove that continuous reducibility is a well-quasi-order on the class of continuous functions between separable metrizable spaces with analytic zero-dimensional domain. To achieve this, we define scattered functions, which generalize…
Hamkins and Kikuchi (2016 and 2017) show that in both set theory and class theory the definable subset ordering of the universe interprets a complete and decidable theory. If $\mathcal{M}$ is a model of set theory, then $\langle M,…
In this paper we define a class of Boolean and generalized Boolean functions defined on $\mathbb{F}_2^n$ with values in $\mathbb{Z}_q$ (mostly, we consider $q=2^k$), which we call landscape functions (whose class containing generalized…
In this paper, several new classes of Boolean functions with few Walsh transform values, including bent, semi-bent and five-valued functions, are obtained by adding the product of two or three linear functions to some known bent…
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 investigate classes of Boolean algebras related to the notion of forcing that adds Cohen reals. A >>Cohen algebra<< is a Boolean algebra that is dense in the completion of a free Boolean algebra. We introduce and study generalizations of…
A Boolean function $f$ on $n$ variables is said to be a bent function if the absolute value of all its Walsh coefficients is $2^{n/2}$. Our main result is a new asymptotic lower bound on the number of Boolean bent functions. It is based on…
This survey aims to highlight some of the consequences that representable (and continuous) functionals have in the framework of Banach quasi *-algebras. In particular, we look at the link between the notions of *-semisimplicity and full…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
The notion of \emph{rank} of a Boolean function has been a cornerstone in PAC learning theory, enabling quasipolynomial-time learning algorithms for polynomial-size decision trees. We present a novel characterization of rank, grounded in…
We present a modular semantic account of Bayesian inference algorithms for probabilistic programming languages, as used in data science and machine learning. Sophisticated inference algorithms are often explained in terms of composition of…