THE ITERATION DIGRAPHS OF GROUP RINGS OVER FINITE FIELDS

2014 ◽  
Vol 13 (05) ◽  
pp. 1350162 ◽  
Author(s):  
YANGJIANG WEI ◽  
GAOHUA TANG ◽  
JIZHU NAN
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Finite Fields ◽  
Sufficient Conditions ◽  
Group Rings ◽  
Directed Edge ◽  
Cycle Structure ◽  
Vertex Set ◽  
Finite Commutative Ring ◽  
Necessary And Sufficient

For a finite commutative ring R and a positive integer k ≥ 2, we construct an iteration digraph G(R, k) whose vertex set is R and for which there is a directed edge from a ∈ R to b ∈ R if b = ak. In this paper, we investigate the iteration digraphs G(𝔽prCn, k) of 𝔽prCn, the group ring of a cyclic group Cn over a finite field 𝔽pr. We study the cycle structure of G(𝔽prCn, k), and explore the symmetric digraphs. Finally, we obtain necessary and sufficient conditions on 𝔽prCn and k such that G(𝔽prCn, k) is semiregular.

On the symmetric digraphs from the kth power mapping on finite commutative rings

2015 ◽  
Vol 07 (01) ◽  
pp. 1450064 ◽  
Author(s):  
Guixin Deng ◽  
Lawrence Somer
Keyword(s):  
Positive Integer ◽  
Commutative Ring ◽  
Sufficient Conditions ◽  
Commutative Rings ◽  
Connected Components ◽  
Directed Edge ◽  
Finite Commutative Ring ◽  
Power Mapping ◽  
Factor G ◽  
Finite Commutative Rings

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. The digraph G(R, k) is called symmetric of order M if its set of connected components can be partitioned into subsets of size M with each subset containing M isomorphic components. We primarily aim to factor G(R, k) into the product of its subdigraphs. If the characteristic of R is a prime p, we obtain several sufficient conditions for G(R, k) to be symmetric of order M.

scholarly journals SOME FAMILIES OF PERMUTATION POLYNOMIALS OVER FINITE FIELDS

2008 ◽  
Vol 04 (05) ◽  
pp. 851-857 ◽  
Author(s):  
MICHAEL E. ZIEVE
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Permutation Polynomials ◽  
Polynomials Over Finite Fields ◽  
Necessary And Sufficient

We give necessary and sufficient conditions for a polynomial of the form xr(1 + xv + x2v + ⋯ + xkv)t to permute the elements of the finite field 𝔽q. Our results yield especially simple criteria in case (q - 1)/ gcd (q - 1, v) is a small prime.

scholarly journals Hermitian Self-Orthogonal Constacyclic Codes over Finite Fields

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Amita Sahni ◽  
Poonam Trama Sehgal
Keyword(s):  
Finite Field ◽  
Finite Fields ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Mds Codes ◽  
Constacyclic Codes ◽  
Necessary And Sufficient ◽  
Defining Sets

Necessary and sufficient conditions for the existence of Hermitian self-orthogonal constacyclic codes of length n over a finite field Fq2, n coprime to q, are found. The defining sets and corresponding generator polynomials of these codes are also characterised. A formula for the number of Hermitian self-orthogonal constacyclic codes of length n over a finite field Fq2 is obtained. Conditions for the existence of numerous MDS Hermitian self-orthogonal constacyclic codes are obtained. The defining set and the number of such MDS codes are also found.

scholarly journals Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs

2013 ◽  
Vol Vol. 15 no. 2 (Combinatorics) ◽  
Author(s):  
Shonda Gosselin ◽  
Andrzej Szymański ◽  
Adam Pawel Wojda
Keyword(s):  
Positive Integer ◽  
Nonempty Subset ◽  
Sufficient Conditions ◽  
Sufficient Condition ◽  
Uniform Hypergraph ◽  
Necessary And Sufficient Condition ◽  
Vertex Set ◽  
International Audience ◽  
Complete Multipartite ◽  
Necessary And Sufficient

Combinatorics International audience A \em cyclic q-partition of a hypergraph (V,E) is a partition of the edge set E of the form \F,F^θ,F^θ², \ldots, F^θ^q-1\ for some permutation θ of the vertex set V. Let Vₙ = \ 1,2,\ldots,n\. For a positive integer k, Vₙ\choose k denotes the set of all k-subsets of Vₙ. For a nonempty subset K of V_n-1, we let \mathcalKₙ^(K) denote the hypergraph ≤ft(Vₙ, \bigcup_k∈ K Vₙ\choose k\right). In this paper, we find a necessary and sufficient condition on n, q and k for the existence of a cyclic q-partition of \mathcalKₙ^(V_k). In particular, we prove that if p is prime then there is a cyclic p^α-partition of \mathcalK^(Vₖ)ₙ if and only if p^α + β divides n, where β = \lfloor \logₚ k\rfloor. As an application of this result, we obtain two sufficient conditions on n₁,n₂,\ldots,n_t, k, α and a prime p for the existence of a cyclic p^α-partition of the complete t-partite k-uniform hypergraph \mathcal K^(k)_n₁,n₂,\ldots,n_t.

scholarly journals A Note on the Isomorphism Problem for Monomial Digraphs

2017 ◽  
Vol 17 (03n04) ◽  
pp. 1741006
Author(s):  
ALEKSANDR KODESS ◽  
FELIX LAZEBNIK
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Necessary Conditions ◽  
Sufficient Conditions ◽  
Isomorphism Problem ◽  
Sufficient Condition ◽  
Vertex Set ◽  
Simple Sufficient Condition

Let p be a prime e be a positive integer, [Formula: see text], and let [Formula: see text] denote the finite field of q elements. Let [Formula: see text], [Formula: see text], be integers. The monomial digraph [Formula: see text] is defined as follows: the vertex set of D is [Formula: see text], and [Formula: see text] is an arc in D if [Formula: see text]. In this note we study the question of isomorphism of monomial digraphs [Formula: see text] and [Formula: see text]. Several necessary conditions and several sufficient conditions for the isomorphism are found. We conjecture that one simple sufficient condition is also a necessary one.

The Square Mapping Graphs of Finite Commutative Rings

2012 ◽  
Vol 19 (03) ◽  
pp. 569-580 ◽  
Author(s):  
Yangjiang Wei ◽  
Gaohua Tang ◽  
Huadong Su
Keyword(s):  
Fixed Points ◽  
Commutative Ring ◽  
Sufficient Conditions ◽  
Commutative Rings ◽  
Directed Edge ◽  
Induced Subgraph ◽  
Zero Divisors ◽  
Finite Commutative Ring ◽  
Necessary And Sufficient ◽  
Finite Commutative Rings

For a finite commutative ring R, the square mapping graph of R is a directed graph Γ(R) whose set of vertices is all the elements of R and for which there is a directed edge from a to b if and only if a2=b. We establish necessary and sufficient conditions for the existence of isolated fixed points, and the cycles with length greater than 1 in Γ(R). We also examine when the induced subgraph on the set of zero-divisors of a local ring with odd characteristic is semiregular. Moreover, we completely determine the finite commutative rings whose square mapping graphs have exactly two, three or four components.

scholarly journals Power roots of polynomials over arbitrary fields

1994 ◽  
Vol 50 (2) ◽  
pp. 327-335
Author(s):  
Vincenzo Acciaro
Keyword(s):  
Finite Field ◽  
Number Field ◽  
Finite Fields ◽  
Algebraic Number ◽  
Sufficient Conditions ◽  
Algebraic Number Field ◽  
Arbitrary Field ◽  
Effective Algorithm ◽  
Roots Of Polynomials ◽  
Necessary And Sufficient

Let F be an arbitrary field, and f(x) a polynomial in one variable over F of degree ≥ 1. Given a polynomial g(x) ≠ 0 over F and an integer m > 1 we give necessary and sufficient conditions for the existence of a polynomial z(x) ∈ F[x] such that z(x)m ≡ g(x) (mod f(x)). We show how our results can be specialised to ℝ, ℂ and to finite fields. Since our proofs are constructive it is possible to translate them into an effective algorithm when F is a computable field (for example, a finite field or an algebraic number field).

Digraph from power mapping on noncommutative groups

2019 ◽  
Vol 19 (05) ◽  
pp. 2050084
Author(s):  
Jinxing Zhao ◽  
Guixin Deng
Keyword(s):  
Positive Integer ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Directed Edge ◽  
Cyclic Groups ◽  
Vertex Set ◽  
Necessary And Sufficient ◽  
Power Mapping

Let [Formula: see text] be a group and [Formula: see text] be a positive integer. The [Formula: see text]-power digraph [Formula: see text] is consisting of vertex set [Formula: see text] and there is a directed edge from [Formula: see text] to [Formula: see text] if and only if [Formula: see text]. We study the [Formula: see text]-power digraph on the semiproduct of cyclic groups. In particular, we obtain the distribution of indegree and cycles, and determine the structure of trees attached with vertices of power digraph. Finally, we establish a necessary and sufficient condition for isomorphism of digraphs [Formula: see text] and [Formula: see text].

Some generalized characters associated to a transitive permutation group

2020 ◽  
Vol 23 (3) ◽  
pp. 393-397
Author(s):  
Wolfgang Knapp ◽  
Peter Schmid
Keyword(s):  
Positive Integer ◽  
Permutation Group ◽  
Frobenius Group ◽  
Sufficient Conditions ◽  
Necessary Condition ◽  
Transitive Permutation Group ◽  
Point Stabilizer ◽  
Necessary And Sufficient ◽  
Regular Character ◽  
Permutation Character

AbstractLet G be a finite transitive permutation group of degree n, with point stabilizer {H\neq 1} and permutation character π. For every positive integer t, we consider the generalized character {\psi_{t}=\rho_{G}-t(\pi-1_{G})}, where {\rho_{G}} is the regular character of G and {1_{G}} the 1-character. We give necessary and sufficient conditions on t (and G) which guarantee that {\psi_{t}} is a character of G. A necessary condition is that {t\leq\min\{n-1,\lvert H\rvert\}}, and it turns out that {\psi_{t}} is a character of G for {t=n-1} resp. {t=\lvert H\rvert} precisely when G is 2-transitive resp. a Frobenius group.

scholarly journals Bipartite graphs with close domination and k-domination numbers

2020 ◽  
Vol 18 (1) ◽  
pp. 873-885
Author(s):  
Gülnaz Boruzanlı Ekinci ◽  
Csilla Bujtás
Keyword(s):  
Positive Integer ◽  
Dominating Set ◽  
Domination Number ◽  
Bipartite Graphs ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Minimum Cardinality ◽  
Vertex Set ◽  
Necessary And Sufficient ◽  
The Given

Abstract Let k be a positive integer and let G be a graph with vertex set V(G) . A subset D\subseteq V(G) is a k -dominating set if every vertex outside D is adjacent to at least k vertices in D . The k -domination number {\gamma }_{k}(G) is the minimum cardinality of a k -dominating set in G . For any graph G , we know that {\gamma }_{k}(G)\ge \gamma (G)+k-2 where \text{Δ}(G)\ge k\ge 2 and this bound is sharp for every k\ge 2 . In this paper, we characterize bipartite graphs satisfying the equality for k\ge 3 and present a necessary and sufficient condition for a bipartite graph to satisfy the equality hereditarily when k=3 . We also prove that the problem of deciding whether a graph satisfies the given equality is NP-hard in general.

Sign in / Sign up

Export Citation Format

Share Document