A note on generalized Poincaré-type inequalities with applications to weighted improved Poincaré-type inequalities

The main result of this paper supports a conjecture by C. P\'erez and E. Rela about the properties of the weight appearing in their recent self-improving result of generalized inequalities of Poincar\'e-type in the Euclidean space. The result we obtain does not need any condition on the weight, but still is not fully satisfactory, even though the result by P\'erez and Rela is obtained as a corollary of ours. Also, we extend the conclusions of their theorem to the range $p<1$. As an application of our result, we give a unified vision of weighted improved Poincar\'e-type inequalities in the Euclidean setting, which gathers both weighted improved classical and fractional Poincar\'e inequalities within an approach which avoids any representation formula. We obtain results related to some already existing results in the literature and furthermore we improve them in some aspects. Finally, we also explore analog inequalities in the context of metric spaces by means of the already known self-improving results in this setting.La Caixa gran

Boundary value problem for PDEs and some clases of L^p bounded pseudodifferential operators

In recent years much attention has been extended in the study of differential equations of non-classical types. These articles need, on one hand, fluid mechanics, hydro-and gas dynamics and other applied disciplines, and on the other hand, the actual needs of the mathematical sciences. One of the most important classes of equations of non-classical type is the third-order equation with multiple characteristics which is a generalization of linear Korteweg-de Vries-Burgers equation, special cases which occur in the dissemination of waves in weakly dispersive media, the propagation of waves in a cold plasma, magneto-hydrodynamics, problems of nonlinear acoustics, the hydrodynamic theory of space plasma. A pioneering work in the theory of odd order partial differential equations with multiple characteristics was done by E.Del Vecchio, H.Block, in which they studied the technique of constructing fundamental solutions of these equations. Consequently, the theory of equations with multiple characteristics has been greatly developed by the Italian mathematician L.Cattabriga. In the first part of Ph.D thesis we develop and study boundary value problems for third-order equations with multiple characteristics in areas with curved boundaries, as well as some properties of the fundamental solutions of the equations, when the transition line is a curve. In addition, we construct a solution of the Cauchy problem in the classes of functions growing at infinity, depending on the behaviour of the right-hand side of the equation. Our thesis explores both linear and nonlinear boundary value problems for linear and non-linear third-order equation with multiple characteristics in the domain with curved boundaries. The main result of the first chapter is to prove the unique solvability of the general boundary value problem for the third-order equation with multiple characteristics in curved domains. The proof of the uniqueness theorem of the solution, we use the method of energy integrals. For the existence theorem, we find equivalent systems of Volterra second type integral equations. The next chapter consists of three sections and it investigates the problem with nonlinear boundary conditions for linear and non-linear equations of the third order with multiple characteristics. To prove the existence and uniqueness theorems, we will use methods of integral energy and theory of integral equations. In the last part of the thesis we analyze basic properties of pseudodifferential operators, such as the behaviour of products and adjoins of such operators, their continuity on L^2, L^p and Sobolev spaces. In the thesis we study the L^p - boundedness of vector weighted pseudodifferential operators with symbols which have derivatives with respect to x only up to order k, in the Holder continuous sense

Embeddings of Besov spaces on fractal h-sets

Let $\Gamma$ be a fractal $h$-set and ${\mathbb{B}}^{{\sigma}}_{p,q}(\Gamma)$ be a trace space of Besov type defined on $\Gamma$. While we dealt in [9] with growth envelopes of such spaces mainly and investigated the existence of traces in detail in [12], we now study continuous embeddings between different spaces of that type on $\Gamma$. We obtain necessary and sufficient conditions for such an embedding to hold, and can prove in some cases complete characterisations. It also includes the situation when the target space is of type $L_r(\Gamma)$ and, as a by-product, under mild assumptions on the $h$-set $\Gamma$ we obtain the exact conditions on $\sigma$, $p$ and $q$ for which the trace space ${\mathbb{B}}^{{\sigma}}_{p,q}(\Gamma)$ exists. We can also refine some embedding results for spaces of generalised smoothness on $\mathbb R^n$

Two Geometric Results regarding Hölder-Brascamp-Lieb Inequalities, and Two Novel Algorithms for Low-Rank Approximation

Broadly speaking, this thesis investigates mathematical questions motivated by computer science. The involved topics include communication avoiding algorithms, classical analysis, convex geometry, and low-rank matrix approximation. In total, the thesis consists of four self-contained sections, each adapted from papers the author has been a part of.The first two sections are both motivated by the Brascamp-Lieb inequalities, which are also often referred to as Hölder-Brascamp-Lieb inequalities. These inequalities have featured prominently in recent theoretical computer science work, due to connections to geometric complexity theory, harmonic analysis, communication-avoidance, and many other areas. Moreover, work generalizing the inequalities in various ways, such as to nonlinear versions, has been impactful to the study of differential equations.Section 1 studies the application of Hölder-Brascamp-Lieb (HBL) inequalities to the design of communication optimal algorithms. In particular, it describes optimal tiling (blocking) strategies for nested loops that lack data dependencies and exhibit affine memory access patterns. The problem roughly amounts to maximizing the volume of an object provided some of its linear images have bounded volume. The methods used are algorithmic.Another reason for the interest in these inequalities is because they are an interesting test case for non-convex optimization techniques. The optimal constant for a particular instance of the inequality is given by solving a non-convex optimization problem that is still highly structured. Of particular relevance to this thesis is that it can be formulated as a geodesically-convex problem, considered in the context of the manifold of positive definite matrices of determinant $1$. Even using the methods of Section 1, the procedure is not necessarily polynomial time, and this motivates further study of geodesic convexity.This lead to the work of Section 2, which discusses a notion of halfspace for Hadamard manifolds that is natural in the context of convex optimization. For this notion of halfspace, we generalize a classic result of Grunbaum, which itself is a corollary of Helly's theorem. Namely, given a probability distribution on the manifold, there is a point for which all halfspaces based at this point have at least 1/(n+1) of the mass, n being the dimension of the manifold. As an application, the gradient oracle complexity of geodesic convex optimization is polynomial in the parameters defining the problem. In particular it is polynomial in -log(epsilon), where epsilon is the desired error. This is a step toward the open question of whether such an algorithm exists.The remaining two sections of the paper present a different research direction, randomized numerical linear algebra. Numerical linear algebra has long been an important part of scientific computing. Due to the current trend of increasing matrix sizes and growing importance of fast, approximate solutions in industry, randomized methods are quickly increasing in popularity. Sections 3 and 4 in this thesis aim to show that randomized low-rank approximation algorithms satisfy many of the properties of classical rank-revealing factorizations.Section 3 introduces a Generalized Randomized QR-decomposition (RURV) that may be applied to arbitrary products of matrices and their inverses, without needing to explicitly compute the products or inverses. This factorization is a critical part of a communication-optimal spectral divide-and-conquer algorithm for the nonsymmetric eigenvalue problem. In this paper, we establish that this randomized QR-factorization satisfies the strong rank-revealing properties. We also formally prove its stability, making it suitable in applications. Finally, we present numerical experiments which demonstrate that our theoretical bounds capture the empirical behavior of the factorization.Section 4 concerns a Generalized LU-Factorization (GLU) for low-rank matrix approximation. We relate this to past approaches and extensively analyze its approximation properties. The established deterministic guarantees are combined with sketching ensembles satisfying Johnson-Lindenstrauss properties to present complete bounds. Particularly good performance is shown for the sub-sampled randomized Hadamard transform (SRHT) ensemble. Moreover, the factorization is shown to unify and generalize many past algorithms. It also helps to explain the effect of sketching on the growth factor during Gaussian Elimination

Topics in singular analysis with applications to representation theory and to numerical analysis

[no abstract

Applications of regular variation and proximate orders to ultraholomorphic classes: asymptotic expansions and multisummability

El principal objetivo de esta memoria es dar respuesta a varias preguntas abiertas relativas a las clases ultraholomorfas de tipo Carleman-Roumieu de funciones, definidas en sectores de la superficie de Riemann del logaritmo mediante restricciones para el crecimiento de sus derivadas dadas en términos de una sucesión de números reales positivos. La principal motivación para este estudio es el análisis de las condiciones que permiten extender a estas clases el proceso de (multi)sumabilidad de series de potencias formales desarrollado por J. Écalle, J.-P. Ramis y W. Balser. Se ha profundizado significativamente en el conocimiento acerca de la inyectividad y la sobreyectividad de la aplicación de Borel, se han caracterizado las sucesiones para cuyas clases ultraholomorfas asociadas está disponible una extensión satisfactoria de la herramienta de k-sumabilidad y se ha presentado un método de multisumabilidad. La solución depende fuertemente de las teorías clásicas de variación regular y de órdenes aproximados.Departamento de Algebra, Geometría y TopologíaDoctorado en Matemática