Related papers: On p-ary Bent Functions and Strongly Regular Graph…

We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to…

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley…

In this present paper, it is proposed the renormalization techniques in the investigation of phase transition phenomena in $p$-adic statistical mechanics. We mainly study $p$-adic $\l$-model on the Cayley tree of order two. We consider…

We show that Caratheodory's conjecture, on umbilical points of closed convex surfaces, may be reformulated in terms of the existence of at least one umbilic in the graphs of functions f: R^2-->R whose gradient decays uniformly faster than…

Dariush Kiani et al.\cite{kiani2015unitary} claim to have found the unitary Cayley graph $Cay(M_{n}(F),GL_{n}(F))$ of matrix algebras over finite field $F$ is strongly regular only when $n=2$, but they have only considered two special…

The Graph Reconstruction Conjecture famously posits that any undirected graph on at least three vertices is determined up to isomorphism by its family of (unlabeled) induced subgraphs. At present, the conjecture admits partial resolutions…

We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…

Suppose G is a finite group, such that |G| = 16p, where p is prime. We show that if S is any generating set of G, then there is a hamiltonian cycle in the corresponding Cayley graph Cay(G;S).

In this paper, we investigate the complexity of an infinite family of Cayley graphs $\mathcal{D}_{n}=Cay(\mathbb{D}_{n}, b^{\pm\beta_1},b^{\pm\beta_2},\ldots,b^{\pm\beta_s}, a b^{\gamma_1}, a b^{\gamma_2},\ldots, a b^{\gamma_t} )$ on the…

Let p be a prime. A p-adic functional on a torsion-free abelian group G is a group homomorphism from G to the p-adic integers. The group of all such p-adic functionals is viewed as a p-adic dual group of G, and is studied from the point of…

It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a…

We give lower bounds on the maximum possible girth of an $r$-uniform, $d$-regular hypergraph with at most $n$ vertices, using the definition of a hypergraph cycle due to Berge. These differ from the trivial upper bound by an absolute…

A unifying scheme of classical special functions of hypergeometric type obeying orthogonality or biorthogonality relations is described. It expands the Askey scheme of classical orthogonal polynomials and its $q$-analogue based on the…

Let Phi be a reduced root system of rank r. A Weyl group multiple Dirichlet series for Phi is a Dirichlet series in r complex variables s_1,...,s_r, initially converging for Re(s_i) sufficiently large, that has meromorphic continuation to…

Duval, in "A Directed Graph Version of Strongly Regular Graphs" [{\it Journal of Combinatorial Theory}, Series A 47 (1988) 71 - 100], introduced the concept of directed strongly regular graphs. In this paper we construct several rich…

We obtain the following results. For any prime $q$ the minimal Hamming distance between distinct regular $q$-ary bent functions of $2n$ variables is equal to $q^n$. The number of $q$-ary regular bent functions at the distance $q^n$ from the…

Bent functions from a vector space $V_n$ over $\mathbb F_2$ of even dimension $n=2m$ into the cyclic group $\mathbb Z_{2^k}$, or equivalently, relative difference sets in $V_n\times\mathbb Z_{2^k}$ with forbidden subgroup $\mathbb Z_{2^k}$,…

In this paper we introduce new models of random graphs, arising from Latin squares which include random Cayley graphs as a special case. We investigate some properties of these graphs including their clique, independence and chromatic…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

The functionality of a graph $G$ is the minimum number $k$ such that in every induced subgraph of $G$ there exists a vertex whose neighbourhood is uniquely determined by the neighborhoods of at most $k$ other vertices in the subgraph. The…