English
Related papers

Related papers: Transporting continuity properties from a poset to…

200 papers

In a coherent category, the posets of subobjects have very strong properties. We emphasize the validity of these properties, in general categories, for well-behaved classes of subobjects. As an example of application, we investigate the…

Category Theory · Mathematics 2022-10-27 Francis Borceux , Maria Manuel Clementino

In this paper, we introduce the notion of $\mathcal{M}$-convergence and $\mathcal{MN}$-convergence structures in posets, which, in some sense, generalise the well-known Scott-convergence and order-convergence structures. As results, we give…

General Topology · Mathematics 2018-03-20 Hadrian Andradi , Weng Kin Ho

A poset is a containment of paths in a tree (CPT) if it admits a representation by containment where each element of the poset is represented by a path in a tree and two elements are comparable in the poset if and only if the corresponding…

Discrete Mathematics · Computer Science 2022-04-12 Liliana Alcón , Martin Charles Golumbic , Noemí Gudiño , Marisa Gutierrez , Vincent Limouzy

The NP-complete Permutation Pattern Matching problem asks whether a permutation P (the pattern) can be matched into a permutation T (the text). A matching is an order-preserving embedding of P into T. In the Generalized Permutation Pattern…

Computational Complexity · Computer Science 2013-01-15 Marie-Louise Bruner , Martin Lackner

We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…

Combinatorics · Mathematics 2013-01-18 Martin Dlugosch

We explore excitation transport within a one-dimensional chain of atoms where the atomic transition dipoles are coupled to the free radiation field. When the atoms are separated by distances smaller or comparable to the wavelength of the…

Quantum Physics · Physics 2019-09-04 Jemma A. Needham , Igor Lesanovsky , Beatriz Olmos

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

Combinatorics · Mathematics 2020-12-23 Matthew McDevitt , Nik Ruskuc

Let ${\mathscr P}$ be a topological property. We say that a space $X$ is ${\mathscr P}$-connected if there exists no pair $C$ and $D$ of disjoint cozero-sets of $X$ with non-${\mathscr P}$ closure such that the remainder $X\backslash(C\cup…

General Topology · Mathematics 2015-06-26 M. R. Koushesh

The Self-Optimal-Transport (SOT) feature transform is designed to upgrade the set of features of a data instance to facilitate downstream matching or grouping related tasks. The transformed set encodes a rich representation of high order…

Computer Vision and Pattern Recognition · Computer Science 2022-04-08 Daniel Shalam , Simon Korman

The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…

Algebraic Topology · Mathematics 2020-04-23 Manuel Norman

A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for…

Combinatorics · Mathematics 2016-02-11 Michael E. Hoffman

We prove two theorems which allow one to recognize indecomposable subcontinua of closed surfaces without boundary. If $X$ is a subcontinuum of a closed surface $S$, we call the components of $S \setminus X$ the complementary domains of $X$.…

General Topology · Mathematics 2010-07-01 Clinton P. Curry

A poset P is called reversible if every order preserving bijective self map of P is an order automorphism. P is called hereditarily reversible if every subposet of P is reversible. We give a complete characterization of hereditarily…

Combinatorics · Mathematics 2013-05-23 Michał Kukieła

Algebraic persistence studies persistence modules (typically, linear representations of the poset $\mathbf{R}^n$ with $n \geq 1$) and the algebraic relationships between persistence modules that are interleaved. The notion of…

Representation Theory · Mathematics 2025-06-24 Ulrich Bauer , Luis Scoccola

We propose a generalization of continuous lattices and domains through the concept of enriched closure space, defined as a closure space equipped with a preclosure operator satisfying some compatibility conditions. In this framework we are…

Logic in Computer Science · Computer Science 2017-05-16 Paul Poncet

In this paper, we discuss a novel model reduction framework for generalized linear systems. The transfer functions of these systems are assumed to have a special structure, e.g., coming from second-order linear systems and time-delay…

Numerical Analysis · Mathematics 2019-10-31 Peter Benner , Pawan Goyal , Igor Pontes Duff

We show that for each property $\mathsf{P}\in \{\mathsf{OP}, \mathsf{IP}, \mathsf{TP}_1, \mathsf{TP}_2, \mathsf{ATP}, \mathsf{SOP}_3\}$ there is a poset $\Sigma_{\mathsf{P}}$ such that a theory has property $\mathsf{P}$ if and only if some…

Logic · Mathematics 2022-09-02 Darío García , Rosario Mennuni

Necessary conditions for asymptotic stability and stabilizability of subsets for dynamical and control systems are obtained. The main necessary condition is homotopical and is in turn used to obtain a homological one. A certain extension is…

Dynamical Systems · Mathematics 2022-11-15 Matthew D. Kvalheim

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Logic · Mathematics 2019-02-01 Rob Egrot

Construction of signal sets with low correlation property is of interest to designers of CDMA systems. One of the preferred ways of constructing such sets is the interleaved construction which uses two sequences a and b with 2-level…

Information Theory · Computer Science 2007-07-13 N Rajesh Pillai , Yogesh Kumar