Real quadratic fields with class number divisible by 3

 We shall show that the number of real quadratic fields whose absolute discriminant is ≤ x and whose class number is divisible by 3 is improving the existing best known bound of K. Chakraborty and R. Murty. Received: 7 January 2003 Published online: 19 May 2003 This work was supported by Korea Research Foundation Grant KRF-2002-003-C00001. Mathematics Subject Classification(2000): 11R11, 11R29     

Average number of rotations and access cost in iR-trees

iR trees are parameterized binary search trees which rebalance themselves locally. In our previous work the cases fori=1, 2 were studied. This note extends the result to arbitraryi. In particular, we derive a formula for the average number of rotations/reorganizations involved in an insertion and consequently a formula for the average number of comparisons for a successful search iniR trees.     

Higher relative class number formulae

Let E be a totally complex abelian number field with maximal real subfield F, and let denote the non-trivial character of . Similar to the classical case n=1 the value of the Artin L-function at for odd is given by a relative class number formula of the form Here is a higher Q-index, which is equal to 1 or 2 and is a higher relative class number. Here for any number field L the higher class number is the order of the finite group closely related to the order of the higher K-theory group of the ring of integers in L. Received: 4 June 1999 / Revised version: 27 September 2001 / Published online: 26 April 2002     

Roman domination subdivision number of graphs

A Roman dominating function on a graph G = (V, E) is a function f : V ? {0, 1, 2}f : V \rightarrow \{0, 1, 2\} satisfying the condition that every vertex v for which f(v) = 0 is adjacent to at least one vertex u for which f(u) = 2. The weight of a Roman dominating function is the value w(f) = ?_{v ? V} f(v)w(f) = \sum_{v\in V} f(v). The Roman domination number of a graph G, denoted by _gR(G)_{\gamma R}(G), equals the minimum weight of a Roman dominating function on G. The Roman domination subdivision number sd_gR(G)sd_{\gamma R}(G) is the minimum number of edges that must be subdivided (each edge in G can be subdivided at most once) in order to increase the Roman domination number. In this paper, first we establish upper bounds on the Roman domination subdivision number for arbitrary graphs in terms of vertex degree. Then we present several different conditions on G which are sufficient to imply that $1 \leq sd_{\gamma R}(G) \leq 3$1 \leq sd_{\gamma R}(G) \leq 3. Finally, we show that the Roman domination subdivision number of a graph can be arbitrarily large.     

On the Equivariant Tamagawa number conjecture for Tate motives

Let L be a finite abelian extension of and let K be any subfield of L. For each integer r with r0 we prove the Equivariant Tamagawa Number Conjecture for the pair (h⁰(Spec(L))(r),[&frac;][Gal(L/K)]). Mathematics Subject Classification (1991) 11G40, 11R23, 11R33, 11R65     

On the number of partitions into primes

There is, apparently, a persistent belief that in the current state of knowledge it is not possible to obtain an asymptotic formula for the number of partitions of a number n into primes when n is large. In this paper such a formula is obtained. Since the distribution of primes can only be described accurately by the use of the logarithmic integral and a sum over zeros of the Riemann zeta-function one cannot expect the main term to involve only elementary functions. However the formula obtained, when n is replaced by a real variable, is in and is readily seen to be monotonic. Research supported by NSA grant, no. MDA904-03-1-0082.     

Equivariant Lefschetz number of differential operators

Let G be a compact Lie group acting on a compact complex manifold M by holomorphic transformations. We prove a trace density formula for the G-Lefschetz number of a holomorphic differential operator on M. We generalize the recent results of Engeli and the first author to orbifolds.     

The number of k‐SAT functions

We study the number SAT(k; n) of Boolean functions of n variables that can be expressed by a k‐SAT formula. Equivalently, we study the number of subsets of the n‐cube 2ⁿ that can be represented as the union of (n ? k)‐subcubes. In The number of 2‐SAT functions (Isr J Math, 133 (2003), 45–60) the authors and Imre Leader studied SAT(k; n) for k ≤ n/2, with emphasis on the case k = 2. Here, we prove bounds on SAT(k; n) for k ≥ n/2; we see a variety of different types of behavior. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 22: 227–247, 2003     

On the distribution of the number of real zeros of a random polynomial

In this note, we find the distibution of the number of real zeros of a random polynomial. We also derive a formula for the expected number of complex zeros lying in a given domain of the complex plane. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 320, 2004, pp. 69–79.     

On lower bounds for the chromatic number in terms of vertex degree

In this paper we discuss the existence of lower bounds for the chromatic number of graphs in terms of the average degree or the coloring number of graphs. We obtain a lower bound for the chromatic number of K_1,t-free graphs in terms of the maximum degree and show that the bound is tight. For any tree T, we obtain a lower bound for the chromatic number of any K_2,t-free and T-free graph in terms of its average degree. This answers affirmatively a modified version of Problem 4.3 in [T.R. Jensen, B. Toft, Graph Coloring Problems, Wiley, New York, 1995]. More generally, we discuss δ-bounded families of graphs and then we obtain a necessary and sufficient condition for a family of graphs to be a δ-bounded family in terms of its induced bipartite Turán number. Our last bound is in terms of forbidden induced even cycles in graphs; it extends a result in [S.E. Markossian, G.S. Gasparian, B.A. Reed, β-perfect graphs, J. Combin. Theory Ser. B 67 (1996) 1–11].     

On the 2-class field tower of some imaginary biquadratic number fields

Let be an imaginary biquadratic number field with Cl_k,2, the 2-class group of k, isomorphic to Z/2Z × Z/2^mZ, m > 1, with q a prime congruent to 3 mod 4 and d a square-free positive integer relatively prime to q. For a number of fields k of the above type we determine if the 2-class field tower of k has length greater than or equal to 2. To establish these results we utilize capitulation of ideal classes in the three unramified quadratic extensions of k, ambiguous class number formulas, results concerning the fundamental units of real biquadratic number fields, and criteria for imaginary quadratic number fields to have 2-class field tower length 1. 2000 Mathematics Subject Classification Primary—11R29     

Recognizing unstable equidimensional maps, and the number of stable projections of algebraic hypersurfaces

We study the recognition of -classes of multi-germs in families of corank-1 maps from n-space into n-space. From these recognition conditions we deduce certain geometric properties of bifurcation sets of such families of maps. As applications we give a formula for the number of -codimension-1 classes of corank-1 multi-germs from ℂ ⁿ to ℂ ⁿ and an upper bound for the number of stable projections of algebraic hypersurfaces in ℝ ^{n +1} into hyperplanes. Received: 23 July 1998     

On the representation of integers as sums of an odd number of squares

In a recent work, S. Cooper (J. Number Theory 103:135–162, [1988]) conjectured a formula for r _2k+1(p ²), the number of ways p ² can be expressed as a sum of 2k+1 squares. Inspired by this conjecture, we obtain an explicit formula for r _2k+1(n ²),n≥1. Dedicated to Srinivasa Ramanujan.     

The number of graphs and a random graph with a given degree sequence

We consider the set of all graphs on n labeled vertices with prescribed degrees D = (d₁,…,d_n). For a wide class of tame degree sequences D we obtain a computationally efficient asymptotic formula approximating the number of graphs within a relative error which approaches 0 as n grows. As a corollary, we prove that the structure of a random graph with a given tame degree sequence D is well described by a certain maximum entropy matrix computed from D. We also establish an asymptotic formula for the number of bipartite graphs with prescribed degrees of vertices, or, equivalently, for the number of 0‐1 matrices with prescribed row and column sums. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2013     

The jump number of suborders of the power set order

Let P be an ordered set induced by several levels of a power set. We give a formula for the jump number of P and show that reverse lexicographic orderings of P are optimal. The proof is based on an extremal set result of Frankl and Kalai.     

On Poincaré bundles of vector bundles on curves

An arbitrary cubic function field can have 0, 1, or 2 for its unit rank. This paper presents the complete classification of unit rank of an arbitrary cubic function field by its discriminant and the polynomial discriminant of its generating polynomial. The notions of Kummer Theory and Cardanos formula are used.Mathematics Subject Classification (2000): 11R27, 11R16Acknowledgement The author expresses her gratitude to the referee for very helpful comments.     

Some presentations of the real number field

It is proved that every two Σ-presentations of an ordered field \mathbbR \mathbb{R} of reals over \mathbbH\mathbbF ( \mathbbR ) \mathbb{H}\mathbb{F}\,\left( \mathbb{R} \right) , whose universes are subsets of \mathbbR \mathbb{R} , are mutually Σ-isomorphic. As a consequence, for a series of functions f:\mathbbR ? \mathbbR f:\mathbb{R} \to \mathbb{R} (e.g., exp, sin, cos, ln), it is stated that the structure \mathbbR \mathbb{R} = 〈R, +, ×, <, 0, 1, f〉 lacks such Σ-presentations over \mathbbH\mathbbF ( \mathbbR ) \mathbb{H}\mathbb{F}\,\left( \mathbb{R} \right) .     

The upper traceable number of a graph

For a nontrivial connected graph G of order n and a linear ordering s: v ₁, v ₂, …, v _n of vertices of G, define . The traceable number t(G) of a graph G is t(G) = min{d(s)} and the upper traceable number t ⁺(G) of G is t ⁺(G) = max{d(s)}, where the minimum and maximum are taken over all linear orderings s of vertices of G. We study upper traceable numbers of several classes of graphs and the relationship between the traceable number and upper traceable number of a graph. All connected graphs G for which t ⁺(G) − t(G) = 1 are characterized and a formula for the upper traceable number of a tree is established. Research supported by Srinakharinwirot University, the Thailand Research Fund and the Commission on Higher Education, Thailand under the grant number MRG 5080075.     

A generalization of the formula for the triangular number of the sum and product of natural numbers

This note generalizes the formula for the triangular number of the sum and product of two natural numbers to similar results for the triangular number of the sum and product of r natural numbers. The formula is applied to derive formula for the sum of an odd and an even number of consecutive triangular numbers.