A note on Weilʼs multiplicative character sum
نویسندگان
چکیده
منابع مشابه
On trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
متن کاملA Note on Character Square
We study the finite groups with an irreducible character χ satisfying the following hypothesis: χ2 has exactly two distinct irreducible constituents, and one of which is linear, and then obtain a result analogous to the Zhmud’s ([8]).
متن کاملA Note on Chromatic Sum
The chromatic sum Σ(G) of a graph G is the smallest sum of colors among of proper coloring with the natural number. In this paper, we introduce a necessary condition for the existence of graph homomorphisms. Also, we present Σ(G) < χf (G)|G| for every graph G.
متن کاملA note on strongly multiplicative graphs
In this note we give an upper bound for λ(n), the maximum number of edges in a strongly multiplicative graph of order n, which is sharper than the upper bound obtained by Beineke and Hegde [1].
متن کاملA Note on the Multiplicative AHP
The paper concerns the pairwise comparison method used to rank a finite, usually small number of alternatives, in the Analytic Hierarchy Process (AHP), which belongs to a certain class of multiple attribute decision making methods. Ranking of alternatives is calculated based on expert judgments expressing relative importance for each pair of alternatives. From mathematical point of view calcula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2014
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2013.09.001