Matemáticas: Envíos recientes
Mostrando ítems 61-80 de 335
-
Ponencia
Composition operators on the weighed Bergman-Nevanlinna classes
(Editorial Universidad de Sevilla, 2005)In this paper we use an α-Carleson measure and a vanishing Carleson measure to characterize bounded and compact composition operators on weighted Bergman-Nevanlinna spaces.
-
Ponencia
Operators on Lp and the role of the image of the unit ball
(Editorial Universidad de Sevilla, 2005)Let p ∈ [1, +∞] such that its conjugate exponent q is not an even integer and let T be an operator defined on Lp(λ) with ...
-
Ponencia
Composition operators with linear fractional smbols and their adjoints
(Editorial Universidad de Sevilla, 2005)We characterize all linear fractional maps of the disk into itself in terms of their coefficients. We also prove the formula ...
-
Ponencia
Toeplitz operators and division by inner functions
(Editorial Universidad de Sevilla, 2005)A subspace X of the Hardy space H1 is said to have the K-property if for any ψ ∈ H∞, the Toeplitz operator Tψ maps X into ...
-
Ponencia
Banach algebras with trivial cohomology
(Editorial Universidad de Sevilla, 2005)A plausible conjecture is that Banach algebras with trivial cohomology have to be semisimple and finite dimensional. In ...
-
Ponencia
A parametrization for the symbols of a Hankel type operator
(Editorial Universidad de Sevilla, 2005)Hankel operators and their symbols, as generalized by V. Pták and P. Vrbová, are considered. In this more general framework, ...
-
Ponencia
Volterra operators on spaces of analytic functions - a survey
(Editorial Universidad de Sevilla, 2005)We give a short and selective account of results known about operators of the form Vg(f)(z) = 1/z Z z 0 f(ζ)g0 (ζ) dζ, where g is analytic on the disc and the operator Tg = zVg acts on spaces of analytic functions.
-
Ponencia
Invariant subspaces of translation semigroups
(Editorial Universidad de Sevilla, 2005)In these lectures I shall give an account of some recent results and open problems relating to subspaces of square integrable ...
-
Ponencia
How large is a Riemann surface: the type problem
(Editorial Universidad de Sevilla, 2005)The uniformization theorem asserts that a simply-connected non-compact Riemann surface S is conformally equivalent to ...
-
Ponencia
Analytic contractions and boundary behaviour - an overview
(Editorial Universidad de Sevilla, 2005) - Ponencia
-
Ponencia
Flips in combinatorial pointed pseudo-triangulations with face degree at most four
(2013)In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or ...
-
Ponencia
Monotone crossing number of complete graphs
(2013)In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1/4 n-1/2/2 n−2/2 ...
-
Ponencia
On 4-connected geometric graphs
(2013)Given a set S of n points in the plane, in this paper we give a necessary and sometimes sufficient condition to build a 4-connected non-crossing geometric graph on S.
-
Ponencia
Phase transitions in the Ramsey-Turán theory
(2013)Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an L-free graph on n ...
-
Ponencia
The alternating path problem revisited
(2013)It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric ...
-
Ponencia
Witness bar visibility
(2013)Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ...
-
Ponencia
On making a graph crossing-critical
(2013)A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that ...
-
Ponencia
On three parameters of invisibility graphs
(2013)The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the points of X and two ...
-
Ponencia
Improved enumeration of simple topological graphs
(2013)A simple topological graph T = (V (T ), E(T )) is a drawing of a graph in the plane where every two edges have at most one ...