𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof for the nonvanishing of a character sum

✍ Scribed by Tauno Metsänkylä

Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
126 KB
Volume
9
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Short Proof of a Theorem Concerning De
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs
✍ Bing Wei 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 74 KB

proved that if G is a 2-connected graph with n vertices such that d(u)+d(v)+d(w) n+} holds for any triple of independent vertices u, v, and w, then G is hamiltonian, where } is the vertex connectivity of G. In this note, we will give a short proof of the above result.

On a Problem of H. Cohn for Character Su
On a Problem of H. Cohn for Character Sums
✍ Todd Cochrane; David Garth; Zhiyong Zheng 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Cohn's problem on character sums (see , p. 202) asks whether a multiplicative character on a finite field can be characterized by a kind of two level autocorrelation property. Let f be a map from a finite field F to the complex plane such that f (0)=0, f (1)=1, and | f (:)| =1 for all :{0. In this p

A short proof for a generalization of Vi
A short proof for a generalization of Vizing's theorem
✍ Claude Berge; Jean Claude Fournier 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 1 views

## Abstract For a simple graph of maximum degree Δ, it is always possible to color the edges with Δ + 1 colors (Vizing); furthermore, if the set of vertices of maximum degree is independent, Δ colors suffice (Fournier). In this article, we give a short constructive proof of an extension of these re

A short proof of a partition theorem for
A short proof of a partition theorem for the ordinal ωω
✍ Jean A. Larson 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 716 KB

An ordinal a is equal to the set of its predecessors and is ordered by the membership relation. For any ordinal a, one writes a -~ (a, m) 2 if and only if for any set A order-isomorphic to a, and any function f from the pairs of elements of A into {0, 1}, either there is a subset X c\_ A order-isomo

A short proof of the degree bound for in
A short proof of the degree bound for interval number
✍ Douglas B. West 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 141 KB

A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 in

A new short proof for the Kruskal-Katona
A new short proof for the Kruskal-Katona theorem
✍ P Frankl 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 96 KB

We give a very short proof for the Kruskal-Katona theorem and Lovhsz's version of it: given (~) k-element sets there are at least (k~\_l) (k -1)-element sets which are contained in at least one of the k-sets.