English
Related papers

Related papers: Canonical forests in directed families

200 papers

We give two consistent constructions of trees $T$ whose finite power $T^{n+1}$ is sharply different from $T^n$: 1. An $\aleph_1$-tree $T$ whose interval topology $X_T$ is perfectly normal, but $(X_T)^2$ is not even countably metacompact. 2.…

Logic · Mathematics 2026-04-22 Ari Meir Brodsky , Assaf Rinot , Shira Yadai

The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems…

Combinatorics · Mathematics 2021-01-01 Péter L. Erdős , Claude Tardif , Gábor Tardos

The skew monoidal categories of Szlach\'anyi are a weakening of monoidal categories where the three structural laws of left and right unitality and associativity are not required to be isomorphisms but merely transformations in a particular…

Logic in Computer Science · Computer Science 2021-01-27 Tarmo Uustalu , Niccolò Veltri , Noam Zeilberger

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Combinatorics · Mathematics 2013-04-05 Adrian Ocneanu

The higher direct image complex of a coherent sheaf (or finite complex of coherent sheaves) under a projective morphism is a fundamental construction that can be defined via a Cech complex or an injective resolution, both inherently…

Algebraic Geometry · Mathematics 2007-05-23 David Eisenbud , Frank-Olaf Schreyer

We give a simple graph-theoretic proof of a classical result due to C. St. J. A. Nash-Williams on covering graphs by forests. Moreover we derive a slight generalisation of this statement where some edges are preassigned to distinct forests.

Combinatorics · Mathematics 2017-05-05 Christian Reiher , Lisa Sauermann

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

Combinatorics · Mathematics 2021-01-19 Jan Kurkofka , Ruben Melcher

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

Logic · Mathematics 2024-07-18 Pablo Andujar Guerrero , Will Johnson

We prove several structural results on definably compact groups G in o-minimal expansions of real closed fields, such as (i) G is definably an almost direct product of a semisimple group and a commutative group, and (ii) the group (G, .) is…

Logic · Mathematics 2008-11-04 Ehud Hrushovski , Ya'acov Peterzil , Anand Pillay

Recent advances in our understanding of higher derived limits carry multiple implications in the fields of condensed and pyknotic mathematics, as well as for the study of strong homology. These implications are thematically diverse,…

Algebraic Topology · Mathematics 2025-08-12 Jeffrey Bergfalk , Chris Lambie-Hanson

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor

We focus our attention on well-covered graphs that are vertex decomposable. We show that for many known families of these vertex decomposable graphs, the set of shedding vertices forms a dominating set. We then construct three new infinite…

Combinatorics · Mathematics 2018-08-29 Jonathan Baker , Kevin N. Vander Meulen , Adam Van Tuyl

While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence has proven more difficult to apply. One reason is the serious drawback of no longer having a concise and…

Algebraic Topology · Mathematics 2018-12-20 Mickaël Buchet , Emerson G. Escolar

We provide examples of groups which are indecomposable by direct product, and more generally which are uniquely decomposable in direct products of indecomposable groups. Examples include Coxeter groups, for which we give an alternative…

Group Theory · Mathematics 2009-06-10 Yves de Cornulier , Pierre de la Harpe

In classical set theory, the ordinals form a linear chain that we often think of as a very thin portion of the set-theoretic universe. In intuitionistic set theory, however, this is not the case and there can be incomparable ordinals. In…

Logic · Mathematics 2026-05-26 Shuwei Wang

The Fatou-Julia decomposition is significant in the study of iterations of holomorphic mappings. Such a decomposition can be also considered for foliations in a unified manner. Although the decomposition will be fundamental in the study, it…

Dynamical Systems · Mathematics 2019-09-18 Taro Asuke

We study the separable complementation property (SCP) and its natural variations in Banach spaces of continuous functions over compacta $K_{\mathcal A}$ induced by almost disjoint families ${\mathcal A}$ of countable subsets of uncountable…

Functional Analysis · Mathematics 2015-10-20 Jesús Ferrer , Piotr Koszmider , Wiesław Kubiś

We consider *-linear maps into a commutative C*-algebra C (X) of continuous functions on a locally compact Hausdorff space X with certain specified properties and prove two results: (1) an extension result for a class of *-linear maps Y -->…

Functional Analysis · Mathematics 2013-07-24 Ulrich Haag

Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…

Symbolic Computation · Computer Science 2026-05-07 Lucas Michel

Nuclear $C^*$-algebras having a system of completely positive approximations formed with convex combinations of a uniformly bounded number of order zero summands are shown to be approximately finite dimensional.

Operator Algebras · Mathematics 2020-05-28 Jorge Castillejos
‹ Prev 1 8 9 10 Next ›