相关论文: Bent functions and strongly regular graphs
In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that…
A graph is called dominating if its vertices can be labelled with integers in such a way that for every function f: omega-> omega the graph contains a ray whose sequence of labels eventually exceeds f. We obtain a characterization of these…
In the symmetric group Sym(n) with n at least 5 let H be a conjugacy class of elements of order 2 and let \Gamma be the Cayley graph whose vertex set is the group G generated by H (so G is Sym(n) or Alt(n)) and whose edge set is determined…
Graphlets are defined as k-node connected induced subgraph patterns. For an undirected graph, 3-node graphlets include close triangle and open triangle. When k = 4, there are six types of graphlets, e.g., tailed-triangle and clique are two…
A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let $p$ be a prime and $n$ a positive integer. In this paper, we investigate…
In these lectures I discuss Feynman graphs and the associated Feynman integrals. Of particular interest are the classes functions, which appear in the evaluation of Feynman integrals. The most prominent class of functions is given by…
Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…
In this paper, we investigate structural properties of the Cayley graph of a quandle and describe this graph for several important classes of quandles, including conjugation, Takasaki, dihedral, and Alexander quandles. In particular, we…
An important problem in the field of graph signal processing is developing appropriate overcomplete dictionaries for signals defined on different families of graphs. The Cayley graph of the symmetric group has natural applications in ranked…
We give a construction of strongly regular Cayley graphs on finite fields $\F_q$ by using union of cyclotomic classes and index 4 Gauss sums. In particular, we obtain two infinite families of strongly regular graphs with new parameters.
Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one…
A {\it regular balanced Cayley map} (RBCM for short) on a finite group $\Gamma$ is an embedding of a Cayley graph on $\Gamma$ into a surface, with some special symmetric property. People have classified RBCM's for cyclic, dihedral,…
We construct a new family of strongly regular graphs with the same parameters as the strongly regular graphs $D_{5,5}(q)$. The construction can be seen as a variant of the construction of twisted Grassmann graphs by Van Dam and Koolen.
Every Boolean bent function $f$ can be written either as a concatenation $f=f_1||f_2$ of two complementary semi-bent functions $f_1,f_2$; or as a concatenation $f=f_1||f_2||f_3||f_4$ of four Boolean functions $f_1,f_2,f_3,f_4$, all of which…
A signed graph is an ordered pair $\Sigma=(G,\sigma),$ where $G=(V,E)$ is the underlying graph of $\Sigma$ with a signature function $\sigma:E\rightarrow \{1,-1\}$. In this article, we define $n^{th}$ power of a signed graph and discuss…
A non-negative function $f$ is said to be 'bell-shaped' if $f$ tends to zero at $\pm \infty$ and the $n$-th derivative of $f$ changes its sign $n$ times for every $n = 0, 1, 2, \ldots$ We provide a complete characterisation of the class of…
Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property $\Phi$. What happens if this question is modified in a way that we get a possibly infinite family of graphs…
The Humbert-Bessel are multi-index functions with various applications in electromagnetism. New families of functions sharing some similarities with Bessel functions are often introduced in the mathematical literature, but at a closer…
Rotation symmetric Boolean functions have important applications in the design of cryptographic algorithms. In this paper, the Conjecture about rotation symmetric Boolean functions (RSBFs) of degree 3 proposed by Cusik and St\u{a}nic\u{a}…
Given graphs $X$ and $Y$ with vertex sets $V(X)$ and $V(Y)$ of the same cardinality, we define a graph $\mathsf{FS}(X,Y)$ whose vertex set consists of all bijections $\sigma:V(X)\to V(Y)$, where two bijections $\sigma$ and $\sigma'$ are…