English
Related papers

Related papers: An Improved Composition Theorem of a Universal Rel…

200 papers

We study the optimal conditions on a homeomorphism $f:\Omega\subset \R^n\to \R^n$ to guarantee that the composition $u\circ f$ belongs to the space of functions of bounded variation for every function $u$ of bounded variation. We show that…

Analysis of PDEs · Mathematics 2020-01-07 Luděk Kleprlík

We prove that the composition of a quasi-nearly subharmonic function and a quasiregular mappings of bounded multiplicity is quasi-nearly subharmonic. Also, we prove that if $u\circ f$ is quasi-nearly subharmonic for all quasi-nearly…

Functional Analysis · Mathematics 2011-03-09 Pekka Koskela , Vesna Manojlović

A uniformly bounded complete orthonormal system of functions $\Theta =\{ \theta_n\}_{n=1}^{\infty},$ $ \|\theta_n\|_{L^\infty_{[0,1]} } \leq M $ is constructed such that $\sum_{n=1}^{\infty} a_{n}\theta_{n}$ converges almost everywhere on…

Classical Analysis and ODEs · Mathematics 2019-12-30 K. S. Kazarian

We consider correlation functions of topologically twisted, $\mathcal{N}=2$ supersymmetric Yang-Mills theory with gauge group ${\rm SU}(2)$ and $N_f\leq 3$ massive hypermultiplets in the fundamental representation. For a smooth, compact,…

High Energy Physics - Theory · Physics 2026-02-25 Elias Furrer , Jan Manschot

Let $P_{2k}$ be a homogeneous polynomial of degree $2k$ and assume that there exist $C>0$, $D>0$ and $\alpha \ge 0$ such that \begin{equation*} \left\langle P_{2k}f_{m},f_{m}\right\rangle_{L^2(\mathbb{S}^{d-1})}\geq \frac{1}{C\left(…

Complex Variables · Mathematics 2022-09-08 H. Render , J. M. Aldaz

We prove a structure theorem for the Gromov-Witten invariants of compact Kahler surfaces with geometric genus $p_g>0$. Under the technical assumption that there is a canonical divisor that is a disjoint union of smooth components, the…

Symplectic Geometry · Mathematics 2007-05-23 Junho Lee , Thomas H. Parker

A \emph{composition} is a sequence of positive integers, called \emph{parts}, having a fixed sum. By an \emph{$m$-congruence succession}, we will mean a pair of adjacent parts $x$ and $y$ within a composition such that $x\equiv y(\text{mod}…

Combinatorics · Mathematics 2013-07-30 Toufik Mansour , Mark Shattuck , Mark C. Wilson

Let $[a,b]\subset\mathbb{R}$ be a non empty and non singleton closed interval and $P=\{a=x_0<\cdots<x_n=b\}$ is a partition of it. Then $f:I\to\mathbb{R}$ is said to be a function of $r$-bounded variation, if the expression…

General Mathematics · Mathematics 2023-06-07 Angshuman R. Goswami

A keyring is a graph obtained from a cycle by appending $r\ge0$ leaves to one of its vertices. Sidorenko proved an Erd\H{o}s-Gallai-type theorem: Every graph of order $n$ and size more than $\frac{(k-1)n}{2}$ contains a keyring of size at…

Combinatorics · Mathematics 2019-10-08 Xinmin Hou , Xiaodong Xue

Kim, K\"uhn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Koml\'os, S\'ark\"ozy and Szemer\'edi by proving a `blow-up lemma for approximate decompositions' which states…

Combinatorics · Mathematics 2020-01-13 Stefan Ehard , Felix Joos

We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…

Computational Complexity · Computer Science 2021-03-10 Kaspars Balodis

A Hilbert space operator $U$ is called universal (in the sense of Rota) if every Hilbert space operator is similar to a multiple of $U$ restricted to one of its invariant subspaces. It follows that the Invariant Subspace Problem for Hilbert…

Functional Analysis · Mathematics 2021-01-22 João R. Carmo , S. Waleed Noor

We conjecture the connection between $su$ and $so$ members of universal, in Vogel's sense, multiplets. The key element is the notion of the {\it vertical componentwise sum} $\oplus_v$ of Young diagrams. Representations in the decomposition…

High Energy Physics - Theory · Physics 2025-09-18 R. L. Mkrtchyan

A new method of composition orthogonality is introduced. It is applied to generate new sequences of orthogonal polynomials and functions. In particular, classical orthogonal polynomials are interpreted in the sense of composition…

Classical Analysis and ODEs · Mathematics 2021-03-05 Semyon Yakubovich

We study the profile $X_{n,k}$ of random search trees including binary search trees and $m$-ary search trees. Our main result is a functional limit theorem of the normalized profile $X_{n,k}/\mathbb{E}X_{n,k}$ for $k=\lfloor\alpha\log…

Probability · Mathematics 2008-01-28 Michael Drmota , Svante Janson , Ralph Neininger

By means of hypercyclic operator theory, we complement our previous results on hypercyclic holomorphic maps between complex Euclidean spaces having slow growth rates,by showing {\it abstract abundance} rather than {\it explicit existence}.…

Complex Variables · Mathematics 2024-09-24 Bin Guo , Song-Yan Xie

We present a categorical theory of the composition methods in finite model theory -- a key technique enabling modular reasoning about complex structures by building them out of simpler components. The crucial results required by the…

Logic in Computer Science · Computer Science 2023-04-26 Tomáš Jakl , Dan Marsden , Nihil Shah

In the renormalisation analysis of critical phenomena in quasi-periodic systems, a fundamental role is often played by fixed points of functional recurrences of the form \begin{equation*} f_{n}(x) = \sum_{i=1}^\ell a_i(x) f_{n_i}…

Dynamical Systems · Mathematics 2013-11-12 Paul Verschueren , Ben D. Mestel

We prove a functional limit theorem for vector-valued functionals of the fractional Ornstein-Uhlenbeck process, providing the foundation for the fluctuation theory of slow/fast systems driven by such a noise. Our main contribution is on the…

Probability · Mathematics 2023-03-07 Johann Gehringer , Xue-Mei Li

Boolean function $F(x,y)$ for $x,y \in \{0,1\}^n$ is an XOR function if $F(x,y)=f(x\oplus y)$ for some function $f$ on $n$ input bits, where $\oplus$ is a bit-wise XOR. XOR functions are relevant in communication complexity, partially for…

Computational Complexity · Computer Science 2024-06-04 Vladimir V. Podolskii , Dmitrii Sluch