Imaginary quadratic function fields

In Bautista-Ancona and Diaz-Vargas (2006) [B-D] a characterization and complete listing is given of the imaginary quadratic extensions K of k(x), where k is a finite field, in which the ideal class group has exponent two and the infinite prime of k(x) ramifies. The objective of this work is to give a characterization and list of these kind of extensions but now considering the case in which the infinite prime of k(x) is inert in K. Thus, we get all the imaginary quadratic extensions of k(x), in which the ideal class group has exponent two.     

Class numbers of definite binary quadratic lattices over algebraic function fields

Let k be an algebraic function field of one variable X having a finite field GF(q) of constants with q elements, q odd. Confined to imaginary quadratic extensions $\text{K}\text{k}$, class number formulas are developed for both the maximal and nonmaximal binary quadratic lattices L on (K, N), where N denotes the norm from K to k. The class numbers of L grow either with the genus g(k) of k (assuming the fields under consideration have bounded degree) or with the relative genus $\text{g(}\text{K}\text{k}\text{)}$ (assuming the lattices under consideration have bounded scale). In contrast to analogous theorems concerning positive definite binary quadratic lattices over totally real number fields, k is not necessarily totally real.     

Quadratic function fields with exponent two ideal class group

It has been shown by Madden that there are only finitely many quadratic extensions of k(x), k a finite field, in which the ideal class group has exponent two and the infinity place of k(x) ramifies. We give a characterization of such fields that allow us to find a full list of all such field extensions for future reference. In doing so we correct some errors in earlier published literature.     

Steinitz classes of tamely ramified Galois extensions of algebraic number fields

The Steinitz class of a number field extension K/k is an ideal class in the ring of integers Ok of k, which, together with the degree [K:k] of the extension determines the Ok-module structure of OK. We call Rt(k,G) the set of classes which are Steinitz classes of a tamely ramified G-extension of k. We will say that those classes are realizable for the group G; it is conjectured that the set of realizable classes is always a group. We define A^′-groups inductively, starting with abelian groups and then considering semidirect products of A^′-groups with abelian groups of relatively prime order and direct products of two A^′-groups. Our main result is that the conjecture about realizable Steinitz classes for tame extensions is true for A^′-groups of odd order; this covers many cases not previously known. Further we use the same techniques to determine Rt(k,Dn) for any odd integer n. In contrast with many other papers on the subject, we systematically use class field theory (instead of Kummer theory and cyclotomic descent).     

Capitulation problem for global function fields

Let q be a power of an odd prime number p, k=\mathbbF_q(t){p, k=\mathbb{F}_{q}(t)} be the rational function field over the finite field \mathbbF_q.{\mathbb{F}_{q}.} In this paper, we construct infinitely many real (resp. imaginary) quadratic extensions K over k whose ideal class group capitulates in a proper subfield of the Hilbert class field of K. The proof of the infinity of such fields K relies on an estimation of certain character sum over finite fields.     

Highly degenerate quadratic forms over

Let K be a finite extension of F₂. We consider quadratic forms written as the trace of xR(x), where R(x) is a linearized polynomial. We determine the K and R(x) where the form has a radical of codimension 2. This is applied to constructing maximal Artin–Schreier curves.     

Congruent elliptic curves with non-trivial Shafarevich-Tate groups: Distribution part

Given a large positive number x and a positive integer k, we denote by Qk(x) the set of congruent elliptic curves E(n): y2= z3- n2 z with positive square-free integers n x congruent to one modulo eight,having k prime factors and each prime factor congruent to one modulo four. We obtain the asymptotic formula for the number of congruent elliptic curves E(n)∈ Qk(x) with Mordell-Weil ranks zero and 2-primary part of Shafarevich-Tate groups isomorphic to(Z/2Z)2. We also get a lower bound for the number of E(n)∈ Qk(x)with Mordell-Weil ranks zero and 2-primary part of Shafarevich-Tate groups isomorphic to(Z/2Z)4. The key ingredient of the proof of these results is an independence property of residue symbols. This property roughly says that the number of positive square-free integers n x with k prime factors and residue symbols(quadratic and quartic) among its prime factors being given compatible values does not depend on the actual values.     

Degree conditions for the partition of a graph into cycles, edges and isolated vertices

Let k,n be integers with 2≤k≤n, and let G be a graph of order n. We prove that if max{d_G(x),d_G(y)}≥(n−k+1)/2 for any x,y∈V(G) with x≠y and xy∉E(G), then G has k vertex-disjoint subgraphs H₁,…,H_k such that V(H₁)∪?∪V(H_k)=V(G) and H_i is a cycle or K₁ or K₂ for each 1≤i≤k, unless k=2 and G=C₅, or k=3 and G=K₁∪C₅.     

A Note on the Double Affine Hecke Algebra of Type GL2

We express the double affine Hecke algebra ? associated to the general linear group GL₂(k) (here, k is a field with char(k) ≠ 2) as an amalgamated free product of quadratic extensions over the three-dimensional quantum torus 𝒪_q((k^×)³). With an eye towards proving ring-theoretic results pertaining to ?, a general treatment of amalgamated products of Ore and quadratic extensions is given. We prove an analogue of the Hilbert Basis Theorem for an amalgamated product Q of quadratic extensions and determine conditions for when the one-sided ideals of Q are principal or doubly-generated. Furthermore, we determine sufficient conditions which imply Q is a principal ideal ring. Finally, we construct an explicit isomorphism from ? to the amalgamated free product ring of quadratic extensions over 𝒪_q((k^×)³), a ring known to be noetherian. Therefore, it follows that ? is noetherian.     

A Family of Finite Simple Groups Which Are 2-Recognizable by Their Elements Order

Abstract

Let G be a finite group and ω(G) the set of all orders of elements in G. Denote by h(ω(G)) the number of isomorphism classes of finite groups H satisfying ω(H) = ω(G), and put h(G) = h(ω(G)). A group G is called k-recognizable if h(G) = k < ∞ , otherwise G is called non-recognizable. In the present article we will show that the simple groups PSL(3, q), where q ≡ ±2(mod 5) and (6, (q ? 1)/2) = 2, are 2-recognizable. Therefore if q is a prime power and q ≡ 17, 33, 53 or 57 (mod 60), then the groups PSL(3, q) are 2-recognizable. Hence proving the existing of an infinite families of 2-recognizable simple groups.     

An application of L-functions of imaginary quadratic fields

Let F₁(x, y),…, F_2h+1(x, y) be the representatives of equivalent classes of positive definite binary quadratic forms of discriminant ?q (q is a prime such that q ≡ 3 mod 4) with integer coefficients, then the number of integer solutions of F_i(x, y) = n (i = 1,…, 2h + 1) can be calculated for each natural number n using L-functions of imaginary quadratic field $\text{Q}$((?q)^1/2).     

On minimally circular-imperfect graphs

A circular-perfect graph is a graph of which each induced subgraph has the same circular chromatic number as its circular clique number. In this paper, (1) we prove a lower bound on the order of minimally circular-imperfect graphs, and characterize those that attain the bound; (2) we prove that if G is a claw-free minimally circular-imperfect graph such that ω_c(G-x)>ω(G-x) for some x∈V(G), then G=K_(2k+1)/2+x for an integer k; and (3) we also characterize all minimally circular-imperfect line graphs.     

Spectral bounds for the clique and independence numbers of graphs

We obtain a sequence k₁(G) ≤ k₂(G) ≤ … ≤ k_n(G) of lower bounds for the clique number (size of the largest clique) of a graph G of n vertices. The bounds involve the spectrum of the adjacency matrix of G. The bound k₁(G) is explicit and improves earlier known theorems. The bound k₂(G) is also explicit, and is shown to improve on the bound from Brooks' theorem even for regular graphs. The bounds k₃,…, k_r are polynomial-time computable, where r is the number of positive eigenvalues of G.     

On recognizability of some finite simple orthogonal groups by spectrum

It is proved that, if G is a finite group that has the same set of element orders as the simple group D _p (q), where p is prime, p ≥ 5 and q ∈ {2, 3, 5}, then the commutator group of G/F(G) is isomorphic to D _p (q), the subgroup F(G) is equal to 1 for q = 5 and to O _q (G) for q ∈ {2, 3}, F(G) ≤ G′, and |G/G′| ≤ 2.     

Competitively Tight Graphs

The competition graph of a digraph D is a (simple undirected) graph which has the same vertex set as D and has an edge between two distinct vertices x and y if and only if there exists a vertex v in D such that (x, v) and (y, v) are arcs of D. For any graph G, G together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number k(G) of a graph G is the smallest number of such isolated vertices. Computing the competition number of a graph is an NP-hard problem in general and has been one of the important research problems in the study of competition graphs. Opsut [1982] showed that the competition number of a graph G is related to the edge clique cover number θ _E (G) of the graph G via θ _E (G) ? |V(G)| + 2 ≤ k(G) ≤ θ _E (G). We first show that for any positive integer m satisfying 2 ≤ m ≤ |V(G)|, there exists a graph G with k(G) = θ _E (G) ? |V(G)| + m and characterize a graph G satisfying k(G) = θ _E (G). We then focus on what we call competitively tight graphs G which satisfy the lower bound, i.e., k(G) = θ _E (G) ? |V(G)| + 2. We completely characterize the competitively tight graphs having at most two triangles. In addition, we provide a new upper bound for the competition number of a graph from which we derive a sufficient condition and a necessary condition for a graph to be competitively tight.     

Commuting and centralizing generalized derivations on lie ideals in prime rings

Let R be a noncommutative prime ring of characteristic different from 2, U the Utumi quotient ring of R, C the extended centroid of R, and L a noncentral Lie ideal of R. If F and G are generalized derivations of R and k ≥1 a fixed integer such that [F(x), x] _k x ? x[G(x), x] _k = 0 for any x ∈ L, then one of the following holds:

1. either there exists an a ∈ U and an α ∈ C such that F(x) = xa and G(x) = (a + α)x for all x ∈ R
2. or R satisfies the standard identity s ₄(x ₁, …, x ₄) and one of the following conclusions occurs

1. there exist a, b, c, q ∈ U, such that a ?b + c ?q ∈ C and F(x) = ax + xb, G(x) = cx + xq for all x ∈ R
2. there exist a, b, c ∈ U and a derivation d of U such that F(x) = ax+d(x) andG(x) = bx+xc?d(x) for all x ∈ R, with a + b ? c ∈ C.

     

On n-Hamiltonian line graphs

With each nonempty graph G one can associate a graph L(G), called the line graph of G, with the property that there exists a one-to-one correspondence between E(G) and V(L(G)) such that two vertices of L(G) are adjacent if and only if the corresponding edges of G are adjacent. For integers m ≥ 2, the mth iterated line graph L^m(G) of G is defined to be L(L^m-1(G)). A graph G of order p ≥ 3 is n-Hamiltonian, 0 ≤ n ≤ p ? 3, if the removal of any k vertices, 0 ≤ k ≤ n, results in a Hamiltonian graph. It is shown that if G is a connected graph with δ(G) ≥ 3, where δ(G) denotes the minimum degree of G, then L²(G) is (δ(G) ? 3)-Hamiltonian. Furthermore, if G is 2-connected and δ(G) ≥ 4, then L²(G) is (2δ(G) ? 4)-Hamiltonian. For a connected graph G which is neither a path, a cycle, nor the graph K(1, 3) and for any positive integer n, the existence of an integer k such that L^m(G) is n-Hamiltonian for every m ≥ k is exhibited. Then, for the special case n = 1, bounds on (and, in some cases, the exact value of) the smallest such integer k are determined for various classes of graphs.     

Independent cycles with limited size in a graph

Letk and s be two positive integers with s≥3. LetG be a graph of ordern ≥sk. Writen =qk + r, 0 ≤r ≤k - 1. Suppose thatG has minimum degree at least (s - l)k. Then G containsk independent cyclesC ₁,C ₂,...,C _k such thats ≤l(C _i ) ≤q for 1 ≤i ≤r arnds ≤l(C _i ) ≤q + 1 fork -r <i ≤k, where l(C_i) denotes the length ofC _i .     

A mean value theorem for discriminants of abelian extensions of a number field

Let k be an algebraic number field and let N(k,C?;m) denote the number of abelian extensions K of k with G(K/k)≅C?, the cyclic group of prime order ?, and the relative discriminant D(K/k) of norm equal to m. In this paper, we derive an asymptotic formula for _∑m?XN(k,C?;m) using the class field theory and a method, developed by Wright. We show that our result is identical to a result of Cohen, Diaz y Diaz and Olivier, obtained by methods of classical algebraic number theory, although our methods allow for a more elegant treatment and reduce a global calculation to a series of local calculations.     

Quaternionic compositum genus

A quaternionic field over the rationals contains three quadratic subfields with a compositum genus relation of the type described in the author's paper in Volume 9 of this journal, involving the representation of a prime as norm in these subfields. These representations had previously been only partially exlored by the transfer of class structure from the rational to the quadratic fields. Here a full exposition is given by constructing the Artin characters when the subfields are $\text{Q}$(2^1/2), $\text{Q}$(q^1/2), and $\text{Q}$(2q)^1/2 (q prime). A special role belongs to q = A² + 32b².