Related papers: Order Preserving Maps of Posets

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

We prove that every not necessarily bounded poset P=(P,\le,') with an antitone involution can be extended to a residuated poset E(P)=(E(P),\le,\odot,\rightarrow,1) where x'=x\rightarrow0 for all x\in P. If P is a lattice with an antitone…

Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…

We redevelop persistent homology (topological persistence) from a categorical point of view. The main objects of study are diagrams, indexed by the poset of real numbers, in some target category. The set of such diagrams has an interleaving…

Characterization of medium-range order in amorphous materials and its relation to short-range order is discussed. A new topological approach is presented here to extract a hierarchical structure of amorphous materials, which is robust…

Let $\mathbb F$ be a field and $P \in \mathbb F [x_1,\ldots, x_n]$ be a homogeneous polynomial such that $|\mathbb F| > \deg(P)$ and $\phi, \psi\colon \mathbb F^n \to \mathbb F^n$ be two maps such that $P(\mathbf{x} + \lambda\mathbf{y}) =…

For a finite distributive lattice $D$, let us call $Q \subseteq D$ \emph{principal congruence representable}, if there is a finite lattice $L$ such that the congruence lattice of $L$ is isomorphic to $D$ and the principal congruences of $L$…

Fix two lattice paths $P$ and $Q$ from $(0,0)$ to $(m,r)$ that use East and North steps with $P $ never going above $Q$. Bonin et al. show that the lattice paths that go from $(0,0)$ to $(m,r)$ and remain bounded by $P$ and $Q$ can be…

We investigate the poset (P(X),\subset), where P(X) is the set of isomorphic suborders of a countable ultrahomogeneous partial order X. For X different from (resp. equal to) a countable antichain the order types of maximal chains in…

We provide a natural characterisation for the sets of elliptic and hyperbolic hyperplanes of the parabolic quadric Q(2n,q) when q is even. This characterisation is based on the number of elements of these sets through points and codimension…

We establish the homological foundations for studying polynomially bounded group cohomology, and show that the natural map from PH^*(G;Q) to H^*(G;Q) is an isomorphism for a certain class of groups.

P\'olya's enumeration theorem is concerned with counting labeled sets up to symmetry. Given a finite group acting on a finite set of labeled elements it states that the number of labeled sets up to symmetry is given by a polynomial in the…

Let H and K be infinite dimensional Hilbert spaces, while B(H) and B(K) denote the algebras of all linear bounded operators on H and K, respectively. We characterize the forms of additive mappings from B(H) into B(K) that preserve the…

We show that for each fixed non-constant complex polynomial $P$ of the plane there exists a homeomorphism $h$ such that $P\circ h$ is a Lipschitz quotient mapping. This corrects errors in the construction given earlier by Johnson et. al.…

Let $G$ be a compact and connected Lie group and $PU(\mathcal H)$ be the group of projective unitary operators on a separable Hilbert space $\mathcal H$ endowed with the strong operator topology. We study the space $hom_{st}(G, PU(\mathcal…

We define a partial order on the set of pairs {(O,C)}, where O is a nilpotent orbit and C is a conjugacy class in Lusztig's canonical quotient of A(O). We then show that there is a unique order-reversing duality map on this set that has…

For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…

This paper presents combinatorial facts dealing with the number of unlabeled partially ordered sets (posets) refined by the number of arcs in the Hasse diagram (sequence A342447 in OEIS). The main result is that the differences with respect…

We specialize Schm\"udgen's Positivstellensatz and its Putinar and Jacobi and Prestel refinement, to the case of a polynomial $f\in R[X,Y]+R[Y,Z]$, positive on a compact basic semi algebraic set $K$ described by polynomials in $R[X,Y]$ and…

For two posets $P$ and $Q$, we say $Q$ is $P$-free if there does not exist any order-preserving injection from $P$ to $Q$. The speical case for $Q$ being the Boolean lattice $B_n$ is well-studied, and the optiamal value is denoted as…