<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-17T02:33:29Z</responseDate>
  <request identifier="1879" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:1879</identifier>
        <datestamp>2024-03-06T11:08:29Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Time-Frequency Analysis and PDE's</dc:title>
          <dc:creator>Tabacco, Anita</dc:creator>
          <dc:subject>Fourier multipliers</dc:subject>
          <dc:subject>modulation spaces</dc:subject>
          <dc:subject>short-time Fourier transform</dc:subject>
          <dc:description>We study the action on modulation spaces of Fourier multipliers with symbols&#13;
$e^{imu(xi)}$, for real-valued functions $mu$ having unbounded second&#13;
derivatives. We show that if $mu$ satisfies the usual symbol estimates of order&#13;
$alphageq2$, or if $mu$ is a positively homogeneous function of degree $alpha$,&#13;
the corresponding Fourier multiplier is bounded as an operator between the weighted modulation spaces $mathcal{M}^{p,q}_delta$ and $mathcal{M}^{p,q}$,&#13;
for every $1leq p,qleqinfty$ and $deltageq d(alpha-2)|frac{1}{p}-frac{1}{2}|$.&#13;
Here $delta$ represents the loss of derivatives. The above threshold is shown to&#13;
be sharp for {it all} homogeneous functions $mu$ whose Hessian matrix is&#13;
non-degenerate at some point.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Anita Tabacco</dc:contributor>
          <dc:date>2009</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 8492, Structured Decompositions and Efficient Algorithms (2009)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.08492.10</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-18792</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08492.10</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
