Motivic Serre invariants of curves

In this article, we generalize the theory of motivic integration on formal schemes topologically of finite type and the notion of motivic Serre invariant, to a relative point of view. We compute the relative motivic Serre invariant for curves defined over the field of fractions of a complete discrete valuation ring R of equicharacteristic zero. One aim of this study is to understand the behavior of motivic Serre invariants under ramified extension of the ring R. Thanks to our constructions, we obtain, in particular, an expression for the generating power series, whose coefficients are the motivic Serre invariant associated to a curve, computed on a tower of ramified extensions of R. We give an interpretation of this series in terms of the motivic zeta function of Denef and Loeser.     

The Tate-Voloch conjecture for Drinfeld modules

We study the v-adic distance from the torsion of a Drinfeld module to an affine variety.     

Constructing one-parameter families of elliptic curves with moderate rank

We give several new constructions for moderate rank elliptic curves over Q(T). In particular we construct infinitely many rational elliptic surfaces (not in Weierstrass form) of rank 6 over Q using polynomials of degree two in T. While our method generates linearly independent points, we are able to show the rank is exactly 6 without having to verify the points are independent. The method generalizes; however, the higher rank surfaces are not rational, and we need to check that the constructed points are linearly independent.     

Differential operators on Hilbert modular forms

We investigate differential operators and their compatibility with subgroups of SL₂n(R). In particular, we construct Rankin-Cohen brackets for Hilbert modular forms, and more generally, multilinear differential operators on the space of Hilbert modular forms. As an application, we explicitly determine the Rankin-Cohen bracket of a Hilbert-Eisenstein series and an arbitrary Hilbert modular form. We use this result to compute the Petersson inner product of such a bracket and a Hilbert modular cusp form.     

On a phase-change problem arising from inductive heating

In this paper we study a phase-change problem arising from induction heating. The mathematical model consists of time-harmonic Maxwell’s system in a quasi-stationary field coupled with nonlinear heat conduction. The enthalpy form is used to characterize the phase-change in the material. It is shown that the problem has a global solution. Moreover, it is shown that the solution is unique and regular in one-space dimension even with an unbounded resistivity. This work is supported in part by a NSF grant: DMS-0102261     

The three space problem in topological groups

We study compact, countably compact, pseudocompact, and functionally bounded sets in extensions of topological groups. A property P is said to be a three space property if, for every topological group G and a closed invariant subgroup N of G, the fact that both groups N and G/N have P implies that G also has P. It is shown that if all compact (countably compact) subsets of the groups N and G/N are metrizable, then G has the same property. However, the result cannot be extended to pseudocompact subsets, a counterexample exists under p=c. Another example shows that extensions of groups do not preserve the classes of realcompact, Dieudonné complete and μ-spaces: one can find a pseudocompact, non-compact Abelian topological group G and an infinite, closed, realcompact subgroup N of G such that G/N is compact and all functionally bounded subsets of N are finite. Several examples given in the article destroy a number of tempting conjectures about extensions of topological groups.     

On the torsion of Jacobians of principal modular curves of level 3<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We demonstrate that the 3-power torsion points of the Jacobians of the principal modular curves X(3ⁿ) are fixed by the kernel of the canonical outer Galois representation of the pro-3 fundamental group of the projective line minus three points. The proof proceeds by demonstrating the curves in question satisfy a two-part criterion given by Anderson and Ihara. Two proofs of the second part of the criterion are provided; the first relies on a theorem of Shimura, while the second uses the moduli interpretation. Received: 30 September 2005     

Some geometrical aspects of semidefinite linear complementarity problems

This article studies some geometrical aspects of the semidefinite linear complementarity problem (SDLCP), which can be viewed as a generalization of the well-known linear complementarity problem (LCP). SDLCP is a special case of a complementarity problem over a closed convex cone, where the cone considered is the closed convex cone of positive semidefinite matrices. It arises naturally in the unified formulation of a pair of primal-dual semidefinite programming problems. In this article, we introduce the notion of complementary cones in the semidefinite setting using the faces of the cone of positive semidefinite matrices and show that unlike complementary cones induced by an LCP, semidefinite complementary cones need not be closed. However, under R₀-property of the linear transformation, closedness of all the semidefinite complementary cones induced by L is ensured. We also introduce the notion of a principal subtransformation with respect to a face of the cone of positive semidefinite matrices and show that for a self-adjoint linear transformation, strict copositivity is equivalent to strict semimonotonicity of each principal subtransformation. Besides the above, various other solution properties of SDLCP will be interpreted and studied geometrically.     

Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.