• Publications
  • Influence
On the symmetric digraphs from the kth power mapping on finite commutative rings
  • Guixin Deng, L. Somer
  • Mathematics, Computer Science
  • Discret. Math. Algorithms Appl.
  • 2 February 2015
TLDR
For a finite commutative ring R and a positive integer k, let G(R, k) denote the digraph whose set of vertices is R and for which there is a directed edge from a to ak. Expand
Symmetric Digraphs from Powers Modulo n
For each pair of positive integers n and k, let G(n,k) denote the digraph whose set of vertices is H = {0,1,2,···, n – 1} and there is a directed edge from a ∈ H to b ∈ H if a ≡ b(mod n). The digraphExpand
On the symmetric digraphs from powers modulo n
TLDR
We establish a necessary and sufficient condition for G(n,k) to be symmetric of order M, where M has an odd prime divisor. Expand
Isomorphic Digraphs from Affine Maps of Finite Cyclic Groups
Let be a positive integer. For any pair of integers and , let be the digraph whose set of vertices is , and there exists a directed edge from vertex to vertex if . In this paper, we obtain aExpand
On a Combinatorial Conjecture of Tu and Deng
TLDR
We prove a combinatorial conjecture about binary strings that is true in several cases. Expand
On the depth spectrum of binary linear codes and their dual
  • Guixin Deng
  • Mathematics, Computer Science
  • Discret. Math.
  • 1 April 2017
TLDR
In this paper we study the two extreme cases between the depth spectrum of binary linear codes and their dual codes. Expand
Cycles of linear dynamical systems over finite local rings
The study of linear dynamical systems over a finite commutative ring faces difficulties due to the lack of unique factorization of polynomials. In this paper, we give new criterions and algorithms toExpand
On the Davenport constant of a two-dimensional box $\left[\kern-0.15em\left[ { - 1,1} \right]\kern-0.15em\right] \times \left[\kern-0.15em\left[ { - m,n} \right]\kern-0.15em\right]$
Let $G$ be an abelian group and $X$ be a nonempty subset of $G$. A sequence $S$ over $X$ is called zero-sum if the sum of all terms of $S$ is zero. A nonempty zero-sum sequence $S$ is called minimalExpand
A Note on a Combinatorial Conjecture
It is difficult to find Boolean functions achieving many good cryptographic properties. Recently, Tu and Deng obtained two classes of Boolean functions with good properties based on a combinatorialExpand
On the Structure of G(H, k)
Let H be an abelian group written additively and k be a positive integer. Let G(H, k) denote the digraph whose set of vertices is just H, and there exists a directed edge from a vertex a to a vertexExpand
...
1
2
...