English
Related papers

Related papers: Demystifying Carleson Frames

200 papers

Let $E \subset \mathbb R^{n+1}$ be a parabolic uniformly rectifiable set. We prove that every bounded solution $u$ to $$\partial_tu- \Delta u=0, \quad \text{in} \quad \mathbb R^{n+1}\setminus E$$ satisfies a Carleson measure estimate…

Analysis of PDEs · Mathematics 2023-06-28 Simon Bortz , John Hoffman , Steve Hofmann , José Luis Luna Garcia , Kaj Nyström

In the present paper, we associate the techniques of the Lewy-Pinchuk reflection principle with the Behnke-Sommer continuity principle. Extending a so-called reflection function to a parameterized congruence of Segre varieties, we are led…

Complex Variables · Mathematics 2007-05-23 Joel Merker

We prove that for every k, there exists $c_k>0$ such that every graph G on n vertices not inducing a path $P_k$ and its complement contains a clique or a stable set of size $n^{c_k}$.

Combinatorics · Mathematics 2015-06-25 Nicolas Bousquet , Aurélie Lagoutte , Stéphan Thomassé

The Krasnoselskii-Mann iteration is an important algorithm in optimization and variational analysis for finding fixed points of nonexpansive mappings. In the general case, it produces a sequence converging \emph{weakly} to a fixed point…

Optimization and Control · Mathematics 2026-03-24 Sedi Bartz , Heinz H. Bauschke , Yuan Gao

For $k \ge 4$, a loose $k$-cycle $C_k$ is a hypergraph with distinct edges $e_1, e_2, \ldots, e_k$ such that consecutive edges (modulo $k$) intersect in exactly one vertex and all other pairs of edges are disjoint. Our main result is that…

Combinatorics · Mathematics 2025-01-29 Dhruv Mubayi , Lujia Wang

We transfer a large part of the circle of theorems characterizing the generalization of classical $H^\infty$ known as `weak* Dirichlet algebras', to Arveson's noncommutative setting of subalgebras of finite von Neumann algebras.

Operator Algebras · Mathematics 2007-05-23 David P. Blecher , Louis E. Labuschagne

We prove that for every $\varepsilon > 0$ there exists $n_0=n_0(\varepsilon)$ such that every regular oriented graph on $n > n_0$ vertices and degree at least $(1/4 + \varepsilon)n$ has a Hamilton cycle. This establishes an approximate…

Combinatorics · Mathematics 2023-09-15 Allan Lo , Viresh Patel , Mehmet Akif Yıldız

We say that a graph with $n$ vertices is $c$-Ramsey if it does not contain either a clique or an independent set of size $c \log n$. We define a CNF formula which expresses this property for a graph $G$. We show a superpolynomial lower…

Computational Complexity · Computer Science 2013-03-14 Massimo Lauria , Pavel Pudlák , Vojtěch Rödl , Neil Thapen

Continuum mechanics can be formulated in the Lagrangian frame (addressing motion of individual continuum particles) or in the Eulerian frame (addressing evolution of fields in an inertial frame). There is a canonical Hamiltonian structure…

Classical Physics · Physics 2020-05-20 Michal Pavelka , Ilya Peshkov , Vaclav Klika

We show that if $\varphi \colon \mathbb R\rightarrow\mathbb R$ is a continuous mapping and the set of nonlinearity of $\varphi$ has nonzero Lebesgue measure, then $\varphi$ maps bijectively a certain set that contains arbitrarily long…

Classical Analysis and ODEs · Mathematics 2018-09-19 Vladimir Lebedev

Matthew de Brecht raised the question of whether countable frames are continuous lattices. We prove that the continuity of a countable frame implies the quasicontinuity of its corresponding spectrum in the dual specialization order. We…

General Topology · Mathematics 2026-01-19 Xiaodong Jia , Xiaoyong Xi

It is proved that every normalized weakly null \sq\ has a sub\sq\ which is convexly unconditional. Further, an Hierarchy of summability methods is introduced and with this we give a complete classification of the complexity of weakly null…

Functional Analysis · Mathematics 2016-09-06 Spiros A. Argyros , S. Merkourakis , A. Tsarpalias

Frames for Hilbert spaces are interesting for mathematicians but also important for applications e.g. in signal analysis and in physics. Both in mathematics and physics it is natural to consider a full scale of spaces, and not only a single…

Functional Analysis · Mathematics 2024-07-09 Peter Balazs , Giorgia Bellomonte , Hessam Hosseinnezhad

The classical theorems of Mittag-Leffler and Weierstrass show that when $\{\lambda_n\}$ is a sequence of distinct points in the open unit disk $\D$, with no accumulation points in $\D$, and $\{w_n\}$ is any sequence of complex numbers,…

Complex Variables · Mathematics 2020-10-09 Javad Mashreghi , Marek Ptak , William T. Ross

Let $G$ be a real semisimple Lie group, $K$ its maximal complex subgroup, and $G_C$ its complexification. It is known that all the $K$-finite matrix elements on $G$ admit holomorphic continuation to branching functions on $G_C$ having…

Representation Theory · Mathematics 2012-11-28 Yury A- Neretin

Given any natural number $k$ and any dense point sequence $(t_n)$, we prove that the corresponding orthonormal spline system of order $k$ is an unconditional basis in reflexive $L^p$.

Functional Analysis · Mathematics 2015-03-04 Markus Passenbrunner

We show that one of the two important uncertainty principles derived by Maccone and Pati \textit{[Phys. Rev. Lett., 2014]} can be derived for arbitrary maps defined on subsets of $\mathcal{L}^p$ spaces for $1< p<\infty$. Our main tool is…

Functional Analysis · Mathematics 2024-02-14 K. Mahesh Krishna

An approach to find a weak form of shadowing is developed. We consider homeomorphisms of a compact metric space. It is proved that every pseudotrajectory with sufficiently small errors contains at least one subsequence that can be shadowed…

Dynamical Systems · Mathematics 2016-07-12 Danila Cherkashin , Sergey Kryzhevich

We prove that a sequence $(f_i)_{i=1}^\infty$ of translates of a fixed $f\in L_p(R)$ cannot be an unconditional basis of $L_p(R)$ for any $1\le p<\infty$. In contrast to this, for every $2<p<\infty$, $d\in N$ and unbounded sequence…

Functional Analysis · Mathematics 2012-09-21 D. Freeman , E. Odell , Th. Schlumprecht , A. Zsák

A graph is $k$-gap-planar if it has a drawing in the plane such that every crossing can be charged to one of the two edges involved so that at most $k$ crossings are charged to each edge. We show this class of graphs has linear expansion.…

Combinatorics · Mathematics 2025-10-21 David R. Wood