Related papers: Width Hierarchy for k-OBDD of Small Width

Many applications of machine learning on discrete domains, such as learning preference functions in recommender systems or auctions, can be reduced to estimating a set function that is sparse in the Fourier domain. In this work, we present…

We adapt the Bartnik method to provide a Hilbert manifold structure for the space of solutions, without KID's, to the vacuum constraint equations on compact manifold of any dimension $\geq 3$. In the course, we prove that some fibers of the…

The $k$-dimensional functional order property ($\text{FOP}_k$) is a combinatorial property of a $(k+1)$-partitioned formula. This notion arose in work of Terry and Wolf, which identified $\text{NFOP}_2$ as a ternary analogue of stability in…

In this article, we introduce classes of functions whose increment is controlled by the measure of a ball containing the corresponding points and a nonnegative function p(.) that is summable with respect to measure. These classes of…

In this article, we will consider second order uniformly elliptic operators of divergence form defined on R^n with measurable coefficients. Mainly, we will give estimates on the dimension of space of solutions that grow at most polynomially…

We give a simple proof of the cobordism invariance of the index of an elliptic operator. The proof is based on a study of a Witten-type deformation of an extension of the operator to a complete Riemannian manifold. One of the advantages of…

Boolean functions on the space $F_{2}^m$ are not only important in the theory of error-correcting codes, but also in cryptography, where they occur in private key systems. In these two cases, the nonlinearity of these function is a main…

Bob Hough recently disproved a long-standing conjecture of Paul Erd\H{o}s regarding covering systems. Inspired by his seminal paper, we describe analogs of covering systems to Boolean functions, and more generally, the problem of covering…

We present a new characterization of higher-order Sobolev spaces on the sphere. Building on the approach of Barcel\'o et al. (2020), we refine the square function they introduced for this purpose. In particular, we provide a detailed…

The Hardy-Littlewood-P\'{o}lya inequality of majorization is extended to the framework of ordered Banach spaces. Several applications illustrating our main results are also included.

We count algebraic numbers of fixed degree $d$ and fixed (absolute multiplicative Weil) height $\mathcal{H}$ with precisely $k$ conjugates that lie inside the open unit disk. We also count the number of values up to $\mathcal{H}$ that the…

Any Boolean function corresponds with a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a direct acyclic graph where common subtrees are factored and shared, keeping only one copy of…

This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…

We present a theory for the construction of out-of-distribution (OOD) detection features for neural networks. We introduce random features for OOD through a novel information-theoretic loss functional consisting of two terms, the first…

We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on…

Gravitational anomalies can be realized on the boundary of topologically ordered states in one higher dimension and are described by topological orders in one higher dimension. In this paper, we try to develop a general theory for both…

This paper presents a method to detect and recognize symmetries in Boolean functions. The idea is to use information theoretic measures of Boolean functions to detect sub-space of possible symmetric variables. Coupled with the new…

We study approximation of Boolean functions by low-degree polynomials over the ring $\mathbb{Z}/2^k\mathbb{Z}$. More precisely, given a Boolean function $F:\{0,1\}^n \rightarrow \{0,1\}$, define its $k$-lift to be $F_k:\{0,1\}^n \rightarrow…

We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…

We consider the holographic computation of two dimensional conformal field theory partition functions on non-orientable surfaces. We classify the three dimensional geometries that give bulk saddle point contributions to the partition…