Ambient connections realising conformal Tractor holonomy

For a conformal manifold we introduce the notion of an ambient connection, an affine connection on an ambient manifold of the conformal manifold, possibly with torsion, and with conditions relating it to the conformal structure. The purpose of this construction is to realise the normal conformal Tractor holonomy as affine holonomy of such a connection. We give an example of an ambient connection for which this is the case, and which is torsion free if we start the construction with a C-space, and in addition Ricci-flat if we start with an Einstein manifold. Thus, for a C-space this example leads to an ambient metric in the weaker sense of Čap and Gover, and for an Einstein space to a Ricci-flat ambient metric in the sense of Fefferman and Graham. Current address for first author: Erwin Schr?dinger International Institute for Mathematical Physics (ESI), Boltzmanngasse 9, 1090 Vienna, Austria Current address for second author: Department of Mathematics, University of Hamburg, Bundesstra?e 55, 20146 Hamburg, Germany     

Instabilities for supercritical Schrödinger equations in analytic manifolds

In this paper we consider supercritical nonlinear Schrödinger equations in an analytic Riemannian manifold (Md,g), where the metric g is analytic. Using an analytic WKB method, we are able to construct an Ansatz for the semiclassical equation for times independent of the small parameter. These approximate solutions will help to show two different types of instabilities. The first is in the energy space, and the second is an immediate loss of regularity in higher Sobolev norms.     

Preunits and weak crossed products

Using the notion of a preunit and the properties of idempotent morphisms, we give a general notion of a crossed product of an algebra A and an object V both living in a monoidal category C. We endow A⊗V with a multiplication and an idempotent morphism, whose image inherits the multiplication. Sufficient conditions for these multiplications to be associative are given. If the product on A⊗V has a preunit, the related idempotent is given in terms of the preunit, and its image has an algebra structure. A characterization of crossed products with preunit is given, and it is used to recover classical examples of crossed products and to study crossed products in weak contexts. Finally crossed products of an algebra by a weak bialgebra are recovered using this theory.     

A transport model for the evolution of urban systems

When comparing an urban system to an elasto-plastic lattice, an analogy to the solid state of matter can be exploited using the concepts of the band theory similarly. Thereafter, the population dynamics – in a region of certain stability in the state space and within appropriate energy bands – can be described in terms of Cellular Automata, with two mobile agents or pseudo particles: the inhabitant (representative of an average individual) and the recurson (representative of its multidimensional resources). As in the solid state, transition rules take the form of two coupled transport equations, comprising the terms equivalent to the generation-recombination and circulation processes. The first process can be compared to a predator–prey growth model, typical of Ecology; whereas the circulation process – composed of a drift component and a diffusion component – should be compared to the concentration-sprawl demographic balance seen in urban occupation and dynamics. Thus, it needs to be defined and determined an urban potential function, an equivalent population charge, mobility and diffusion parameters, as well as net growth factors. This analogy, discussed within the context of a case study for Great Mendoza, plausibly explains the varied growth rates of the political departments, as well as the principal urban trends for spatial occupation.     

Two-stage linear decision rules for multi-stage stochastic programming

Multi-stage stochastic linear programs (MSLPs) are notoriously hard to solve in general. Linear decision rules (LDRs) yield an approximation of an MSLP by restricting the decisions at each stage to be an affine function of the observed uncertain parameters. Finding an optimal LDR is a static optimization problem that provides an upper bound on the optimal value of the MSLP, and, under certain assumptions, can be formulated as an explicit linear program. Similarly, as proposed by Kuhn et al. (Math Program 130(1):177–209, 2011) a lower bound for an MSLP can be obtained by restricting decisions in the dual of the MSLP to follow an LDR. We propose a new approximation approach for MSLPs, two-stage LDRs. The idea is to require only the state variables in an MSLP to follow an LDR, which is sufficient to obtain an approximation of an MSLP that is a two-stage stochastic linear program (2SLP). We similarly propose to apply LDR only to a subset of the variables in the dual of the MSLP, which yields a 2SLP approximation of the dual that provides a lower bound on the optimal value of the MSLP. Although solving the corresponding 2SLP approximations exactly is intractable in general, we investigate how approximate solution approaches that have been developed for solving 2SLP can be applied to solve these approximation problems, and derive statistical upper and lower bounds on the optimal value of the MSLP. In addition to potentially yielding better policies and bounds, this approach requires many fewer assumptions than are required to obtain an explicit reformulation when using the standard static LDR approach. A computational study on two example problems demonstrates that using a two-stage LDR can yield significantly better primal policies and modestly better dual policies than using policies based on a static LDR.

     

A dual control problem and application to marketing

The general approach to adaptive and dual control is to formulate an optimal stochastic control problem. However, for such an approach only mathematical representations of the solution are available which allow little insight into the structure of the optimal controller. Here, an alternative deterministic approach is presented based upon determining a control in which a disturbance attenuation function remains bounded for all allowable (L₂ functions) disturbances. The disturbance attenuation function is composed of the ratio of an L₂ function of the desired outputs over an L₂ function of the disturbance inputs. This disturbance attenuation problem is converted to a differential game. For this game, the optimal control law, in a closed-form, is obtained by performing a minmax operation with respect to a quadratic cost function subjected to a bilinear system. The resulting controller is time-varying and depends nonlinearly on the state and the parameter estimates vector, and on an associated Riccati-type matrix. We provide insights into the structure of the resulting dual controller and illustrate the method by two examples. One of the examples is an application to marketing, to set promotional spending of a company, considering that the effect of promotional effort on sales is unknown.     

An Isotonic Regression Problem for Infinite-Dimensional Parameters

We consider an infinite-dimensional isotonic regression problem which is an extension of the suitably revised classical isotonic regression problem. Given p-summable data, for p finite and at least one, there exists an optimal estimator to our problem. For p greater than one, this estimator is unique and is the limit in the p-norm of the sequence of unique estimators in canonical finite-dimensional truncations of our problem. However, for p equal to one, our problem, as well as the finite-dimensional truncations, admit multiple optimal estimators in general. In this case, the sequence of optimal estimator sets to the truncations converges to the optimal estimator set of the infinite problem in the sense of Kuratowski. Moreover, the selection of natural best optimal estimators to the truncations converges in the 1-norm to an optimal estimator of the infinite problem.     

Toeplitz Operators and Division Theorems in Anisotropic Spaces of Holomorphic Functions in the Polydisc

This work is an introduction to anisotropic spaces, which have an ω-weight of analytic functions and are generalizations of Lipshitz classes in the polydisc. We prove that these classes form an algebra and are invariant with respect to monomial multiplication. These classes are described in terms of derivatives. It is established that Toeplitz operators are bounded in these (Lipschitz and Djrbashian) spaces. As an application, a theorem about the division by good-inner functions in the mentioned classes is proved.     

Finite-dimensional attractors for a general class of nonautonomous wave equations

Our aim in this note is to construct attractors and exponential attractors for a general class of nonautonomous semilinear wave equations. Following the approach described in [1], we define a semigroup S(t) associated to an autonomous system, and then prove, using an energy functional, that S(t) is an α-contraction and satisfies the squeezing property.     

On the spectrums of frame multiresolution analyses

We first give conditions for a univariate square integrable function to be a scaling function of a frame multiresolution analysis (FMRA) by generalizing the corresponding conditions for a scaling function of a multiresolution analysis (MRA). We also characterize the spectrum of the ‘central space’ of an FMRA, and then give a new condition for an FMRA to admit a single frame wavelet solely in terms of the spectrum of the central space of an FMRA. This improves the results previously obtained by Benedetto and Treiber and by some of the authors. Our methods and results are applied to the problem of the ‘containments’ of FMRAs in MRAs. We first prove that an FMRA is always contained in an MRA, and then we characterize those MRAs that contain ‘genuine’ FMRAs in terms of the unique low-pass filters of the MRAs and the spectrums of the central spaces of the FMRAs to be contained. This characterization shows, in particular, that if the low-pass filter of an MRA is almost everywhere zero-free, as is the case of the MRAs of Daubechies, then the MRA contains no FMRAs other than itself.     

An Algebraic Proof of Barlet's Join Theorem

In this article we give an algebraic proof of Barlet's join theorem, using an improved version of an algorithm for computing the join that was presented in (J. Dalbec and B. Sturmfels,in“Invariant Methods in Discrete and Computational Geometry, Curaçao, 1994,” pp. 37–58, Kluwer Academic, Dordrecht, 1995). The improvements in the algorithm consist of proving the correctness of the algorithm in large prime characteristics and giving explicit formulas for the functionsp(q,L) that were left unspecified in the original. The first three sections are largely expository; the fourth presents the modified algorithm and the proof of the main theorem. The last section gives an example of the algorithm; unfortunately, the complexity of the process makes it difficult to compute anything without resorting to tricky shortcuts, as we do in the example.     

Applying relation algebra and RelView to measures in a social network

We present an application of relation algebra to measure agents’ ‘strength’ in a social network with influence between agents. In particular, we deal with power, success, and influence of an agent as measured by the generalized Hoede–Bakker index and its modifications, and by the influence indices. We also apply relation algebra to determine followers of a coalition and the kernel of an influence function. This leads to specifications, which can be executed with the help of the BDD-based tool RelView after a simple translation into the tool’s programming language. As an example we consider the present Dutch Parliament.     

Outerplanar Thrackles

We show that a graph drawing is an outerplanar thrackle if and only if, up to an inversion in the plane, it is Reidemeister equivalent to an odd musquash. This establishes Conway’s thrackle conjecture for outerplanar thrackles. We also extend this result in two directions. First, we show that no pair of vertices of an outerplanar thrackle can be joined by an edge in such a way that the resulting graph drawing is a thrackle. Secondly, we introduce the notion of crossing rank; drawings with crossing rank 0 are generalizations of outerplanar drawings. We show that all thrackles of crossing rank 0 are outerplanar. We also introduce the notion of an alternating cycle drawing, and we show that a thrackled cycle is alternating if and only if it is outerplanar.     

Construction of Matrices with Prescribed Singular Values and Eigenvalues

Two issues concerning the construction of square matrices with prescribe singular values an eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values an m ( n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating the case when m = n. Second, an algorithm is given to generate a triangular matrix with prescribe singular values an eigenvalues. Unlike earlier algorithms, the eigenvalues can be arranged in any prescribe order on the diagonal. A slight modification of this algorithm allows one to construct a real matrix with specified real an complex conjugate eigenvalues an specified singular values. The construction is done by multiplication by diagonal unitary matrices, permutation matrices and rotation matrices. It is numerically stable and may be useful in developing test software for numerical linear algebra packages.     

ESS,NIS and GIS for matrix games in n‐species systems

In this paper, we discuss the concepts of evolutionarily stable strategy (ESS), neighborhood invader strategy (NIS) and global invader strategy (GIS) in n‐species systems. We give their definitions both on system level and species level. Although the definition on system level and that on species level are apparently different, it is found that they are equivalent to one another. About the relationships among an ESS, an NIS and a GIS for n‐species systems, we obtain the results similar to the ones for single species models: a GIS must be an NIS; an NIS must be an ESS; an ESS may not be a GIS; a GIS must be unique. The stability in the frequency dynamics with two phenotypes is also considered and the global stability of a GIS is shown. Copyright © 2010 John Wiley & Sons, Ltd.     

Morphisms inverted by profinite completion

It is shown that a map between nilpotent spaces becomes an equivalence upon P-profinite completion, where P is a collection of primes, if and only if it is an equivalence with respect to mod p homology for all p in P. Homological criteria for a homomorphism between nilpotent groups to become an isomorphism or an epimorphism under P-profinite completion are given. These results are relativised to nilpotent fibrations and relative groups.     

Exact algorithms for dominating set

The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems like Dominating Set and Independent Set. This approach is used in this paper to obtain a faster exact algorithm for Dominating Set. We obtain this algorithm by considering a series of branch and reduce algorithms. This series is the result of an iterative process in which a mathematical analysis of an algorithm in the series with measure and conquer results in a convex or quasiconvex programming problem. The solution, by means of a computer, to this problem not only gives a bound on the running time of the algorithm, but can also give an indication on where to look for a new reduction rule, often giving a new, possibly faster algorithm. As a result, we obtain an O(1.4969ⁿ) time and polynomial space algorithm.     

Additive conjoint measurement with ordered categories

Conjoint measurement studies binary relations defined on product sets and investigates the existence and uniqueness of, usually additive, numerical representations of such relations. It has proved to be quite a powerful tool to analyze and compare MCDM techniques designed to build a preference relation between multiattributed alternatives and has been an inspiring guide to many assessment protocols. The aim of this paper is to show that additive representations can be obtained on the basis of much poorer information than a preference relation. We will suppose here that the decision maker only specifies for each object if he/she finds it “attractive” (better than the status quo), “unattractive” (worse than the status quo) or “neutral” (equivalent to the status quo). We show how to build an additive representation, with tight uniqueness properties, using such an ordered partition of the set of objects. On a theoretical level, this paper shows that classical results of additive conjoint measurement can be extended to cover the case of ordered partitions and wishes to be a contribution to the growing literature on the foundations of sorting techniques in MCDM. On a more practical level, our results suggest an assessment strategy of an additive model on the basis of an ordered partition.     

A numerical approach to variational problems subject to convexity constraint

Summary. We describe an algorithm to approximate the minimizer of an elliptic functional in the form on the set of convex functions u in an appropriate functional space X. Such problems arise for instance in mathematical economics [4]. A special case gives the convex envelope of a given function . Let be any quasiuniform sequence of meshes whose diameter goes to zero, and the corresponding affine interpolation operators. We prove that the minimizer over is the limit of the sequence , where minimizes the functional over . We give an implementable characterization of . Then the finite dimensional problem turns out to be a minimization problem with linear constraints. Received November 24, 1999 / Published online October 16, 2000