The multiplier ideals of a sum of ideals

We prove that if , are nonzero sheaves of ideals on a complex smooth variety , then for every we have the following relation between the multiplier ideals of , and :

A similar formula holds for the asymptotic multiplier ideals of the sum of two graded systems of ideals.

We use this result to approximate at a given point arbitrary multiplier ideals by multiplier ideals associated to zero dimensional ideals. This is applied to compare the multiplier ideals associated to a scheme in different embeddings.

     

Linear resolutions of quadratic monomial ideals

We study the minimal free resolution of a quadratic monomial ideal in the case where the resolution is linear. First, we focus on the squarefree case, namely that of an edge ideal. We provide an explicit minimal free resolution under the assumption that the graph associated with the edge ideal satisfies specific combinatorial conditions. In addition, we construct a regular cellular structure on the resolution. Finally, we extend our results to non-squarefree ideals by means of polarization.     

The tame kernel of imaginary quadratic fields with class number 2 or 3

This paper presents improved bounds for the norms of exceptional finite places of the group , where is an imaginary quadratic field of class number 2 or 3. As an application we show that .

     

On a class of elliptic functions associated with imaginary quadratic fields

Let be the field discriminant of an imaginary quadratic field. We construct a class of elliptic functions associated naturally with the quadratic field which, combined with the general theory of elliptic functions, allows us to provide a unified theory for two fundamental results (one classical and one due to Ramanujan) about the elliptic functions.

     

Counting integral ideals in a number field

Let K   be an algebraic number field. We discuss the problem of counting the number of integral ideals below a given norm and obtain effective error estimates. The approach is elementary and follows a classical line of argument of Dedekind and Weber. The novelty here is that explicit error estimates can be obtained by fine tuning this classical argument without too much difficulty. The error estimate is sufficiently strong to give the analytic continuation of the Dedekind zeta function to the left of the line R(s)=1$\mathfrak{R}(s)=1$ as well as explicit bounds for the residue of the zeta function at s=1$s=1$.     

Universal sums of three quadratic polynomials

Let a,b,c,d,e and f be integers with a≥ c≥ e> 0,b>-a and b≡a(mod 2),d>-c and d≡c(mod 2),f>-e and f≡e(mod 2).Suppose that b≥d if a=c,and d≥f if c=e.When b(a-b),d(c-d) and f(e-f) are not all zero,we prove that if each n∈N={0,1,2,...} can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈N then the tuple(a,b,c,d,e,f) must be on our list of 473 candidates,and show that 56 of them meet our purpose.When b∈[0,a),d∈[0,c) and f∈[0,e),we investigate the universal tuples(a,b,c,d,e,f) over Z for which any n∈N can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈Z,and show that there are totally 12,082 such candidates some of which are proved to be universal tuples over Z.For example,we show that any n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈Z,and conjecture that each n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈N.     

Pell identities via a quadratic field

In this article, we derive a number of identities involving both Pell numbers and binomial coefficients. We also consider briefly the potential for obtaining Pell identities involving trinomial coefficients and beyond. A key point is the simplicity of the derivations, and indeed this work can lead on to a number of interesting explorations for first-year undergraduates.     

First inverse moment of a generalized quadratic form

In this paper an approximate expression for the first inverse moment of

Full-size image

where _k is a Gaussian stationary vector process is derived. This generalized quadratic form is the estimate of the information matrix when using the Recursive Least Squares (RLS) algorithm with forgetting factor. This estimator is commonly used when estimating parameters in time-varying linear stochastic systems.     

A fast, rigorous technique for computing the regulator of a real quadratic field

We present a new algorithm for computing the regulator of a real quadratic field based on an algorithm for unconditionally verifying the correctness of the regulator produced by a subexponential algorithm, that runs in expected time under the Generalized Riemann Hypothesis. The correctness of our algorithm relies on no unproven hypotheses and is currently the fastest known unconditional algorithm for computing the regulator. A number of implementation issues and performance enhancements are discussed, and we present the results of computations demonstrating the efficiency of the new algorithm.

     

Reducing the number of variables in integer quadratic programming problem

In this paper, a new variable reduction technique is presented for general integer quadratic programming problem (GP), under which some variables of (GP) can be fixed at zero without sacrificing optimality. A sufficient condition and a necessary condition for the identification of dominated terms are provided. By comparing the given data of the problem and the upper bound of the variables, if they meet certain conditions, some variables can be fixed at zero. We report a computational study to demonstrate the efficacy of the proposed technique in solving general integer quadratic programming problems. Furthermore, we discuss separable integer quadratic programming problems in a simpler and clearer form.     

On the number of generators of Cohen-Macaulay ideals

Several bounds on the number of generators of Cohen-Macaulay ideals known in the literature follow from a simple inequality which bounds the number of generators of such ideals in terms of mixed multiplicities. Results of Cohen and Akizuki, Abhyankar, Sally, Rees and Boratynski-Eisenbud-Rees are deduced very easily from this inequality.

     

关于特征和的混合均值

研究了特征和及其算术性质,并利用解析方法得到了两个关于特征和的混合均值的渐近公式,从而推广了特征和的算术性质。     

The core of zero-dimensional monomial ideals

The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two and three we give explicit formulas.     

Associated radical ideals of monomial ideals

Algebraic and combinatorial properties of a monomial ideal are studied in terms of its associated radical ideals. In particular, we present some applications to the symbolic powers of square-free monomial ideals.     

On the number of real quadratic fields with class number divisible by 3

We find a lower bound for the number of real quadratic fields whose class groups have an element of order . More precisely, we establish that the number of real quadratic fields whose absolute discriminant is and whose class group has an element of order is improving the existing best known bound of R. Murty.

     

On some conjectures on generalized quadratic Gauss sums and related problems

The main purpose of this article is to study higher power mean values of generalized quadratic Gauss sums using estimates for character sums, analytic methods and algebraic geometric methods. We prove two conjectures which were proposed recently by the above authors in a previous article (2022). Here we obtain an asymptotic formula for arbitrary power means of generalized quadratic Gauss sums and one corresponding power moment of a character sum.