Related papers: Bent functions and strongly regular graphs

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…

Let $S$ be a subset of a amenable group $G$ such that $e\in S$ and $S^{-1}=S$. The main result of the paper states that if the Cayley graph of $G$ with respect to $S$ has a certain combinatorial property, then every positive definite…

The definition of edge-regularity in graphs is a relaxation of the definition of strong regularity, so strongly regular graphs are edge-regular and, not surprisingly, the family of edge-regular graphs is much larger and more diverse than…

Conjecturally, almost all graphs are determined by their spectra. This problem has also been studied for variants such as the spectra of the Laplacian and signless Laplacian. Here we consider the problem of determining graphs with Ihara and…

Menger's theorem is an important building block of numerous results in the study of graph structure. We consider a variant in terms of coarse geometry. We say that a set of graphs has the weak coarse Menger property if there exist functions…

In this paper we define a class of Boolean and generalized Boolean functions defined on $\mathbb{F}_2^n$ with values in $\mathbb{Z}_q$ (mostly, we consider $q=2^k$), which we call landscape functions (whose class containing generalized…

We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations,…

We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…

The $\{K_2,C_n\}$-factor of a graph is a spanning subgraph whose each component is either $K_2$ or $C_n$. In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the…

We consider translates of functions in $L^2(\RRd)$ along an irregular set of points. Introducing a notion of pseudo-Gramian function for the irregular case, we obtain conditions for a family of irregular translates to be a Bessel sequence…

Bent functions are balanced by restricting their domains to vectors with either even or odd Hamming weights, which ensures an equal number of pre-images for both, 0 and 1. Using the previous fact, we can construct bent functions on two…

We give two constructions of strongly regular Cayley graphs on finite fields $\F_q$ by using union of cyclotomic classes and index 2 Gauss sums. In particular, we obtain twelve infinite families of strongly regular graphs with new…

Bent partitions of $V_{n}^{(p)}$ play an important role in constructing (vectorial) bent functions, partial difference sets, and association schemes, where $V_{n}^{(p)}$ denotes an $n$-dimensional vector space over the finite field…

Let $\Ga = (V, E)$ be a graph and $a, b$ nonnegative integers. An $(a, b)$-regular set in $\Ga$ is a nonempty proper subset $D$ of $V$ such that every vertex in $D$ has exactly $a$ neighbours in $D$ and every vertex in $V \setminus D$ has…

We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…

Semi-bent Boolean functions are interesting from a cryptographic standpoint, since they possess several desirable properties such as having a low and flat Walsh spectrum, which is useful to resist linear cryptanalysis. In this paper, we…

Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zig-zag and two more families…

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

Let $\Gamma=(V,E)$ be a graph. If all the eigenvalues of the adjacency matrix of the graph $\Gamma$ are integers, then we say that $\Gamma$ is an integral graph. A graph $\Gamma$ is determined by its spectrum if every graph cospectral to it…