On the rst hand, this report studies the class of Greedy Algorithms in order to nd an as systematic as possible strategy that could be applied to the speciication of some problems to lead to a correct program solving that problem. On the other hand, the standard formalisms underlying the Greedy Algorithms (matroid, greedoid and matroid embedding) which are dependent on the particular type set a...

This paper has two objectives: we first generalize the theory of Abhyankar-Moh to quasi-ordinary polynomials, then we use the notion of approximate roots and that of generalized Newton polygons in order to prove the embedding conjecture for this class of polynomials. This conjecture -made by S.S. Abhyankar and A. Sathayesays that if a hypersurface of the affine space is isomorphic to a coordina...

The dynamical scaling of ageing ferromagnetic systems can be generalized to a local scale invariance. This yields a prediction for the causal two-time response function, which has been numerically confirmed in the Glauber–Ising model quenched into the ordered phase. For a dynamical exponent z = 2, a new embedding of the Schrödinger group into the conformal group and the resulting conditions for...

We define a generalized distance function on an unoriented 3D point set and describe how it may be used to reconstruct a surface approximating these points. This distance function is shown to be a Mahalanobis distance in a higher-dimensional embedding space of the points, and the resulting reconstruction algorithm a natural extension of the classical Radial Basis Function (RBF) approach. Experi...

We construct generalized 11D supergravity solutions of fully localized D2/D6 brane intersections. These solutions are obtained by embedding Taub-NUT and/or self-dual geometries lifted to M-theory. We reduce these solutions to ten dimensions, obtaining new D-brane systems in type IIA supergravity. We discuss the limits in which the dynamics of the D2 brane decouples from the bulk for these solut...

In Shih & Hsu [9] a simpler planarity test was introduced utilizing a data structure called PC-trees (generalized from PQ-trees). In this paper we give an efficient implementation of that linear time algorithm and illustrate in detail how to obtain a Kuratowski’s subgraph when the given graph is not planar and how to obtain the embedding alongside the testing algorithm. The main part of the imp...

We construct generalized 11D supergravity solutions of fully localized intersecting D2/D4 brane systems. These solutions are obtained by embedding six-dimensional resolved Eguchi-Hanson conifolds lifted to M-theory. We reduce these solutions to ten dimensions, obtaining new D-brane systems in type IIA supergravity. We discuss the limits in which the dynamics of the D2 brane decouples from the b...

Abstract In this paper, we study the resonance problem of a class of singular quasilinear parabolic equations with respect to its higher near-eigenvalues. Under a generalized Landesman-Lazer condition, it is proved that the resonance problem admits at least one nontrivial solution in weighted Sobolev spaces. The proof is based upon applying the Galerkin-type technique, the Brouwer’s fixedpoint ...

We study a standard-embedding N = 2 heterotic string compactification on K3 × T 2 with a Wilson line turned on and perform a world-sheet calculation of string threshold correction. The result can be expressed in terms of the quantities appearing in the twoloop calculation of bosonic string. We also comment and speculate on the relevance of our result to generalized Kac-Moody superalgebra and N ...

“Unidirectional channel systems” (Chambart & Schnoebelen, CONCUR 2008) are finite-state systems where one-way communication from a Sender to a Receiver goes via one reliable and one unreliable unbounded fifo channel. While reachability is decidable for these systems, equipping them with the possibility of testing regular properties on the contents of channels makes it undecidable. Decidability ...