English
Related papers

Related papers: Hierarchical paraproducts

200 papers

Let $\mathcal C$ be the category of finite graphs. Lov\`{a}sz shows that the semi-ring of isomorphism classes of $\mathcal C$ (with coproduct as sum, and product as multiplication) is embedded into the direct product of the semi-ring of…

Category Theory · Mathematics 2022-07-14 Shoma Fujino , Makoto Matsumoto

CCS can be considered as a most natural extension of finite state automata in which interaction is made possible thanks to parallel composition. We propose here a similar extension for top-down tree automata. We introduce a parallel…

Logic in Computer Science · Computer Science 2013-06-10 Thomas Ehrhard , Ying Jiang

A mathematical method for constructing fractal curves and surfaces, termed the $p\lambda n$ fractal decomposition, is presented. It allows any function to be split into a finite set of fractal discontinuous functions whose sum is equal…

Statistical Mechanics · Physics 2015-12-15 Vladimir Garcia-Morales

Given a semilattice $X$ we study the algebraic properties of the semigroup $\upsilon(X)$ of upfamilies on $X$. The semigroup $\upsilon(X)$ contains the Stone-Cech extension $\beta(X)$, the superextension $\lambda(X)$, and the space of…

Group Theory · Mathematics 2012-12-19 Taras Banakh , Volodymyr Gavrylkiv

We address $L^p(\mu)\rightarrow L^p(\lambda)$ bounds for paraproducts in the Bloom setting. We introduce certain "sparse BMO" functions associated with sparse collections with no infinitely increasing chains, and use these to express sparse…

Classical Analysis and ODEs · Mathematics 2022-01-19 Valentia Fragkiadaki , Irina Holmes Fay

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…

Logic in Computer Science · Computer Science 2023-03-03 Pierre Ohlmann , Michał Pilipczul , Szymon Toruńczyk , Wojciech Przybyszewski

Parafermions of order two and three are shown to be the fundamental tool to construct superspaces related to cubic and quartic extensions of the Poincar\'e algebra. The corresponding superfields are constructed, and some of their main…

High Energy Physics - Theory · Physics 2011-08-17 R. Campoamor-Stursberg , M. Rausch de Traubenberg

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…

Data Structures and Algorithms · Computer Science 2022-04-26 Michael A. Bekos , Giordano Da Lozzo , Petr Hliněný , Michael Kaufmann

In this paper, we study the class ${\Sigma^{(m)}(p)}$ of meromorphic univalent functions $f$ in $\mathbb{D}$ with a pole of order ${m \geq 1}$ at $p \in (0,1)$, admitting a $k$-quasiconformal extension ($0 \leq k < 1$) to…

Complex Variables · Mathematics 2025-11-13 Molla Basir Ahamed , Partha Pratim Roy

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

Combinatorics · Mathematics 2021-01-27 Akshat Mudgal

We provide a simple recipe for obtaining all self-adjoint extensions, together with their resolvent, of the symmetric operator $S$ obtained by restricting the self-adjoint operator $A:\D(A)\subseteq\H\to\H$ to the dense, closed with respect…

Mathematical Physics · Physics 2008-03-28 Andrea Posilicano

We extend the decomposition conjecture to 2d quantum field theories with a gauged $\text{Rep}(H)$ symmetry category for $H$ a finite-dimensional semisimple Hopf algebra with $\text{Rep}(G)$ trivially-acting and $\text{Vec}(\Gamma)$ the…

High Energy Physics - Theory · Physics 2026-02-27 Alonso Perez-Lona

The paper deals with partitions of hypergraphs into induced subhypergraphs satisfying constraints on their degeneracy. Our hypergraphs may have multiple edges, but no loops. Given a hypergraph $H$ and a sequence $f=(f_1,f_2, \ldots, f_p)$…

Combinatorics · Mathematics 2018-04-19 Thomas Schweser , Michael Stiebitz

We prove that for every class $C$ of graphs with effectively bounded expansion, given a first-order sentence $\varphi$ and an $n$-element structure $\mathbb{A}$ whose Gaifman graph belongs to $C$, the question whether $\varphi$ holds in…

Discrete Mathematics · Computer Science 2018-05-10 Michał Pilipczuk , Sebastian Siebertz , Szymon Toruńczyk

The recently suggested bipartite analysis extends the Kauffman planar decomposition to arbitrary $N$, i.e. extends it from the Jones polynomial to the HOMFLY polynomial. This provides a generic and straightforward non-perturbative calculus…

High Energy Physics - Theory · Physics 2025-04-10 A. Anokhina , E. Lanina , A. Morozov

Let $A$, $B$ be separable C*-algebras, $B$ stable. Elements of the E-theory group $E(A,B)$ are represented by asymptotic homomorphisms from the second suspension of $A$ to $B$. Our aim is to represent these elements by (families of) maps…

Operator Algebras · Mathematics 2017-08-08 Vladimir Manuilov

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…

Symbolic Computation · Computer Science 2012-10-23 Changbo Chen , Marc Moreno Maza

Let $A$, $B$ be C*-algebras; $A$ separable, $B$ $\sigma$-unital and stable. We introduce a notion of translation invariance for asymptotic homomorphisms from $SA=C_0(\mathbb R)\otimes A$ to $B$ and show that the Connes-Higson construction…

Operator Algebras · Mathematics 2007-05-23 V. Manuilov , K. Thomsen

Expander decompositions form the basis of one of the most flexible paradigms for close-to-linear-time graph algorithms. Length-constrained expander decompositions generalize this paradigm to better work for problems with lengths, distances…

Data Structures and Algorithms · Computer Science 2024-05-16 Bernhard Haeupler , D Ellis Hershkowitz , Zihan Tan

A coproduct on a vector space $A$ is defined as a linear map $\Delta:A\to A\otimes A$ satisfying coassociativity $(\Delta\otimes\iota)\Delta=(\iota\otimes\Delta)\Delta$. We use $\iota$ for the identity map. If $G$ is a finite group and if…

Rings and Algebras · Mathematics 2024-02-08 Alfons Van Daele