English
Related papers

Related papers: A generalised block decomposition theorem

200 papers

We introduce a construction called realisation which transforms posets into posets. We show that realisations share several key features with upper semilattices. For example, we define local dimensions of points in a poset and show that…

Algebraic Topology · Mathematics 2024-10-18 Wojciech Chacholski , Alvin Jin , Francesca Tombari

In this paper, we investigate in a unified way the structural properties of solutions to inverse problems. These solutions are regularized by the generic class of semi-norms defined as a decomposable norm composed with a linear operator,…

Information Theory · Computer Science 2013-05-22 M. J. Fadili , G. Peyré , S. Vaiter , C. Deledalle , J. Salmon

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

We give a generalization of the Jordan canonical form theorem for a class of bounded linear operators on complex separable Hilbert spaces in terms of direct integrals. Precisely, we study the uniqueness of strongly irreducible…

Functional Analysis · Mathematics 2011-09-28 Rui Shi

We develop a wide general theory of bilinear bi-parameter singular integrals $T$. First, we prove a dyadic representation theorem starting from $T1$ assumptions and apply it to show many estimates, including $L^p \times L^q \to L^r$…

Classical Analysis and ODEs · Mathematics 2020-05-20 Kangwei Li , Henri Martikainen , Emil Vuorinen

We use the notion of collapse of generalized indiscernible sequences to classify various model theoretic dividing lines. In particular, we use collapse of n-multi-order indiscernibles to characterize op-dimension n; collapse of…

Logic · Mathematics 2015-11-24 Vincent Guingona , Cameron Donnay Hill , Lynn Scow

We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…

Numerical Analysis · Mathematics 2025-06-25 Moritz Hauck , Alexei Lozinski , Roland Maier

Let $(\mathcal{G},\nu)$ be a $t$-discrete ergodic groupoid. Consider a finite Von Neumann algebra $\mathcal{M}$ with separable predual. We prove that every uniformly bounded measurable representation $\rho:\mathcal{G} \rightarrow…

Operator Algebras · Mathematics 2025-12-29 Alessio Savini

The paper is devoted to construction of some closed inductive sequence of models of the generalized second-order Dedekind theory of real numbers with exponentially increasing powers. These models are not isomorphic whereas all models of the…

Logic · Mathematics 2019-07-08 Valeriy K. Zakharov , Timofey V. Rodionov

In a previous paper we have constructed a compactification $KGl_n$ of the general linear group $Gl_n$, which in many respects is analogous to the so called wonderful compactification of adjoint semisimple algebraic groups as studied by De…

Algebraic Geometry · Mathematics 2007-05-23 Ivan Kausz

Let $P$ be a finite partially ordered set with unique minimal element $\hat{0}$. We study the Betti poset of $P$, created by deleting elements $q\in P$ for which the open interval $(\hat{0}, q)$ is acyclic. Using basic simplicial topology,…

Commutative Algebra · Mathematics 2014-07-23 Timothy B. P. Clark , Sonja Mapes

We study symmetric tensor decompositions, i.e. decompositions of the input symmetric tensor T of order 3 as sum of r 3rd-order tensor powers of u_i where u_i are vectors in \C^n. In order to obtain efficient decomposition algorithms, it is…

Data Structures and Algorithms · Computer Science 2025-03-12 Pascal Koiran , Subhayan Saha

Let $ \mathbb{A}$ be a cellular algebra over a field $\mathbb{F}$ with a decomposition of the identity $ 1_{\mathbb{A}} $ into orthogonal idempotents $ e_i$, $i \in I$ (for some finite set $I$) satisfying some properties. We describe the…

Representation Theory · Mathematics 2017-01-31 Mufida M. Hmaida

For any finite totally ordered set, the multisets of intervals form an abelian category. Various classes of subcategories admit natural combinatorial descriptions, and counting them yields familiar integer sequences. Surprisingly, in some…

Representation Theory · Mathematics 2026-02-02 Henning Krause , Balduin Stoye

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

Logic · Mathematics 2025-12-17 Álvaro Díaz Ramos , Garrett Ervin , Saharon Shelah

A framework to systematically decouple high order elliptic equations into combination of Poisson-type and Stokes-type equations is developed. The key is to systematically construct the underling commutative diagrams involving the complexes…

Numerical Analysis · Mathematics 2018-07-03 Long Chen , Xuehai Huang

We investigate the relationship between ideal membership of an operator and its pieces relative to several canonical types of partitions of the entries of its matrix representation with respect to a given orthonormal basis. Our main…

Functional Analysis · Mathematics 2021-03-17 Jireh Loreaux , Gary Weiss

We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…

Quantum Physics · Physics 2025-10-15 M. M. Fedin , A. A. Morozov

Let $X$ be a general complete intersection of a given multi-degree in a complex projective space. Suppose that the anti-canonical line bundle of $X$ is ample. Using the cylinder homomorphism associated with the family of complete…

Algebraic Geometry · Mathematics 2007-05-23 Ichiro Shimada

Many types of pairwise interaction take the form of a fixed set of nodes with edges that appear and disappear over time. In the case of discrete-time evolution, the resulting evolving network may be represented by a time-ordered sequence of…

Social and Information Networks · Computer Science 2019-04-10 Caterina Fenu , Desmond J. Higham