On the algorithmic complexity of twelve covering and independence parameters of graphs

The definitions of four previously studied parameters related to total coverings and total matchings of graphs can be restricted, thereby obtaining eight parameters related to covering and independence, each of which has been studied previously in some form. Here we survey briefly results concerning total coverings and total matchings of graphs, and consider the aforementioned 12 covering and independence parameters with regard to algorithmic complexity. We survey briefly known results for several graph classes, and obtain new NP-completeness results for the minimum total cover and maximum minimal total cover problems in planar graphs, the minimum maximal total matching problem in bipartite and chordal graphs, and the minimum independent dominating set problem in planar cubic graphs

Three-points interfacial quadrature for geometrical source terms on nonuniform grids

International audienceThis paper deals with numerical (finite volume) approximations, on nonuniform meshes, for ordinary differential equations with parameter-dependent fields. Appropriate discretizations are constructed over the space of parameters, in order to guarantee the consistency in presence of variable cells' size, for which $L^p$-error estimates, $1\le p < +\infty$, are proven. Besides, a suitable notion of (weak) regularity for nonuniform meshes is introduced in the most general case, to compensate possibly reduced consistency conditions, and the optimality of the convergence rates with respect to the regularity assumptions on the problem's data is precisely discussed. This analysis attempts to provide a basic theoretical framework for the numerical simulation on unstructured grids (also generated by adaptive algorithms) of a wide class of mathematical models for real systems (geophysical flows, biological and chemical processes, population dynamics)

Electrical networks and Stephenson's conjecture

In this paper, we consider a planar annulus, i.e., a bounded, two-connected, Jordan domain, endowed with a sequence of triangulations exhausting it. We then construct a corresponding sequence of maps which converge uniformly on compact subsets of the domain, to a conformal homeomorphism onto the interior of a Euclidean annulus bounded by two concentric circles. As an application, we will affirm a conjecture raised by Ken Stephenson in the 90's which predicts that the Riemann mapping can be approximated by a sequence of electrical networks.Comment: Comments are welcome

Wave Front Sets of Reductive Lie Group Representations

If $G$ is a Lie group, $H\subset G$ is a closed subgroup, and $\tau$ is a unitary representation of $H$, then the authors give a sufficient condition on $\xi\in i\mathfrak{g}^*$ to be in the wave front set of $\operatorname{Ind}_H^G\tau$. In the special case where $\tau$ is the trivial representation, this result was conjectured by Howe. If $G$ is a real, reductive algebraic group and $\pi$ is a unitary representation of $G$ that is weakly contained in the regular representation, then the authors give a geometric description of $\operatorname{WF}(\pi)$ in terms of the direct integral decomposition of $\pi$ into irreducibles. Special cases of this result were previously obtained by Kashiwara-Vergne, Howe, and Rossmann. The authors give applications to harmonic analysis problems and branching problems.Comment: Accepted to Duke Mathematical Journa

A Polynomial Spectral Calculus for Analysis of DG Spectral Element Methods

We introduce a polynomial spectral calculus that follows from the summation by parts property of the Legendre-Gauss-Lobatto quadrature. We use the calculus to simplify the analysis of two multidimensional discontinuous Galerkin spectral element approximations

Self-Evaluation Applied Mathematics 2003-2008 University of Twente

This report contains the self-study for the research assessment of the Department of Applied Mathematics (AM) of the Faculty of Electrical Engineering, Mathematics and Computer Science (EEMCS) at the University of Twente (UT). The report provides the information for the Research Assessment Committee for Applied Mathematics, dealing with mathematical sciences at the three universities of technology in the Netherlands. It describes the state of affairs pertaining to the period 1 January 2003 to 31 December 2008