Related papers: Hierarchical paraproducts
It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a…
For graded $C^*$-algebras $A$ and $B$, we construct a semigroup ${\cal AP}(A,B)$ out of asymptotic pairs. This semigroup is similar to the semigroup $\Psi(A,B)$ of unbounded KK-modules defined by Baaj and Julg and there is a map $\Psi(A,B)…
Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure $\lambda$-calculus, the process representations yield (at best) non-extensional $\lambda $-theories (i.e., $\beta$…
Let $A$ be a Hopf algebra over a field $K$ of characteristic 0 and suppose there is a coalgebra projection $\pi$ from $A$ to a sub-Hopf algebra $H$ that splits the inclusion. If the projection is $H$-bilinear, then $A$ is isomorphic to a…
The output of persistent homology is an algebraic object called a persistence module. This object admits a decomposition into a direct sum of interval persistence modules described entirely by the barcode invariant. In this paper we…
In this paper, we devote to extending structures for dendriform algebras. First, we define extending datums and unified products of dendriform algebras, and theoretically solve the extending structure problem. As an application, we consider…
Let $(X,\mathcal{E})$ be a hypergraph. A support is a graph $Q$ on $X$ such that for each $E\in\mathcal{E}$, the subgraph of $Q$ induced on the elements in $E$ is connected. We consider the problem of constructing a support for hypergraphs…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
Given any $f$ a locally finitely piecewise affine homeomorphism of $\Omega \subset \mathbb{R}^d$ onto $\Delta \subset \mathbb{R}^d$ (for $d=3, 4$) such that $f\in W^{1,p}(\Omega, \mathbb{R}^d)$ and $f^{-1}\in W^{1,q}(\Delta, \mathbb{R}^d)$,…
One perspective on tree decompositions is that they display (low-order) separations of the underlying graph or matroid. The separations displayed by a tree decomposition are necessarily nested. In 2013, Clark and Whittle proved the…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
For a projective variety $X$ defined over a non-Archimedean complete non-trivially valued field $k$, and a semipositive metrized line bundle $(L, \phi)$ over it, we establish a metric extension result for sections of $L^{\otimes n}$ from a…
Let $X$ and $Y$ be pseudocompact spaces and let the function $\Phi: X\times Y\to \mathbb R$ be separately continuous. The following conditions are equivalent: (1) there is a dense $G_\delta$ subset of $D\subset Y$ so that $\Phi$ is…
We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…
We re-examine all the contractions related with the ${\cal U}_q(su(2))$ deformed algebra and study the consequences that the contraction process has for their structure. We also show using ${\cal U}_q(su(2))\times{\cal U}(u(1))$ as an…
In this article, we show that the algorithm of maintaining expander decompositions in graphs undergoing edge deletions directly by removing sparse cuts repeatedly can be made efficient. Formally, for an $m$-edge undirected graph $G$, we say…
Length-constrained expander decompositions are a new graph decomposition that has led to several recent breakthroughs in fast graph algorithms. Roughly, an $(h, s)$-length $\phi$-expander decomposition is a small collection of length…
We present a variety of refined conditions for $\sigma$ algebras $\mathcal{A}$ (on a set $X$), $\mathcal{F}, \mathcal{G}$ (on a set $U$) such that the distributivity equation…
Our work shows forms of descent, in the fppf, h and \'{e}tale topologies, for strong generation of the bounded derived category of a noncommutative coherent algebra over a scheme. Even for (commutative) schemes this yields new perspectives.…
Given a locally finite graded set A and a commutative, associative operation on A that adds degrees, we construct a commutative multiplication * on the set of noncommutative polynomials in A which we call a quasi-shuffle product; it can be…