On p-Extensions of Fields of Characteristic p

It is proved that a Galois extension of a field of characteristic p is completely determined by its Galois group and the endomorphism of the additive group of the group algebra that corresponds to the raising to the power p.     

Generalized Artin–Hasse and Iwasawa Formulas for the Hilbert Symbol in a High-Dimensional Local Field

The generalized Hilbert symbol in a cyclotomic extension of an absolutely unramified higher local field of characteristic 0 with a perfect last residue field of characteristic p > 2 is considered. Generalized Artin–Hasse and Iwasawa formulas are derived from an explicit Kummer Type Vostokov formula. Bibliography: 13 titles.     

Discrete mathematics in primary and secondary schools in the United States

This article provides a status report on discrete mathematics in America's schools, including an overview of publications and programs that have had major impact. It discusses why discrete mathematics should be introduced in the schools and the authors' efforts to advocate, facilitate, and support the adoption of discrete mathematics topics in the schools. Their perspective is that discrete mathematics should be viewed not only as a collection of new and interesting mathematical topics, but, more importantly, as a vehicle for providing teachers with a new way to think about traditional mathematical topics and new strategies for engaging their students in the study of mathematics.     

Numerical Modeling of Solitons in a Low Birefringent Optical Fiber

A numerical investigation, based on the split-step Fourier transform algorithm of all optical switching of solitons in a low birefringent optical fiber is presented. The numerical algorithm is described in detail. This revised version was published online in August 2006 with corrections to the Cover Date.     

Stark's conjecture over complex cubic number fields

Systematic computation of Stark units over nontotally real base fields is carried out for the first time. Since the information provided by Stark's conjecture is significantly less in this situation than the information provided over totally real base fields, new techniques are required. Precomputing Stark units in relative quadratic extensions (where the conjecture is already known to hold) and coupling this information with the Fincke-Pohst algorithm applied to certain quadratic forms leads to a significant reduction in search time for finding Stark units in larger extensions (where the conjecture is still unproven). Stark's conjecture is verified in each case for these Stark units in larger extensions and explicit generating polynomials for abelian extensions over complex cubic base fields, including Hilbert class fields, are obtained from the minimal polynomials of these new Stark units.

     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.