English
Related papers

Related papers: Structural submodularity and tangles in abstract s…

200 papers

Menger's theorem says that, for $k\ge0$, if $S, T$ are sets of vertices in a graph $G$, then either there are $k + 1$ vertex-disjoint paths between $S$ and $T$, or there is a set X of at most $k$ vertices such that every $S$-$T$ path passes…

Combinatorics · Mathematics 2025-09-10 Tung Nguyen , Alex Scott , Paul Seymour

We study dualities between classes of relational topological structures, given by Hom-functors. We show that there exists a 2-element structure with infinitely many relations, which reconstructs all other structures generated by a 2-element…

Rings and Algebras · Mathematics 2012-12-18 Wiesław Kubiś , Krzysztof Pszczoła

A series of associative algebras $A_n(V)$ for a vertex operator algebra $V$ over an arbitrary algebraically closed field and nonnegative integers $n$ are constructed such that there is a one to one correspondence between irreducible…

Quantum Algebra · Mathematics 2016-11-22 Li Ren

We prove that the MSO+U logic is compositional in the following sense: whether an MSO+U formula holds in a tree T depends only on MSO+U-definable properties of the root of T and of subtrees of T starting directly below the root. Another…

Logic in Computer Science · Computer Science 2020-05-07 Paweł Parys

Suppose that $(x_s)_{s\in S}$ is a normalized family in a Banach space indexed by the dyadic tree $S$. Using Stern's combinatorial theorem we extend important results from sequences in Banach spaces to tree-families. More precisely,…

Functional Analysis · Mathematics 2013-05-21 Costas Poulios , Athanasios Tsarpalias

It is proved that a multiset of permissible arcs over a tiling is uniquely determined by its intersection vector under a mild condition. This generalizes a classical result over marked surfaces with triangulations. We apply this result to…

Representation Theory · Mathematics 2023-10-06 Changjian Fu , Shengfei Geng

This paper summarizes substantive new results derived by a student team (the first three authors) under the direction of the fourth author at the 2005 session of the KSU REU ``Brainstorming and Barnstorming''. The main results are a…

Quantum Algebra · Mathematics 2007-05-23 G. Ehrman , A. Gurpinar , M. Thibault , D. N. Yetter

The dimension of any module over an algebra of affiliated operators ${\mathcal U}$ of a finite von Neumann algebra ${\mathcal A}$ is defined using a trace on ${\mathcal A}.$ All zero-dimensional ${\mathcal U}$-modules constitute the torsion…

Rings and Algebras · Mathematics 2010-09-14 Lia Vas

We propose definitions of SVD, spectral decomposition (for self-adjoint matrices) and Jordan decomposition which make sense for all rings. For many rings, these decompositions can be shown to exist. For some specific rings, these…

Rings and Algebras · Mathematics 2021-12-21 Ran Gutin

We combine the two fundamental fixed-order tangle theorems of Robertson and Seymour into a single theorem that implies both, in a best possible way. We show that, for every $k \in \mathbb{N}$, every tree-decomposition of a graph $G$ which…

Combinatorics · Mathematics 2026-05-06 Sandra Albrechtsen

The ternary betweenness relation of a tree, B(x,y,z) expresses that y is on the unique path between x and z. This notion can be extended to order-theoretic trees defined as partial orders such that the set of nodes larger than any node is…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle

A family T of digraphs is a complete set of obstructions for a digraph H if for an arbitrary digraph G the existence of a homomorphism from G to H is equivalent to the non-existence of a homomorphism from any member of T to G. A digraph H…

Combinatorics · Mathematics 2010-06-24 Jan Foniok , Claude Tardif

We prove that $\mu=\mu^{<\mu}$, $2^\mu=\mu^+$ and ``there is a non reflecting stationary subset of $\mu^+$ composed of ordinals of cofinality $<\mu$'' imply that there is a $\mu$-complete Souslin tree on $\mu^+$.

Logic · Mathematics 2008-02-03 Menachem Kojman

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; the core companion of a theory $T$ is a model-complete core theory $S$ such that every model…

Logic · Mathematics 2025-12-25 Manuel Bodirsky , Bertalan Bodor , Paolo Marimon

We study structural and topological properties of nested set complexes of matroids with arbitrary building sets, proving that these complexes are vertex decomposable and admit convex ear decompositions. These results unify and generalize…

Combinatorics · Mathematics 2026-01-19 Basile Coron , Luis Ferroni , Shiyue Li

We study the structure of symplectic quandles, quandles which are also R-modules equipped with an antisymmetric bilinear form. We show that every finite dimensional symplectic quandle over a finite field F or arbitrary field F of…

Quantum Algebra · Mathematics 2007-09-20 Esteban Adam Navas , Sam Nelson

In this note we gather the theoretical outlines of three basic algorithms for tangles in abstract separation systems: a naive tree search for finding tangles; an algorithm which outputs a certificate for the non-existence of tangles if…

Combinatorics · Mathematics 2025-05-16 Christian Elbracht , Jay Lilian Kneip , Maximilian Teegen

We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…

Logic · Mathematics 2014-05-12 Mikolaj Bojanczyk , Christoph Dittmann , Stephan Kreutzer

A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…

Functional Analysis · Mathematics 2022-08-24 Marcel de Jeu , Jan Harm van der Walt

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle