On the well-posedness of a two-phase minimization problem

We prove a series of results concerning the emptiness and non-emptiness of a certain set of Sobolev functions related to the well-posedness of a two-phase minimization problem, involving both the p(x)-norm and the infinity norm. The results, although interesting in their own right, hold the promise of a wider applicability since they can be relevant in the context of other problems where minimization of the p-energy in a part of the domain is coupled with the more local minimization of the L^∞-norm on another region.     

Lifespan Theorem for simple constrained surface diffusion flows

We consider closed immersed hypersurfaces in R³ and R⁴ evolving by a special class of constrained surface diffusion flows. This class of constrained flows includes the classical surface diffusion flow. In this paper we present a Lifespan Theorem for these flows, which gives a positive lower bound on the time for which a smooth solution exists, and a small upper bound on the total curvature during this time. The hypothesis of the theorem is that the surface is not already singular in terms of concentration of curvature. This turns out to be a deep property of the initial manifold, as the lower bound on maximal time obtained depends precisely upon the concentration of curvature of the initial manifold in L² for M² immersed in R³ and additionally on the concentration in L³ for M³ immersed in R⁴. This is stronger than a previous result on a different class of constrained surface diffusion flows, as here we obtain an improved lower bound on maximal time, a better estimate during this period, and eliminate any assumption on the area of the evolving hypersurface.     

Unisolvency for multivariate polynomial interpolation in Coatmèlec configurations of nodes

A new and straightforward proof of the unisolvability of the problem of multivariate polynomial interpolation based on Coatmèlec configurations of nodes, a class of properly posed set of nodes defined by hyperplanes, is presented. The proof generalizes a previous one for the bivariate case and is based on a recursive reduction of the problem to simpler ones following the so-called Radon-Bézout process.     

Iterative process for G-multi degree reduction of Bézier curves

In this paper, the issue of multi-degree reduction of Bézier curves with C¹ and G²-continuity at the end points of the curve is considered. An iterative method, which is the first of this type, is derived. It is shown that this algorithm converges and can be applied iteratively to get the required accuracy. Some examples and figures are given to demonstrate the efficiency of this method.     

Characterizing geometric designs, II

We provide a characterization of the classical point-line designs PG₁(n,q), where n?3, among all non-symmetric 2-(v,k,1)-designs as those with the maximal number of hyperplanes. As an application of this result, we characterize the classical quasi-symmetric designs PGn−2(n,q), where n?4, among all (not necessarily quasi-symmetric) designs with the same parameters as those having line size q+1 and all intersection numbers at least qn−4+?+q+1. Finally, we also give an explicit lower bound for the number of non-isomorphic designs having the same parameters as PG₁(n,q); in particular, we obtain a new proof for the known fact that this number grows exponentially for any fixed value of q.     

Distributed computation of virtual coordinates for greedy routing in sensor networks

Sensor networks are emerging as a paradigm for future computing, but pose a number of challenges in the fields of networking and distributed computation. One challenge is to devise a greedy routing protocol—one that routes messages through the network using only information available at a node or its neighbors. Modeling the connectivity graph of a sensor network as a 3-connected planar graph, we describe how to compute on the network in a distributed and local manner a special geometric embedding of the graph. This embedding supports a geometric routing protocol called “greedy routing” based on the “virtual” coordinates of the nodes derived from the embedding.     

Only the first term of some series counts

Let X,X₁,X₂,… be i.i.d. random variables, and set S_n=X₁+?+X_n. We prove that for three important distributions of X, namely normal, exponential and geometric, series of the type ∑_n≥1a_nP(|S_n|≥xb_n) or ∑_n≥1a_nP(S_n≥xb_n) behave like their first term as x→∞.     

The rotational dimension of a graph

Given a connected graph G = (N, E) with node weights s∈? and nonnegative edge lengths, we study the following embedding problem related to an eigenvalue optimization problem over the second smallest eigenvalue of the (scaled) Laplacian of G: Find v_i∈?^|N|, i∈N so that distances between adjacent nodes do not exceed prescribed edge lengths, the weighted barycenter of all points is at the origin, and is maximized. In the case of a two‐dimensional optimal solution this corresponds to the equilibrium position of a quickly rotating net consisting of weighted mass points that are linked by massless cables of given lengths. We define the rotational dimension of G to be the minimal dimension k so that for all choices of lengths and weights an optimal solution can be found in ?^k and show that this is a minor monotone graph parameter. We give forbidden minor characterizations up to rotational dimension 2 and prove that the rotational dimension is always bounded above by the tree‐width of G plus one. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:283‐302, 2011     

On the explicit evaluation of the Geometric Asian options in stochastic volatility models with jumps

In the present paper we provide a semiexplicit valuation formula for Geometric Asian options, with fixed and floating strike under continuous monitoring, when the underlying stock price process exhibits both stochastic volatility and jumps. More precisely, we shall work in the Barndorff-Nielsen and Shephard (BNS) model framework. We shall provide some numerical illustrations of the results obtained.