相关论文: A poset-like approach to positive opetopes

In this article, we present a new characterization of the completeness of a partial metric space--which we call \textit{orbital characterization}-- using fixed point results.

Recently, J. D. Lawson encouraged the domain theory community to consider the scientific program of developing domain theory in the wider context of $T_0$ spaces instead of restricting to posets. In this paper, we respond to this calling…

The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…

The interplay between the two fundamental concepts of topological order and reflection positivity allows one to characterize the ground states of certain many-body Hamiltonians. We define topological order in an appropriate fashion and show…

Face alignment aims to estimate the locations of a set of landmarks for a given image. This problem has received much attention as evidenced by the recent advancement in both the methodology and performance. However, most of the existing…

This paper continues the study of the poset of eigenspaces of elements of a unitary reflection group (for a fixed eigenvalue), which was commenced in [6] and [5]. The emphasis in this paper is on the representation theory of unitary…

We introduce and study a new partial order on Dyck paths. We prove that these posets are meet-semilattices. We show that their numbers of intervals are the same as the number of bicubic planar maps. We describe an unexpected connection with…

Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative…

In this paper, we proposed a pose estimation system based on rendered image training set, which predicts the pose of objects in real image, with knowledge of object category and tight bounding box. We developed a patch-based multi-class…

Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

This work regards the order polytopes arising from the class of generalized snake posets and their posets of meet-irreducible elements. Among generalized snake posets of the same rank, we characterize those whose order polytopes have…

The face poset of the permutohedron realizes the combinatorics of linearly ordered partitions of the set $[n]=\{1,...,n\}$. Similarly, the cyclopermutohedron is a virtual polytope that realizes the combinatorics of cyclically ordered…

The paper studies differentially positive systems, that is, systems whose linearization along an arbitrary trajectory is positive. We illustrate the use of differential positivity on compact forward invariant sets for the characterization…

Due to the fundamental works of T. Ando, W. Szyma\'nski, F. H. Szafraniec, and many others it is well known that sesquilinear forms play an important role in dilation theory. The crucial fact is that every positive definite operator…

This paper initiates the study of picture fuzzy topological spaces. In order to develop a mechanism to construct picture fuzzy topological spaces, we prove some basic results related to picture fuzzy sets together with the introduction of…

We propose and develop a theory that allows to characterize epimorphisms of profinite groups in terms of indecomposable epimorphisms.

Let X be a finite set. This paper describes some topological and combinatorial properties of the poset \Omega_X of order relations on X. In particular, the homotopy type of all the intervals in \Omega_X is precisely determined, and the…

We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.

In this paper we give an algorithm to determine, for any given suborder closed class of series-parallel posets, a structure theorem for the class. We refer to these structure theorems as structural descriptions.