The difference between the ordinary height and the canonical height on elliptic curves

We estimate the bounds for the difference between the ordinary height and the canonical height on elliptic curves over number fields. Our result is an improvement of the recent result of Cremona, Prickett, and Siksek [J.E. Cremona, M. Prickett, S. Siksek, Height difference bounds for elliptic curves over number fields, J. Number Theory 116 (2006) 42-68]. Our bounds are usually sharper than the other known bounds.     

On the number of integer polynomials with multiplicatively dependent roots

We give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for various cases, although in general there is a logarithmic gap between lower and upper bounds.     

Rational points of bounded height on projective surfaces

We give upper bounds for the number of rational points of bounded height on the complement of the lines on projective surfaces.     

New upper bounds for online strip packing

In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into one or more strips of width 1 and infinite height so as to minimize the required height of the packing. By analyzing a two-phase shelf algorithm, we derive a new upper bound 6.4786 on the competitive ratio for online one strip packing. This result improves the best known upper bound of 6.6623. We also extend this algorithm to online multiple strips packing and present some numeric upper bounds on their competitive ratios which are better than the previous bounds.     

Cardinality of height function’s range in case of maximally many rectangular islands — computed by cuts

We deal with rectangular m×n boards of square cells, using the cut technics of the height function. We investigate combinatorial properties of this function, and in particular we give lower and upper bounds for the number of essentially different cuts. This number turns out to be the cardinality of the height function’s range, in case the height function has maximally many rectangular islands.     

Upper bounds for the height of S-integral points on elliptic curves

We establish new upper bounds for the height of the S-integral points of an elliptic curve. This bound is explicitly given in terms of the set S of places of the number field K involved, but also in terms of the degree of K, as well as the rank, the regulator and the height of a basis of the Mordell–Weil group of the curve. The proof uses the elliptic analogue of Baker’s method, based on lower bounds for linear forms in elliptic logarithms.     

Two-sided estimates for essential height in Shirshov’s Height Theorem

The paper is focused on two-sided estimates for the essential height in Shirshov??s Height Theorem. The concepts of the selective height and strong n-divisibility directly related to the height and n-divisibility are introduced. We prove lower and upper bounds for the selective height over nonstrongly n-divisible words of length 2. For any n and sufficiently large l these bounds differ at most twice. The case of words of length 3 is also studied. The case of words of length 2 can be generalized to the proof of an upper exponential estimate in Shirshov??s Height Theorem. The proof uses the idea of V.N. Latyshev related to the application of Dilworth??s theorem to the study of non n-divisible words.     

Minoration de la hauteur de Néron-Tate sur les surfaces abéliennes

This paper contains results concerning a conjecture made by Lang and Silverman, predicting a lower bound for the canonical height on abelian varieties of dimension 2 over number fields. The method used here is a local height decomposition. We derive as corollaries uniform bounds on the number of torsion points on families of abelian surfaces and on the number of rational points on families of genus 2 curves.     

An Effective Version of Belyi's Theorem

We compute bounds on covering maps that arise in Belyi's Theorem. In particular, we construct a library of height properties and then apply it to algorithms that produce Belyi maps. Such maps are used to give coverings from algebraic curves to the projective line ramified over at most three points. The computations here give upper bounds on the degree and coefficients of polynomials and rational functions over the rationals that send a given set of algebraic numbers to the set {0,1,∞} with the additional property that the only critical values are also contained in {0,1,∞}.     

Bit-size estimates for triangular sets in positive dimension

We give bit-size estimates for the coefficients appearing in triangular sets describing positive-dimensional algebraic sets defined over Q. These estimates are worst case upper bounds; they depend only on the degree and height of the underlying algebraic sets. We illustrate the use of these results in the context of a modular algorithm.This extends the results by the first and the last author, which were confined to the case of dimension 0. Our strategy is to get back to dimension 0 by evaluation and interpolation techniques. Even though the main tool (height theory) remains the same, new difficulties arise to control the growth of the coefficients during the interpolation process.     

Expected heights in heaps

In this paper several recurrences and formulas are presented leading to upper and lower bounds, both logarithmic, for the expected height of a node in a heap. These bounds are of interest for algorithms that select thekth smallest element in a heap.     

A Sobolev Poincaré type inequality for integral varifolds

In this work a local inequality is provided which bounds the distance of an integral varifold from a multivalued plane (height) by its tilt and mean curvature. The bounds obtained for the exponents of the Lebesgue spaces involved are shown to be sharp.     

Two-Dimensional Finite Bin-Packing Algorithms

Given a set of rectangular pieces, the two-dimensional bin-packing problem is to place the pieces into an open-ended bin of infinite height such that the height of the resulting packing is minimized. In this paper we analyse the performance of two-dimensional bin-packing heuristics when applied to the special case of packing into finite bins. We develop new bin-packing heuristics by adapting the bottom-left packing method and the next-fit, first-fit and best-fit level-oriented packing heuristics to the finite-bin case. We present our implementation of these algorithms, and compare them to other finite-bin heuristics. Our computational results indicate that the heuristics presented in this paper are suitable for practical use, and behave in a manner which reflects the proven worst-case bounds for the two-dimensional open-ended bin-packing problem.     

Upper and lower bounds for higher order eigenvalues of some semilinear elliptic equations

We prove upper and lower bounds on the eigenvalues (as the norm of the eigenfunction tends to zero) in bifurcation problems for a class of semilinear elliptic equations in bounded domains of R^N. It is shown that these bounds are computable in terms of the eigenvalues of the associated linear equation.     

Combinatorial bounds on Hilbert functions of fat points in projective space

We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in , in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using nothing more than the multiplicities of the points and information about which subsets of the points are linearly dependent. When N=2, we give these bounds explicitly and we give a sufficient criterion for the upper and lower bounds to be equal. When this criterion is satisfied, we give both a simple formula for the Hilbert function and combinatorially defined upper and lower bounds on the graded Betti numbers for the ideal I_A defining A, generalizing results of Geramita et al. (2006) [16]. We obtain the exact Hilbert functions and graded Betti numbers for many families of examples, interesting combinatorially, geometrically, and algebraically. Our method works in any characteristic.     

Character sums with exponential functions over smooth numbers

We give nontrivial bounds in various ranges for exponential sums of the form

     

Worst-Case Scenario Portfolio Optimization: a New Stochastic Control Approach

We consider the determination of portfolio processes yielding the highest worst-case bound for the expected utility from final wealth if the stock price may have uncertain (down) jumps. The optimal portfolios are derived as solutions of non-linear differential equations which itself are consequences of a Bellman principle for worst-case bounds. A particular application of our setting is to model crash scenarios where both the number and the height of the crash are uncertain but bounded. Also the situation of changing market coefficients after a possible crash is analyzed.     

Rate estimates of gradient blowup for a heat equation with exponential nonlinearity

We consider a one-dimensional semilinear parabolic equation , for which the spatial derivative of solutions becomes unbounded in finite time while the solutions themselves remain bounded. We establish estimates of blowup rate upper and lower bounds. We prove that in this case the blowup rate does not match the one obtained by the rescaling method.