Related papers: Boolean Operations, Joins, and the Extended Low Hi…
Empirical complex systems can be characterized not only by pairwise interactions, but also by higher-order (group) interactions influencing collective phenomena, from metabolic reactions to epidemics. Nevertheless, higher-order networks'…
Ladder operators are useful, if not essential, in the analysis of some given physical system since they can be used to find easily eigenvalues and eigenvectors of its Hamiltonian. In this paper we extend our previous results on abstract…
A longstanding question is to characterize the lattice of supersets (modulo finite sets), $\mathcal{L}^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $\mathcal{L}^*(A)\cong {\mathcal E}^*$. In spite of claims…
The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this…
We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…
In this paper, we study Brownian-type operators, which are upper triangular $2\times 2$ block matrix operators with entries satisfying some algebraic constraints. We establish a lifting theorem stating that any Brownian-type operator with…
Throughout the papers of E.B. Vinberg some non-abelian gradings of simple Lie algebras were introduced and investigated, namely short $SO_3 -$ and $SL_3$ - structures. We study another kind of them -- short $SL_2$ - structures. The main…
It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…
The stunning empirical successes of neural networks currently lack rigorous theoretical explanation. What form would such an explanation take, in the face of existing complexity-theoretic lower bounds? A first step might be to show that…
We prove a $k^{-\Omega(\log(\varepsilon_2 - \varepsilon_1))}$ lower bound for adaptively testing whether a Boolean function is $\varepsilon_1$-close to or $\varepsilon_2$-far from $k$-juntas. Our results provide the first superpolynomial…
We show that a large fraction of the data-structure lower bounds known today in fact follow by reduction from the communication complexity of lopsided (asymmetric) set disjointness. This includes lower bounds for: * high-dimensional…
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO) can be decided in linear time on any class of graphs of bounded treewidth, or in other words, MSO is fixed-parameter…
We introduce a new notion of computable function on $\R^N$ and prove some basic properties. We give two applications, first a short proof of Yoshinaga's theorem that periods are \el (they are actually low). We also show that the low complex…
The paper is devoted to the study of the twice epi-differentiablity of extended-real-valued functions, with an emphasis on functions satisfying a certain composite representation. This will be conducted under the parabolic regularity, a…
Lifted inference algorithms exploit symmetries in probabilistic models to speed up inference. They show impressive performance when calculating unconditional probabilities in relational models, but often resort to non-lifted inference when…
A biological neural network is constituted by numerous subnetworks and modules with different functionalities. For an artificial neural network, the relationship between a network and its subnetworks is also important and useful for both…
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel execution, object oriented, and short termination. The two…
We investigate quantifier alternation hierarchies in first-order logic on finite words. Levels in these hierarchies are defined by counting the number of quantifier alternations in formulas. We prove that one can decide membership of a…
Given a row contraction of operators on Hilbert space and a family of projections on the space which stabilize the operators, we show there is a unique minimal joint dilation to a row contraction of partial isometries which satisfy natural…
Modern deep neural networks are highly over-parameterized compared to the data on which they are trained, yet they often generalize remarkably well. A flurry of recent work has asked: why do deep networks not overfit to their training data?…