相关论文: The classification of Boolean degree $1$ functions…
For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…
We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…
This paper deals with a class of Sobolev spaces of vector-valued functions on a compact group. Some Sobolev embedding theorems are proved.
We study the behaviour of the algebraic degree of vectorial Boolean functions when their inputs are restricted to an affine subspace of their domain. Functions which maintain their degree on all subspaces of as high a codimension as…
Cameron-Liebler line classes were introduced in \cite{CL}, and motivated by a question about orbits of collineation groups of $\PG(3,q)$. These line classes have appeared in different contexts under disguised names such as Boolean degree…
It is known that for Banach valued functions there are several approaches to define a Sobolev class. We compare the usual definition via weak derivatives with the Reshetnyak-Sobolev space and with the Newtonian space; in particular, we…
It was proved few years ago that classes of Boolean functions definable by means of functional equations \cite{EFHH}, or equivalently, by means of relational constraints \cite{Pi2}, coincide with initial segments of the quasi-ordered set…
The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Mikl\"os and Singhi. We study the fundamentals properties of such lattices and of a…
Noncommutative lattices have been recently used as finite topological approximations in quantum physical models. As a first step in the construction of bundles and characteristic classes over such noncommutative spaces, we shall study their…
We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…
We define and study hierarchies of topological spaces induced by the classical Borel and Luzin hierarchies of sets. Our hierarchies are divided into two classes: hierarchies of countably based spaces induced by their embeddings into the…
This paper introduces a novel quantum algorithm that is able to classify a hierarchy of classes of imbalanced Boolean functions. The fundamental characteristic of imbalanced Boolean functions is that the proportion of elements in their…
The study of topological quantum field theories increasingly relies upon concepts from higher-dimensional algebra such as n-categories and n-vector spaces. We review progress towards a definition of n-category suited for this purpose, and…
Properties of first-order Sobolev-type spaces on abstract metric measure spaces, so-called Newtonian spaces, based on quasi-Banach function lattices are investigated. The set of all weak upper gradients of a Newtonian function is of…
The lattice definition of the two-dimensional topological quantum field theory [Fukuma, {\em et al}, Commun.~Math.~Phys.\ {\bf 161}, 157 (1994)] is generalized to arbitrary (not necessarily orientable) compact surfaces. It is shown that…
In this paper, we study classes of Boolean functions that are testable with $O(\psi+1/\epsilon)$ queries, where $\psi$ depends on the parameters of the class (e.g., the number of terms, the number of relevant variables, etc.) but not on the…
Recent efforts in Analysis of Boolean Functions aim to extend core results to new spaces, including to the slice $\binom{[n]}{k}$, the hypergrid $[K]^n$, and noncommutative spaces (matrix algebras). We present here a new way to relate…
This is a survey of some recent applications of Boolean valued models of set theory to order bounded operators in vector lattices.
We consider quantum, nondterministic and probabilistic versions of known computational model Ordered Read-$k$-times Branching Programs or Ordered Binary Decision Diagrams with repeated test ($k$-QOBDD, $k$-NOBDD and $k$-POBDD). We show…
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…