Related papers: The Boolean SATisfiability Problem and the orthogo…

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in…

If $n \geq 3$, then moduli space ${\mathcal M}_{0,[n+1]}$, of isomorphisms classes of $(n+1)$-marked spheres, is a complex orbifold of dimension $n-2$. Its branch locus ${\mathcal B}_{0,[n+1]}$ consists of the isomorphism classes of those…

A Boolean function $f:\{0,1\}^n \mapsto \{0,1\}$ is said to be $\eps$-far from monotone if $f$ needs to be modified in at least $\eps$-fraction of the points to make it monotone. We design a randomized tester that is given oracle access to…

A nonpolynomial one-dimensional quantum potential representing an oscillator, that can be considered as placed in the middle between the harmonic oscillator and the isotonic oscillator (harmonic oscillator with a centripetal barrier), is…

This thesis is devoted to algorithmic aspects of the implementation of Cartan's moving frame method to the problem of the equivalence of submanifolds under a Lie group action. We adopt a general definition of a moving frame as an…

Boolean satisfiability problem (SAT) is fundamental to many applications. Existing works have used graph neural networks (GNNs) for (approximate) SAT solving. Typical GNN-based end-to-end SAT solvers predict SAT solutions concurrently. We…

We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $\Omega(n^{1/2-c})$. This improves the $\tilde\Omega(n^{1/3})$ lower bound of [CWX17] and…

We study the structure of the algebra of polynomial invariants for the usual conjugation action of the complex special, SO_n, and general, O_n, orthogonal group on the space of traceless n by n complex matrices. (Note that these two…

We construct finite dimensional families of non-steady solutions to the Euler equations, existing for all time, and exhibiting all kinds of qualitative dynamics in the phase space, for example: strange attractors and chaos, invariant…

In this paper we consider the analytic continuation of the weighted Bergman spaces on the Lie ball $$\mathscr{D}=SO(2,n)/S(O(2) \times O(n))$$ and the corresponding holomorphic unitary (projective) representations of SO(2,n) on these…

A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the input variables and the Boolean constants. It is $q$-multilinear if for each its output gate $o$ and for each prime implicant $s$ of the…

We present a novel application of the Kramers-Wannier duality on one of the most important problems of computer science, the Boolean satisfiability problem (SAT). More specifically, we focus on sharp-SAT or equivalently #SAT - the problem…

For the curved n-body problem in S^3, we show that a regular polygonal configuration for n masses on a geodesic is an equilibrium configuration if and only if n is odd and the masses are equal. The equilibrium configuration is associated…

Motivated by Xia-Zhou's recent work on applying symmetry groups to the N-body problem, we will study relative equilibria of the equilateral triangle and the square configurations under $\alpha$-homogeneous and quasi-homogeneous potentials…

Monotonicity testing of Boolean functions on the hypergrid, $f:[n]^d \to \{0,1\}$, is a classic topic in property testing. Determining the non-adaptive complexity of this problem is an important open question. For arbitrary $n$,…

We show that if a system of degree-$k$ polynomial constraints on~$n$ Boolean variables has a Sums-of-Squares (SOS) proof of unsatisfiability with at most~$s$ many monomials, then it also has one whose degree is of the order of the square…

This paper gives a new proof of a result of Geoghegan and Mihalik which states that whenever a contractible open $n$-manifold $W$ which is not homeomorphic to $\mathbf{R}^n$ is a covering space of an $n$-manifold $M$ and either $n \geq 4$…

We consider a steady state $v_{0}$ of the Euler equation in a fixed bounded domain in $\mathbf{R}^{n}$. Suppose the linearized Euler equation has an exponential dichotomy of unstable and center-stable subspaces. By rewriting the Euler…

In this paper we construct a cyclically invariant Boolean function whose sensitivity is $\Theta(n^{1/3})$. This result answers two previously published questions. Tur\'an (1984) asked if any Boolean function, invariant under some transitive…