We give new proofs of two basic results in number theory: The law of quadratic reciprocity and the sign of the Gauss sum. We show that these results are encoded in the relation between the discrete Fourier transform and the action of the Weyl element in the Weil representation modulo p, q and pq. 0. Introduction Two basic results due to Gauss are the quadratic reciprocity law and the sign of th...

Topological indices are numerical parameters of a molecular graph G which characterize its topology. On the other hands, computing the connectivity indices of molecular graphs is an important branch in chemical graph theory. Therefore, we compute First Zagreb index Zg   <span style="font-family: TimesNewRomanPS-Italic...

let $g $ be a finite group and let $gamma(g)$ be the prime graph‎ ‎of g‎. ‎assume $2 < q = p^{alpha} < 100$‎. ‎we determine finite groups‎ ‎g such that $gamma(g) = gamma(u_3(q))$ and prove that if $q neq‎ ‎3‎, ‎5‎, ‎9‎, ‎17$‎, ‎then $u_3(q)$ is quasirecognizable by prime graph‎, ‎i.e‎. ‎if $g$ is a finite group with the same prime graph as the‎ ‎finite simple group $u_3(q)$‎, ‎then $g$ has a un...

From its early beginnings up to nowadays, algebraic number theory has evolved in symbiosis with Galois theory: indeed, one could hold that it consists in the very study of the absolute Galois group of the field of rational numbers. Nothing like that can be said of transcendental number theory. Nevertheless, couldn’t one associate conjugates and a Galois group to transcendental numbers such as π...

A central theme in distributed network algorithms concerns understanding and coping with the issue of locality. Despite considerable progress, research efforts in this direction have not yet resulted in a solid basis in the form of a fundamental computational complexity theory for locality. Inspired by sequential complexity theory, we focus on a complexity theory for distributed decision proble...