相关论文: Bent functions and strongly regular graphs

Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…

In this paper, we construct a family of quasi-strongly regular Cayley graphs $\Gamma_H(G)$ which is defined on a finite group $G$ with respect to a subgroup $H$ of $G$. We also compute its full automorphism group and characterize various…

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$-valent one-regular graphs of order $5p^2$, where $p$ is a prime, are classified

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…

Given a permutation group $G$, the derangement graph of $G$ is the Cayley graph with connection set the derangements of $G$. The group $G$ is said to be innately transitive if $G$ has a transitive minimal normal subgroup. Clearly, every…

We survey results for Cameron-Liebler sets and low degree Boolean functions for Hamming graphs, Johnson graphs and Grassmann graphs from the point of view of association schemes. This survey covers selected results in finite geometry,…

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…

The cubic pancake graphs are Cayley graphs over the symmetric group $\mathrm{Sym}_n$ generated by three prefix reversals. There is the following open problem: characterize all the sets of three prefix reversals that generate…

In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers $n$, this family contains $n^{\Omega(n^{2/3})}$ strongly regular $n$-vertex graphs $X$…

A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…

We construct two families of strongly regular Cayley graphs, or equivalently, partial difference sets, based on elementary abelian groups. The parameters of these two families are generalizations of the Denniston and the dual Denniston…

Planar functions are of great importance in the constructions of DES-like iterated ciphers, error-correcting codes, signal sets and the area of mathematics. They are defined over finite fields of odd characteristic originally and…

For functions $f(z)= z+ a_2 z^2 + a_3 z^3 + \cdots$ in various subclasses of normalized analytic functions, we consider the problem of estimating the generalized Zalcman coefficient functional $\phi(f,n,m;\lambda):=|\lambda a_n a_m…

We call a function $f$ in $C(X)$ to be hard-bounded if $f$ is bounded on every hard subset, a special kind of closed subset, of $X$. We call a subset $T$ of $X$ to be $S$-embedded if every hard-bounded continuous function of $T$ can be…

In this paper we consider certain types of betweenness axioms on the interval function $I_G$ of a connected graph $G$. We characterize the class of graphs for which $I_G$ satisfy these axioms. The class of graphs that we characterize…

If $f(x,y)$ is a real function satisfying $y>0$ and $\sum_{r=0}^{n-1}f(x+ry,ny)=f(x,y)$ for $n=1,2,3,\ldots$, we say that $f(x,y)$ is an invariant function. Many special functions including Bernoulli polynomials, Gamma function and Hurwitz…

Beurling slow variation is generalized to Beurling regular variation. A Uniform Convergence Theorem, not previously known, is proved for those functions of this class that are measurable or have the Baire property. This permits their…

Let $\mathcal{S}_{n}$ be the symmetric group on $[n]=\{1, \ldots, n\}$. The $k$-point fixing graph $\mathcal{F}(n,k)$ is defined to be the graph with vertex set $\mathcal{S}_{n}$ and two vertices $g$, $h$ of $\mathcal{F}(n,k)$ are joined if…

Let $\eta$ be a fixed positive integer. Let $S$ be a subset of $\mathbb{Z}$, $\star:S\times S\to \mathbb{Z}$ be a binary function, and $\zeta_{\eta}:\{\xi\in \mathbb{Z}:\gcd(\xi,\eta)=1\}\to \{0,1\}$ be a function. For a simple connected…

A graph is called integral if all its eigenvalues are integers. A Cayley graph is called normal if its connection set is a union of conjugacy classes. We show that a non-empty integral normal Cayley graph for a group of odd order has an odd…