Related papers: On chains in $H$-closed topological pospaces

For a finite group G with subgroup H the Chermak-Delgado measure of H in G refer to the product of the order of H with the order of its centralizer, C_G(H). The set of all subgroups with maximal Chermak-Delgado measure form a sublattice,…

A matching of graph $G$ is maximal if it cannot be expanded by adding any edge to create a larger matching. In this paper, for a hexagonal ring $H$ with $n$ hexagons, we show that the number of maximal matchings of $H$ equals to the trace…

Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…

A hemiimplicative semilattice is a bounded semilattice $(A, \wedge, 1)$ endowed with a binary operation $\to$, satisfying that for every $a, b, c \in A$, $a \leq b \to c$ implies $a \wedge b \leq c$ (that is to say, one of the conditionals…

Half graphs and their variants, such as ladders, semi-ladders and co-matchings, are combinatorial objects that encode total orders in graphs. Works by Adler and Adler (Eur. J. Comb.; 2014) and Fabia\'nski et al. (STACS; 2019) prove that in…

We study the interplay between three weak topologies on a topological semilattice $X$: the weak$^\circ$ topology $\mathcal W^\circ_X$ (generated by the base consiting of open subsemilattices of $X$), the weak$^\bullet$ topology $\mathcal…

Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality, and restriction of the distance to finite chains may or may not coincide with the…

Let h : R $\rightarrow$ R+ be a lower semi-continuous subbadditive and even function such that h(0) = 0 and h($\theta$) $\ge$ $\alpha$|$\theta$| for some $\alpha$ > 0. The h-mass of a k-polyhedral chain P =$\sum$j $\theta$j$\sigma$j in R n…

On an arbitrary meet-semilattice S with 0 we define an orthogonality relation and investigate the lattice Cl(S) of all subsets of S closed under this orthogonality. We show that if S is atomic then Cl(S) is a complete atomic Boolean…

In this note, we give sufficient conditions for the (semi)stability of a hypersurface $H$ of $\mathbb{P}^N_k$ in terms of its degree $d$, the maximal multiplicity $\delta$ of its singularities, and the dimension $s$ of its singular locus.…

Let H_1 and H_2 be complex Hilbert spaces, L_1=P(H_1) and L_2=P(H_2) the lattices of closed subspaces, and let L be a complete atomistic lattice. We prove under some weak assumptions relating L_i and L, that if L admits an…

We consider holomorphic semicocycles on the open unit ball in a Banach space taking values in a Banach algebra. We establish criteria for a semicocycle to be linearizable, that is, cohomologically equivalent to one independent of the…

We investigate higher dimensional chain conditions, where the largeness notion is given by Fubini products of a given ideal. From strong saturation properties of an ideal, we derive abstractly versions of higher dimensional $\Delta$-system…

In 1967 Wolk proved that every well partial order (wpo) has a maximal chain; that is a chain of maximal order type. (Note that all chains in a wpo are well-ordered.) We prove that such maximal chain cannot be found computably, not even…

We investigate theoretically the topological properties of dimerized quasi-one-dimensional (1D) lattice comprising of multi legs $(L)$ as well as multi sublattices $(R)$. The system has main and subsidiary exchange symmetries. In the basis…

J. Y. Hyun, et al. (Des. Codes Cryptogr., vol. 88, pp. 2475-2492, 2020) constructed some optimal and minimal binary linear codes generated by one or two order ideals in hierarchical posets of two levels. At the end of their paper, they left…

A finite ranked poset is called a symmetric chain order if it can be written as a disjoint union of rank-symmetric, saturated chains. If $P$ is any symmetric chain order, we prove that $P^n/\mathbb{Z}_n$ is also a symmetric chain order,…

The two closely related Lorentz-invariant partial orders of space-time are distinguished with respect to the existence of antichain cutsets and the possibility of grading. World lines of particles with or without mass are the maximal chains…

Two structures are said to be equimorphic if each embeds in the other. Such structures cannot be expected to be isomorphic, and in this paper we investigate the special case of linear orders, here also called chains. In particular we…

We propose the realization of topological quantum states with cold atoms trapped in an optical lattice. We discuss an experimental setup that generates a two-dimensional hexagonal lattice in the presence of a light-induced periodic vector…