In 1967 Harary, Hedetniemi, and Prins showed that every graph G admits a complete t-coloring for t with χ(G)≤t≤ψ(G), where χ(G) denotes the chromatic number of ψ(G) achromatic which is maximum r r-coloring. Recently, Edwards Rza̧żewski (2020) this result fails hypergraphs by proving integer k k≥9, there exists k-uniform hypergraph H χ(H)-coloring ψ(H)-coloring, but no some χ(H)<t<ψ(H). They also...

An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exists an equitable coloring of a graph G with k colors is said to be the equitable chromatic number of G and is denoted by χ=(G). The least positive integer k such that for any k′ ≥ k there exists an equitable coloring of ...

The interactions between systolic arterial pressure (SAP) and RR interval fluctuations after acute myocardial infarction (AMI) were investigated by measures of synchronization separating the feedback from the feedforward control and capturing both linear and nonlinear contributions. The causal synchronization, evaluating the ability of RR to predict SAP (χ s/t) or vice versa (χ t/s), and the gl...

where χ, ψ is a non trivial character of Fq , whose value at 0 is defined to be 0. It is well known that the absolute value of J(χ, ψ) is √ q = p, when χψ is not principal. According to [11], [9], call the Jacobi sum J(χ, ψ) pure if J(χ, ψ)/p is a root of unity. Let ord(χ) be the order of χ in F̂×q . From now on in this paper, we assume that ord(ψ) = 2 and ord(χ) = n ≥ 3. This special type of Ja...

Example 1.2. The trivial character of G is the homomorphism 1G defined by 1G(g) = 1 for all g ∈ G. Example 1.3. Let G be cyclic of order 4 with generator γ. Since γ4 = 1, a character χ of G has χ(γ)4 = 1, so χ takes only four possible values at γ, namely 1, −1, i, or −i. Once χ(γ) is known, the value of χ elsewhere is determined by multiplicativity: χ(γj) = χ(γ)j . So we get four characters, wh...

Example 1.2. The trivial character of G is the homomorphism 1G defined by 1G(g) = 1 for all g ∈ G. Example 1.3. Let G be cyclic of order 4 with generator γ. Since γ4 = 1, a character χ of G has χ(γ)4 = 1, so χ takes only four possible values at γ, namely 1, −1, i, or −i. Once χ(γ) is known, the value of χ elsewhere is determined by multiplicativity: χ(γj) = χ(γ)j . So we get four characters, wh...