Related papers: Testing Isomorphism of Boolean Functions over Fini…

Given a locally finite graph $\Gamma$, an amenable subgroup $G$ of graph automorphisms acting freely and almost transitively on its vertices, and a $G$-invariant activity function $\lambda$, consider the free energy $f_G(\Gamma,\lambda)$ of…

A function $f : \mathbb{F}_2^n \to \mathbb{R}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. Motivated by applications to fast sparse Fourier transforms over $\mathbb{F}_2^n$, we study efficient algorithms for the…

While static symmetry breaking has been explored in the SAT community for decades, only as of 2010 research has focused on exploiting the same discovered symmetry dynamically, during the run of the SAT solver, by learning extra clauses. The…

We give nearly optimal bounds on the sample complexity of $(\widetilde{\Omega}(\epsilon),\epsilon)$-tolerant testing the $\rho$-independent set property in the dense graph setting. In particular, we give an algorithm that inspects a random…

H\"older-Brascamp-Lieb inequalities provide upper bounds for a class of multilinear expressions, in terms of $L^p$ norms of the functions involved. They have been extensively studied for functions defined on Euclidean spaces.…

Let $Ab_0$ be the class of finite abelian groups and consider the function $f:Ab_0\longrightarrow(0,\infty)$ given by $f(G)=\frac{|{\rm Aut}(G)|}{|G|}$\,, where ${\rm Aut}(G)$ is the automorphism group of a finite abelian group $G$. In this…

Let F_n be the free group of rank n and let Aut^+(F_n) be its special automorphism group. For an epimorphism pi : F_n -> G of the free group F_n onto a finite group G we call Gamma^+(G,pi) = {f in Aut^+(F_n) | pi*f = pi} the standard…

There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or…

Algebraic immunity of Boolean function $f$ is defined as the minimal degree of a nonzero $g$ such that $fg=0$ or $(f+1)g=0$. Given a positive even integer $n$, it is found that the weight distribution of any $n$-variable symmetric Boolean…

This paper analyzes the limit properties of the empirical process of $\alpha$-stable random variables with long range dependence. The $\alpha$-stable random variables are constructed by non-linear transformations of bivariate sequences of…

Consider a convex relaxation $\hat f$ of a pseudo-boolean function $f$. We say that the relaxation is {\em totally half-integral} if $\hat f(x)$ is a polyhedral function with half-integral extreme points $x$, and this property is preserved…

A classic inferential statistical problem is the goodness-of-fit (GOF) test. Such a test can be challenging when the hypothesized parametric model has an intractable likelihood and its distributional form is not available. Bayesian methods…

In this note, we construct new solutions to the heterotic $\mathrm{G}_2$-system with non-abelian gauge group, both compact and non-compact, on certain $2$-step nilmanifolds and $3$-Sasakian manifolds. Our approach is based on an ansatz that…

We describe a web of connections between the following topics: the mathematical theory of voting and social choice; the computational complexity of the Maximum Cut problem; the Gaussian Isoperimetric Inequality and Borell's generalization…

Polynomial threshold functions (PTFs) are an important low-complexity class of Boolean functions, with strong connections to learning theory and approximation theory. Recent work on learning and testing PTFs has exploited structural and…

We develop a quantitative theory of Lipschitz harmonic functions (LHF) on finitely generated groups, with emphasis on the Lipschitz Liouville property, affine rigidity, and quasi-isometric invariance for groups of polynomial growth. On…

Given a CNF formula $F$, we present a new algorithm for deciding the satisfiability (SAT) of $F$ and computing all solutions of assignments. The algorithm is based on the concept of \emph{cofactors} known in the literature. This paper is a…

We study parity decision trees for Boolean functions. The motivation of our study is the log-rank conjecture for XOR functions and its connection to Fourier analysis and parity decision tree complexity. Let f be a Boolean function with…

For $\alpha$ a positive irrational, let $\mathcal{A}_{\alpha}$ be the subalgebra of continuous functions on the two-torus whose Fourier transform vanishes at $(m, n)$ if $m + \alpha n < 0.$ These algebras were studied by Wermer and others,…

Taking the simple examples of an Abelian 1-form gauge theory in two (1 + 1)-dimensions, a 2-form gauge theory in four (3 + 1)-dimensions and a 3-form gauge theory in six (5 + 1)-dimensions of spacetime, we establish that such gauge theories…