scholarly journals Some remarks concerning semi-T1/2 spaces

Filomat ◽  
2014 ◽  
Vol 28 (1) ◽  
pp. 21-25 ◽  
Author(s):  
Vitalij Chatyrko ◽  
Sang-Eon Han ◽  
Yasunao Hattori
Keyword(s):  
Positive Integer ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered ◽  
Basic Properties

In this paper we prove that each subspace of an Alexandroff T0-space is semi-T1/2. In particular, any subspace of the folder Xn, where n is a positive integer and X is either the Khalimsky line (Z, ?K), the Marcus-Wyse plane (Z2, ?MW) or any partially ordered set with the upper topology is semi-T1/2. Then we study the basic properties of spaces possessing the axiom semi-T1/2 such as finite productiveness and monotonicity.

scholarly journals SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, II.

2003 ◽  
Vol 13 (05) ◽  
pp. 543-564 ◽  
Author(s):  
MARINA SEMENOVA ◽  
FRIEDRICH WEHRUNG
Keyword(s):  
Positive Integer ◽  
Partially Ordered Set ◽  
Convex Sets ◽  
Ordered Set ◽  
Finitely Based ◽  
Locally Finite ◽  
Partially Ordered ◽  
Finitely Based Variety ◽  
Atomistic Lattice ◽  
Convex Subsets

For a positive integer n, we denote by SUB (respectively, SUBn) the class of all lattices that can be embedded into the lattice Co(P) of all order-convex subsets of a partially ordered set P (respectively, P of length at most n). We prove the following results: (1) SUBn is a finitely based variety, for any n≥1. (2) SUB2 is locally finite. (3) A finite atomistic lattice L without D-cycles belongs to SUB if and only if it belongs to SUB2; this result does not extend to the nonatomistic case. (4) SUBn is not locally finite for n≥3.

CAYLEY GRAPHS OF PARTIALLY ORDERED SETS

2013 ◽  
Vol 12 (04) ◽  
pp. 1250184 ◽  
Author(s):  
MOJGAN AFKHAMI ◽  
ZAHRA BARATI ◽  
KAZEM KHASHYARMANESH
Keyword(s):  
Cayley Graph ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Cayley Graphs ◽  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Partially Ordered ◽  
Basic Properties ◽  
Vertex Set

In this paper, we introduce the Cayley graph of a partially ordered set (poset). Let (P, ≤) be a poset, and let S be a subset of P. We define the undirected Cayley graph of P, denoted by Cay (P, S), as a graph with vertex-set P and edge-set E consisting of those sets {x, y} such that y ∈ {x, s}ℓ or x ∈ {y, s}ℓ for some s ∈ S, where for a subset T of P, Tℓ is the set of all x ∈ P such that x ≤ t, for all t ∈ T. We study some basic properties of Cay (P, S) such as connectivity, diameter and girth.

scholarly journals AUTOMORPHISMS OF POWERS OF LINEARLY ORDERED SETS

2006 ◽  
Vol 14 (01) ◽  
pp. 77-85 ◽  
Author(s):  
CAROL L. WALKER ◽  
ELBERT A. WALKER
Keyword(s):  
Positive Integer ◽  
Partially Ordered Set ◽  
Automorphism Groups ◽  
Ordered Set ◽  
Unit Interval ◽  
Ordered Sets ◽  
Real Numbers ◽  
Main Interest ◽  
Partially Ordered ◽  
Usual Order

Let S be a bounded, partially ordered set, and n a positive integer. We investigate automorphism groups of Sn and of S[n], the non-decreasing n-tuples of Sn. Our main interest is in the case where S is the unit interval of real numbers with the usual order.

scholarly journals Almost Tiling of the Boolean Lattice with Copies of a Poset

10.37236/6636 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
István Tomon
Keyword(s):  
Positive Integer ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Minimal Element ◽  
Boolean Lattice ◽  
Partially Ordered

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]},\subset)$ can be partitioned into copies of $P$ for some positive integer $n$, then $P$ must satisfy the following two trivial conditions:(1) the size of $P$ is a power of $2$,(2) $P$ has a unique maximal and minimal element.Resolving a conjecture of Lonc, it was shown by Gruslys, Leader and Tomon that these conditions are sufficient as well.In this paper, we show that if $P$ only satisfies condition (2), we can still almost partition $2^{[n]}$ into copies of $P$. We prove that if $P$ has a unique maximal and minimal element, then there exists a constant $c=c(P)$ such that all but at most $c$ elements of $2^{[n]}$ can be covered by disjoint copies of $P$.

Information Retrieval Systems, an Algebraic Approach I1

1981 ◽  
Vol 4 (3) ◽  
pp. 551-603
Author(s):  
Zbigniew Raś
Keyword(s):  
Information Retrieval ◽  
Boolean Algebra ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Algebraic Approach ◽  
Partially Ordered ◽  
Retrieval Systems ◽  
Information Retrieval Systems ◽  
Present Part ◽  
L Systems

This paper is the first of the three parts of work on the information retrieval systems proposed by Salton (see [24]). The system is defined by the notions of a partially ordered set of requests (A, ⩽), the set of objects X and a monotonic retrieval function U : A → 2X. Different conditions imposed on the set A and a function U make it possible to obtain various classes of information retrieval systems. We will investigate systems in which (A, ⩽) is a partially ordered set, a lattice, a pseudo-Boolean algebra and Boolean algebra. In my paper these systems are called partially ordered information retrieval systems (po-systems) lattice information retrieval systems (l-systems); pseudo-Boolean information retrieval systems (pB-systems) and Boolean information retrieval systems (B-systems). The first part concerns po-systems and 1-systems. The second part deals with pB-systems and B-systems. In the third part, systems with a partial access are investigated. The present part discusses the method for construction of a set of attributes. Problems connected with the selectivity and minimalization of a set of attributes are investigated. The characterization and the properties of a set of attributes are given.

scholarly journals Each join-completion of a partially ordered set in the solution of a universal problem

1974 ◽  
Vol 17 (4) ◽  
pp. 406-413 ◽  
Author(s):  
Jürgen Schmidt
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Unique Extension ◽  
Partially Ordered ◽  
Special Cases

The main result of this paper is the theorem in the title. Only special cases of it seem to be known so far. As an application, we obtain a result on the unique extension of Galois connexions. As a matter of fact, it is only by the use of Galois connexions that we obtain the main result, in its present generality.

scholarly journals Primitive idempotent measures on compact semitopological semigroups

1972 ◽  
Vol 13 (4) ◽  
pp. 451-455 ◽  
Author(s):  
Stephen T. L. Choy
Keyword(s):  
Partial Order ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Zero Element ◽  
Primitive Idempotent ◽  
Natural Partial Order ◽  
Partially Ordered

For a semigroup S let I(S) be the set of idempotents in S. A natural partial order of I(S) is defined by e ≦ f if ef = fe = e. An element e in I(S) is called a primitive idempotent if e is a minimal non-zero element of the partially ordered set (I(S), ≦). It is easy to see that an idempotent e in S is primitive if and only if, for any idempotent f in S, f = ef = fe implies f = e or f is the zero element of S. One may also easily verify that an idempotent e is primitive if and only if the only idempotents in eSe are e and the zero element. We let П(S) denote the set of primitive idempotent in S.

ON RIBBON PRESENTATIONS OF RIBBON KNOTS

1994 ◽  
Vol 03 (02) ◽  
pp. 223-231
Author(s):  
TOMOYUKI YASUDA
Keyword(s):  
Partially Ordered Set ◽  
Ordered Set ◽  
Partially Ordered ◽  
Totally Ordered Set

A ribbon n-knot Kn is constructed by attaching m bands to m + 1n-spheres in the Euclidean (n + 2)-space. There are many way of attaching them; as a result, Kn has many presentations which are called ribbon presentations. In this note, we will induce a notion to classify ribbon presentations for ribbon n-knots of m-fusions (m ≥ 1, n ≥ 2), and show that such classes form a totally ordered set in the case of m = 2 and a partially ordered set in the case of m ≥ 1.

scholarly journals Spherical posets from commuting elements

2018 ◽  
Vol 21 (4) ◽  
pp. 593-628 ◽  
Author(s):  
Cihan Okay
Keyword(s):  
Homotopy Type ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Universal Cover ◽  
Homotopy Equivalent ◽  
Classifying Space ◽  
Partially Ordered ◽  
Abelian Subgroups

AbstractIn this paper, we study the homotopy type of the partially ordered set of left cosets of abelian subgroups in an extraspecial p-group. We prove that the universal cover of its nerve is homotopy equivalent to a wedge of r-spheres where {2r\geq 4} is the rank of its Frattini quotient. This determines the homotopy type of the universal cover of the classifying space of transitionally commutative bundles as introduced in [2].

Sign in / Sign up

Export Citation Format

Share Document