Related papers: Degree 2 Boolean Functions on Grassmann Graphs

Continuous spline functions are defined as piecewise polynomials on the faces of a polyhedral complex that agree on the intersections of two faces. Splines are used in approximation theory and numerical analysis, with applications in data…

In this paper we define real grassmann polylogarithms, which are real single valued analogues of the grassmann polylogarithms (or higher logarithms) defined by Hain and MacPherson. We prove the existence of all such real grassmann polylogs,…

For each d>=2, the mapping class group for plane curves of degree d will be defined and it is proved that there exists uniquely the Meyer function on this group. In the case of d=4, using our Meyer function, we can define the local…

We discuss the Grassmann graph $J_q(N,D)$ with $N \geq 2D$, having as vertices the $D$-dimensional subspaces of an $N$-dimensional vector space over the finite field $\mathbb{F}_q$. This graph is distance-regular with diameter $D$; to avoid…

Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…

Let $V$ be a vector space over a field $k, P:V\to k, d\geq 3$. We show the existence of a function $C(r,d)$ such that $rank (P)\leq C(r,d)$ for any field $k,char (k)>d$, a finite-dimensional $k$-vector space $V$ and a polynomial $P:V\to k$…

In this paper we generalize the partial spread class and completely describe it for generalized Boolean functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$. Explicitly, we describe gbent functions from $\F_2^n$ to $\mathbb{Z}_{2^t}$, which can be…

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 discuss the second-order differential uniformity of vectorial Boolean functions. The closely related notion of second-order zero differential uniformity has recently been studied in connection to resistance to the boomerang attack. We…

For any natural $d \ge k \ge 2$ we calculate the cohomology groups of the space of homogeneous polynomials $R^2 \to R$ of degree $d$, which do not vanish with multiplicity $\ge k$ on real lines. For $k=2$ this problem provides the simplest…

We prove a complete classification of degree-$2$ foliations on $\mathbb{P}^n$ in any dimension, assuming they are not algebraically integrable. If $\mathcal{F}$ is such a foliation, then either $\mathcal{F}$ is the linear pull-back of a…

The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- and 2-dimensional versions 1-WL and 2-WL have received much…

We show that there exist functions $c$ and $g$ such that, if $k$, $n$ and $d$ are positive integers with $d> g(n)$ and $\Gamma$ is a $d$-valent $2$-arc-transitive graph of order $kp^n$ with $p$ a prime, then $p\leqslant kc(d)$. In other…

Using a five dimensional (5D) warped model with two branes along the extra dimension, we study the Green's functions for gauge bosons with a mass gap $m_g = \rho/2$ and a continuum for $s > m_g^2$. We find that the Green's functions exhibit…

We show that a Boolean degree $d$ function on the slice $\binom{[n]}{k} = \{ (x_1,\ldots,x_n) \in \{0,1\} : \sum_{i=1}^n x_i = k \}$ is a junta, assuming that $k,n-k$ are large enough. This generalizes a classical result of Nisan and…

Let {\Lambda}\subsetR^{n}\timesR^{m} and k be a positive integer. Let f:R^{n}\rightarrowR^{m} be a locally bounded map such that for each ({\xi},{\eta})\in{\Lambda}, the derivatives D_{{\xi}}^{j}f(x):=|((d^{j})/(dt^{j}))f(x+t{\xi})|_{t=0},…

A $1$-factor in an $n$-vertex graph $G$ is a collection of $\frac{n}{2}$ vertex-disjoint edges and a $1$-factorization of $G$ is a partition of its edges into edge-disjoint $1$-factors. Clearly, a $1$-factorization of $G$ cannot exist…

Let $n,k$ be positive integers such that $n\geq 3$, $k < \frac {n}{2} $. Let $q$ be a power of a prime $p$ and $\mathbb{F}_q$ be a finite field of order $q$. Let $V(q,n)$ be a vector space of dimension $n$ over $\mathbb{F}_q$. We define the…

We study the $n$-variable Boolean functions which keep their algebraic degree unchanged when they are restricted to any (affine) hyperplane, or more generally to any affine space of a given co-dimension $k$. For cryptographic applications…

A graph is $(d_1, ..., d_r)$-colorable if its vertex set can be partitioned into $r$ sets $V_1, ..., V_r$ so that the maximum degree of the graph induced by $V_i$ is at most $d_i$ for each $i\in \{1, ..., r\}$. For a given pair $(g, d_1)$,…