Related papers: Boolean degree 1 functions on some classical assoc…
We describe a general construction of strongly regular graphs from the collinearity graph of a finite classical polar spaces of rank at least $3$ over a finite field of order $q$. We show that these graphs are non-isomorphic to the…
This paper investigates the relations between modular graph forms, which are generalizations of the modular graph functions that were introduced in earlier papers motivated by the structure of the low energy expansion of genus-one Type II…
Nisan and Szegedy (CC 1994) showed that any Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ that depends on all its input variables, when represented as a real-valued multivariate polynomial $P(x_1,\ldots,x_n)$, has degree at least $\log…
We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…
We present a general algorithm to compute off-shell, one-loop multigluon Green functions using bosonic string amplitudes. We identify and parametrize the regions in the space of moduli of one-loop Riemann surfaces that contribute to the…
Hypergeometric class equations are given by second order differential operators in one variable whose coefficient at the second derivative is a polynomial of degree $\leq2$, at the first derivative of degree $\leq1$ and the free term is a…
Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The…
Functions on a bounded domain in scientific computing are often approximated using piecewise polynomial approximations on meshes that adapt to the shape of the geometry. We study the problem of function approximation using splines on a…
A graph is called 1-planar if it can be drawn in the plane so that each of its edges is crossed by at most one other edge. In this paper we decompose the set of all 1-planar graphs into three classes $\mathcal C_0, \mathcal C_1$ and…
The class of operator-valued functions which are homogeneous of degree one, holomorphic in the open right polyhalfplane, have positive semidefinite real parts there and take selfadjoint operator values at real points, and its subclass…
We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\colon\{0,1\}^m\to\{0,1\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the…
Boolean functions with few-valued spectra have wide applications in cryptography, coding theory, sequence designs, etc. In this paper, we further study the parametric construction approach to obtain balanced Boolean functions using…
Let $\mathbb{F}$ be any field. The Grassmannian $\mathrm{Gr}(m,n)$ is the set of $m$-dimensional subspaces in $\mathbb{F}^n$, and the general linear group $\mathrm{GL}_n(\mathbb{F})$ acts transitively on it. The Schubert cells of…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…
In this paper, we construct a family of Bernstein functions using a class of rational parametrization. The new family of rational Bernstein basis on an index $\alpha \in {\left(-\infty \, , \, 0 \right)}\cup {\left(1 \, , \,…
A dichotomy discovered by Solecki says that a Baire class 1 function from a Souslin space into a Polish space either can be decomposed into countably many continuous functions, or else contains one particular function which cannot be so…
A natural measure of smoothness of a Boolean function is its sensitivity (the largest number of Hamming neighbors of a point which differ from it in function value). The structure of smooth or equivalently low-sensitivity functions is still…
For a finite undirected multigraph G=(V,E) and functions f,g:V-->\NN, let N_f^g(G,j) denote the number of (f,g)-factors of G with exactly j edges. The Heilmann-Lieb Theorem implies that \sum_j N_0^1(G,j) t^j is a polynomial with only real…
In this paper we focus on functions of the form $A^n\rightarrow \mathcal{P}(B)$, for possibly different arbitrary non-empty sets $A$ and $B$, and where $\mathcal{P}(B)$ denotes the set of all subsets of $B$. These mappings are called…