Related papers: Degree 2 Boolean Functions on Grassmann Graphs

A nut graph is a non-trivial simple graph such that its adjacency matrix has a one-dimensional null space spanned by a full vector. It was recently shown by the authors that there exists a $d$-regular circulant nut graph of order $n$ if and…

We introduce two classes of novel color superalgebras of $ \mathbb{Z}_2 \times \mathbb{Z}_2 $ grading. This is done by realizing members of each in the universal enveloping algebra of the ${\cal N}=1$ supersymmetric extension of the…

Let $V$ be an $n$-dimensional vector space ($4\le n <\infty$) and let ${\mathcal G}_{k}(V)$ be the Grassmannian formed by all $k$-dimensional subspaces of $V$. The corresponding Grassmann graph will be denoted by $\Gamma_{k}(V)$. We…

Let k be a field, and A a finite-dimensional k-algebra. Let d be an integer. Denote by Gr(d,A) the Grassmannian of d-subspaces of A (viewed as a k-vector space), and by GL_1(A) the algebraic k-group whose points are invertible elements of…

By a regular embedding of a graph K in a surface we mean a 2-cell embedding of K in a compact connected surface such that the automorphism group acts regularly on flags. In this paper, we classify the nonorientable regular embeddings of the…

In this paper we explore whether or not deep neural architectures can learn to classify Boolean satisfiability (SAT). We devote considerable time to discussing the theoretical properties of SAT. Then, we define a graph representation for…

Bloch and Okounkov's correlation function on the infinite wedge space has connections to Gromov-Witten theory, Hilbert schemes, symmetric groups, and certain character functions of $\hgl_\infty$-modules of level one. Recent works have…

We give some remarks on some manifolds K3 surfaces, Complex projective spaces, real projective space and Torus and the classification of two dimensional Riemannian surfaces, Green functions and the Stokes formula. We also, talk about traces…

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

We explain the concept of worldline Green functions on classes of multiloop graphs. The QED beta function and the 2-loop Euler-Heisenberg Lagrangian are discussed for illustration.

We define the bicategory of Graph Convolutional Neural Networks $\mathbf{GCNN}_n$ for an arbitrary graph with $n$ nodes. We show it can be factored through the already existing categorical constructions for deep learning called…

Let $P_{2k}$ be a homogeneous polynomial of degree $2k$ and assume that there exist $C>0$, $D>0$ and $\alpha \ge 0$ such that \begin{equation*} \left\langle P_{2k}f_{m},f_{m}\right\rangle_{L^2(\mathbb{S}^{d-1})}\geq \frac{1}{C\left(…

Let G be a simple graph without isolated vertices. For a vertex i in G, the degree d_i is the number of vertices adjacent to i and the average 2-degree m_i is the mean of the degrees of the vertices which are adjacent to i. The sequence of…

We study the Fourier dimensions of graphs of real-valued functions defined on the unit interval [0,1]. Our results imply that the graph of the fractional Brownian motion is almost surely not a Salem set, answering in part a question of…

The algebraic degree of Boolean functions (or vectorial Boolean functions) is an important cryptographic parameter that should be computed by fast algorithms. They work in two main ways: (1) by computing the algebraic normal form and then…

We extend previous lists by numerically computing approximations to many L-functions of degree $d=3$, conductor $N=1$, and small spectral parameters. We sketch how previous arguments extend to say that for very small spectral parameters…

We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k}$ is a junta if $k \geq 2d$, and that this bound is sharp. We prove a similar result for $A$-valued degree $d$ functions for arbitrary finite $A$, and for functions on…

The bouquet of circles $B_n$ and dipole graph $D_n$ are two important classes of graphs in topological graph theory. For $n\geq 1$, we give an explicit formula for the average genus $\gamma_{avg}(B_n)$ of $B_n$. By this expression, one…

We study differential operators associated with families of polynomials orthonormal with respect to certain measures. These operators, when applied to the Fourier transforms of such measures, produce basis functions for expansions of…

Secure multi-party computation using a physical deck of cards, often called card-based cryptography, has been extensively studied during the past decade. Card-based protocols to compute various Boolean functions have been developed. As each…