Let X,Y be any posets,the semimodularity of cardinal power Yx with base Y and exponent X is studied. Some necessary or sufficient conditions for Yx to be semimodular are gaven,
In this paper,the concepts of the essential topology and the density topology of dcpos are generalized to the setting of general posets.Basic properties of the essential topology and relations with other intrinsic top...In this paper,the concepts of the essential topology and the density topology of dcpos are generalized to the setting of general posets.Basic properties of the essential topology and relations with other intrinsic topologies are explored.Comparisons between the density topology and the measurement topology are made.Via the essential topology,the density topology and the measurement topology,we obtain properties and characterizations of bases of continuous posets.We also provide some new conditions for a continuous poset to be an algebraic poset.展开更多
A new concept Graded Finite Poset is proposed in this paper. Through discussing some basic properties of it, we come to that the direct product of graded finite posets is connected if and only if every graded finite p...A new concept Graded Finite Poset is proposed in this paper. Through discussing some basic properties of it, we come to that the direct product of graded finite posets is connected if and only if every graded finite poset is connected. The graded function of a graded finite poset is unique if and only if the graded finite poset is connected.展开更多
The free object generated by a set in the category of complete L-fuzzy posets is discussed in this paper. The construction of a free complete L-fuzzy poset generated by a set is obtained, which is a generalization of ...The free object generated by a set in the category of complete L-fuzzy posets is discussed in this paper. The construction of a free complete L-fuzzy poset generated by a set is obtained, which is a generalization of the free complete lattice generated by a set.展开更多
In this paper, as a generalization of uniform continuous posets, the concept of meet uniform continuous posets via uniform Scott sets is introduced. Properties and characterizations of meet uniform continuous posets a...In this paper, as a generalization of uniform continuous posets, the concept of meet uniform continuous posets via uniform Scott sets is introduced. Properties and characterizations of meet uniform continuous posets are presented. The main results are:(1) A uniform complete poset L is meet uniform continuous iff ↑(U∩↓x) is a uniform Scott set for each x∈L and each uniform Scott set U;(2) A uniform complete poset L is meet uniform continuous iff for each x∈L and each uniform subset S, one has x∧∨ S =∨{x∧s|s∈S}. In particular, a complete lattice L is meet uniform continuous iff L is a complete Heyting algebra;(3) A uniform complete poset is meet uniform continuous iff every principal ideal is meet uniform continuous iff all closed intervals are meet uniform continuous iff all principal filters are meet uniform continuous;(4) A uniform complete poset L is meet uniform continuous if L1 obtained by adjoining a top element 1 to L is a complete Heyting algebra;(5) Finite products and images of uniform continuous projections of meet uniform continuous posets are still meet uniform continuous.展开更多
A lot of combinatorial objects have algebra and coalgebra structures and posets are important combinatorial objects. In this paper, we construct algebra and coalgebra structures on the vector space spanned by posets. ...A lot of combinatorial objects have algebra and coalgebra structures and posets are important combinatorial objects. In this paper, we construct algebra and coalgebra structures on the vector space spanned by posets. Firstly, by associativity and the unitary property, we prove that the vector space with the conjunction product is a graded algebra. Then by the definition of free algebra, we prove that the algebra is free. Finally, by the coassociativity and the counitary property, we prove that the vector space with the unshuffle coproduct is a graded coalgebra.展开更多
The concepts of hypercontinuous posets and generalized completely continuous posets are introduced. It is proved that for a poset P the following three conditions are equivalent:(1) P is hypercontinuous;(2) the dual o...The concepts of hypercontinuous posets and generalized completely continuous posets are introduced. It is proved that for a poset P the following three conditions are equivalent:(1) P is hypercontinuous;(2) the dual of P is generalized completely continuous;(3) the normal completion of P is a hypercontinuous lattice. In addition, the relational representation and the intrinsic characterization of hypercontinuous posets are obtained.展开更多
Triangulated categories coming from cyclic posets were originally introduced by the authors in a previous paper as a generalization of the constructions of various triangulated categories with cluster structures.We gi...Triangulated categories coming from cyclic posets were originally introduced by the authors in a previous paper as a generalization of the constructions of various triangulated categories with cluster structures.We give an overview, and then analyze "triangulation clusters" which are those corresponding to topological triangulations of the 2-disk. Locally finite nontriangulation clusters give topological triangulations of the "cactus space" associated to the "cactus cyclic poset".展开更多
In the present paper we investigate prinjective Ringel-Hall algebras, for prinjective modules over incidence algebras of posers of finite prinjective type. Results we obtain are analogous to these, given by C. M. Ring...In the present paper we investigate prinjective Ringel-Hall algebras, for prinjective modules over incidence algebras of posers of finite prinjective type. Results we obtain are analogous to these, given by C. M. Ringel, for representations of Dynkin quivers. In particular we give a description of prinjective Ringel-Hall algebras by generators and relations.展开更多
Let F denote the folded （2D ＋ 1）-cube with vertex set X and diameter D ≥ 3. Fix x∈ X. We first define a partial order ≤ on X as follows. For y,z ∈ X let y ≤ z whenever （x,y）＋ （y,z） =- （x, z）. Let R ...Let F denote the folded （2D ＋ 1）-cube with vertex set X and diameter D ≥ 3. Fix x∈ X. We first define a partial order ≤ on X as follows. For y,z ∈ X let y ≤ z whenever （x,y）＋ （y,z） =- （x, z）. Let R （resp. L） denote the raising matrix （resp. lowering matrix） of P. Next we show that there exists a certain linear dependency among RL2, LRL, L2R and L for each given Q-polynomial structure of F. Finally, we determine whether the above linear dependency structure gives this poser a uniform structure or strongly uniform structure.展开更多
In this paper, the definitions of the most common and elementary mappings between matroids are extended to antimatroids first. Then the poset theory is used to find out the fiats of an antimatroid and obtain all of st...In this paper, the definitions of the most common and elementary mappings between matroids are extended to antimatroids first. Then the poset theory is used to find out the fiats of an antimatroid and obtain all of strong maps for a given antimatroid. Besides, the poset theory is also used to deal with the relationships among the mappings between antimatroids. All the discussion is connected with poset theory. This claims that poset theory is an important tool for the study of antimatroid theory.展开更多
We assume that M is a phase space and H an Hilbert space yielded by a quantization scheme. In this paper we consider the set of all “experimental propositions” of M and we look for a model of quantum logic in relati...We assume that M is a phase space and H an Hilbert space yielded by a quantization scheme. In this paper we consider the set of all “experimental propositions” of M and we look for a model of quantum logic in relation to the quantization of the base manifold M. In particular we give a new interpretation about previous results of the author in order to build an “asymptotics quantum probability space” for the Hilbert lattice L(H).展开更多
Many research issues have been raised in Application Layer Multicasting(ALM),such as group management,security,integrity of data,link stress,link stretch,load balancing,fault tolerance and scalability,because of the s...Many research issues have been raised in Application Layer Multicasting(ALM),such as group management,security,integrity of data,link stress,link stretch,load balancing,fault tolerance and scalability,because of the shifting of the multicast protocol from the IP layer to the application layer.To address these issues many protocols have evolved by changing their topology structure.In this paper,the POSET protocol stack is proposed,which consists of three layers,such as communication control,POSET cube,and content distribution.The novelty of this paper is the lattice-based data distribution with POSET cube architecture.The results have been compared with the existing NICE and Narada protocols.The experimental results show that the proposed POSET protocol improves throughput between 7.14%and 40%and decreases the delay between 7.69%and 25%,compared to the existing NICE protocol.展开更多
In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties,...In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties, and one natural setting where they arise is as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version of a heap, which loosely speaking, can be thought of as taking a heap and wrapping it into a cylinder. We call this object a toric heap, because we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. Defining the category of toric heaps leads to the notion of certain morphisms such as toric extensions. We study toric heaps in Coxeter theory, because a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. As such, we formalize and study a framework that we call cyclic reducibility in Coxeter theory, which is closely related to conjugacy. We introduce what it means for elements to be torically reduced, which is a stronger condition than simply being cyclically reduced. Along the way, we encounter a new class of elements that we call torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.展开更多
In this work, join and meet algebraic structure which exists in non-near-linear finite geometry are discussed. Lines in non-near-linear finite geometry ?were expressed as products of lines in near-linear finite geomet...In this work, join and meet algebraic structure which exists in non-near-linear finite geometry are discussed. Lines in non-near-linear finite geometry ?were expressed as products of lines in near-linear finite geometry ?(where?p?is a prime). An existence of lattice between any pair of near-linear finite geometry ?of ?is confirmed. For q|d, a one-to-one correspondence between the set of subgeometry ?of ?and finite geometry ?from the subsets of the set {D(d)}?of divisors of d?(where each divisor represents a finite geometry) and set of subsystems {∏(q)}?(with variables in Zq) of a finite quantum system ∏(d)?with variables in Zd?and a finite system from the subsets of the set of divisors of d?is established.展开更多
The main purpose of this article is to study the lattice structure of quantum logics by using the theory of partially order sets.The goal is achieved by constructing a natural embedding map from the quantum logic pose...The main purpose of this article is to study the lattice structure of quantum logics by using the theory of partially order sets.The goal is achieved by constructing a natural embedding map from the quantum logic posets into the complete lattices.The embedding map needs to be dense(in the order sense)and such complete lattices are so-called extended logics which preserve all essential features of the quantum logic.We obtain that the extended logic is unique up to a lattice isomorphism.展开更多
A nonincreasing sequence ( of n nonnegative integers is said to be graphic if it is the degree sequence of a simple graph G of order n. The set of all graphic sequences of n terms with even sum 2m and trace f is a pos...A nonincreasing sequence ( of n nonnegative integers is said to be graphic if it is the degree sequence of a simple graph G of order n. The set of all graphic sequences of n terms with even sum 2m and trace f is a poset G_(n,m,f) under majorization relation. The paper characterizes the minimal elements in the poset G_(n,m,f) and determines the number of minimal elements in various posets of graphic sequences.展开更多
文摘Let X,Y be any posets,the semimodularity of cardinal power Yx with base Y and exponent X is studied. Some necessary or sufficient conditions for Yx to be semimodular are gaven,
基金Supported by the National Natural Science Foundation of China(Grant Nos.1167100811101212)the University Science Research Project of Jiangsu Province(Grant No.15KJD110006)
文摘In this paper,the concepts of the essential topology and the density topology of dcpos are generalized to the setting of general posets.Basic properties of the essential topology and relations with other intrinsic topologies are explored.Comparisons between the density topology and the measurement topology are made.Via the essential topology,the density topology and the measurement topology,we obtain properties and characterizations of bases of continuous posets.We also provide some new conditions for a continuous poset to be an algebraic poset.
基金Supported by the National Natural Science Foundation of China（60474022） Supported by the Henan Innovation Project for University Prominent Research Talents（2007KYCX018）
文摘A new concept Graded Finite Poset is proposed in this paper. Through discussing some basic properties of it, we come to that the direct product of graded finite posets is connected if and only if every graded finite poset is connected. The graded function of a graded finite poset is unique if and only if the graded finite poset is connected.
文摘The free object generated by a set in the category of complete L-fuzzy posets is discussed in this paper. The construction of a free complete L-fuzzy poset generated by a set is obtained, which is a generalization of the free complete lattice generated by a set.
基金Supported by the National Natural Science Foundation of China(Grant Nos.11671008 11101212)+1 种基金the Natural Science Foundation of Jiangsu Province(Grant No.BK20170483)the Fund of University Speciality Construction of Jiangsu Province(Grant No.PPZY2015B109)
文摘In this paper, as a generalization of uniform continuous posets, the concept of meet uniform continuous posets via uniform Scott sets is introduced. Properties and characterizations of meet uniform continuous posets are presented. The main results are:(1) A uniform complete poset L is meet uniform continuous iff ↑(U∩↓x) is a uniform Scott set for each x∈L and each uniform Scott set U;(2) A uniform complete poset L is meet uniform continuous iff for each x∈L and each uniform subset S, one has x∧∨ S =∨{x∧s|s∈S}. In particular, a complete lattice L is meet uniform continuous iff L is a complete Heyting algebra;(3) A uniform complete poset is meet uniform continuous iff every principal ideal is meet uniform continuous iff all closed intervals are meet uniform continuous iff all principal filters are meet uniform continuous;(4) A uniform complete poset L is meet uniform continuous if L1 obtained by adjoining a top element 1 to L is a complete Heyting algebra;(5) Finite products and images of uniform continuous projections of meet uniform continuous posets are still meet uniform continuous.
文摘A lot of combinatorial objects have algebra and coalgebra structures and posets are important combinatorial objects. In this paper, we construct algebra and coalgebra structures on the vector space spanned by posets. Firstly, by associativity and the unitary property, we prove that the vector space with the conjunction product is a graded algebra. Then by the definition of free algebra, we prove that the algebra is free. Finally, by the coassociativity and the counitary property, we prove that the vector space with the unshuffle coproduct is a graded coalgebra.
基金supported by the National Natural Science Foundation of China(Nos.10861007,11161023)the National Excellent Doctoral Dissertation of China(No.2007B14)+1 种基金the Ganpo 555 Programme for Leading Talents of Jiangxi Province,the Natural Science Foundation of Jiangxi Province(No.20114BAB201008)the Fund of Education Department of Jiangxi Province(No.GJJ12657)
文摘The concepts of hypercontinuous posets and generalized completely continuous posets are introduced. It is proved that for a poset P the following three conditions are equivalent:(1) P is hypercontinuous;(2) the dual of P is generalized completely continuous;(3) the normal completion of P is a hypercontinuous lattice. In addition, the relational representation and the intrinsic characterization of hypercontinuous posets are obtained.
文摘Triangulated categories coming from cyclic posets were originally introduced by the authors in a previous paper as a generalization of the constructions of various triangulated categories with cluster structures.We give an overview, and then analyze "triangulation clusters" which are those corresponding to topological triangulations of the 2-disk. Locally finite nontriangulation clusters give topological triangulations of the "cactus space" associated to the "cactus cyclic poset".
文摘In the present paper we investigate prinjective Ringel-Hall algebras, for prinjective modules over incidence algebras of posers of finite prinjective type. Results we obtain are analogous to these, given by C. M. Ringel, for representations of Dynkin quivers. In particular we give a description of prinjective Ringel-Hall algebras by generators and relations.
基金Supported by the Natural Science Foundation of China(No.11471097)the Innovative Fund Project of Hebei Province(sj.2017084)
文摘Let F denote the folded （2D ＋ 1）-cube with vertex set X and diameter D ≥ 3. Fix x∈ X. We first define a partial order ≤ on X as follows. For y,z ∈ X let y ≤ z whenever （x,y）＋ （y,z） =- （x, z）. Let R （resp. L） denote the raising matrix （resp. lowering matrix） of P. Next we show that there exists a certain linear dependency among RL2, LRL, L2R and L for each given Q-polynomial structure of F. Finally, we determine whether the above linear dependency structure gives this poser a uniform structure or strongly uniform structure.
文摘In this paper, the definitions of the most common and elementary mappings between matroids are extended to antimatroids first. Then the poset theory is used to find out the fiats of an antimatroid and obtain all of strong maps for a given antimatroid. Besides, the poset theory is also used to deal with the relationships among the mappings between antimatroids. All the discussion is connected with poset theory. This claims that poset theory is an important tool for the study of antimatroid theory.
文摘We assume that M is a phase space and H an Hilbert space yielded by a quantization scheme. In this paper we consider the set of all “experimental propositions” of M and we look for a model of quantum logic in relation to the quantization of the base manifold M. In particular we give a new interpretation about previous results of the author in order to build an “asymptotics quantum probability space” for the Hilbert lattice L(H).
基金supported by the university Grants Commission,New Delhi,India
文摘Many research issues have been raised in Application Layer Multicasting(ALM),such as group management,security,integrity of data,link stress,link stretch,load balancing,fault tolerance and scalability,because of the shifting of the multicast protocol from the IP layer to the application layer.To address these issues many protocols have evolved by changing their topology structure.In this paper,the POSET protocol stack is proposed,which consists of three layers,such as communication control,POSET cube,and content distribution.The novelty of this paper is the lattice-based data distribution with POSET cube architecture.The results have been compared with the existing NICE and Narada protocols.The experimental results show that the proposed POSET protocol improves throughput between 7.14%and 40%and decreases the delay between 7.69%and 25%,compared to the existing NICE protocol.
文摘In 1986, G.X. Viennot introduced the theory of heaps of pieces as a visualization of Cartier and Foata’s “partially commutative monoids”. These are essentially labeled posets satisfying a few additional properties, and one natural setting where they arise is as models of reduced words in Coxeter groups. In this paper, we introduce a cyclic version of a heap, which loosely speaking, can be thought of as taking a heap and wrapping it into a cylinder. We call this object a toric heap, because we formalize it as a labeled toric poset, which is a cyclic version of an ordinary poset. Defining the category of toric heaps leads to the notion of certain morphisms such as toric extensions. We study toric heaps in Coxeter theory, because a cyclic shift of a reduced word is simply a conjugate by an initial or terminal generator. As such, we formalize and study a framework that we call cyclic reducibility in Coxeter theory, which is closely related to conjugacy. We introduce what it means for elements to be torically reduced, which is a stronger condition than simply being cyclically reduced. Along the way, we encounter a new class of elements that we call torically fully commutative (TFC), which are those that have a unique cyclic commutativity class, and comprise a strictly bigger class than the cyclically fully commutative (CFC) elements. We prove several cyclic analogues of results on fully commutative (FC) elements due to Stembridge. We conclude with how this framework fits into recent work in Coxeter groups, and we correct a minor flaw in a few recently published theorems.
文摘In this work, join and meet algebraic structure which exists in non-near-linear finite geometry are discussed. Lines in non-near-linear finite geometry ?were expressed as products of lines in near-linear finite geometry ?(where?p?is a prime). An existence of lattice between any pair of near-linear finite geometry ?of ?is confirmed. For q|d, a one-to-one correspondence between the set of subgeometry ?of ?and finite geometry ?from the subsets of the set {D(d)}?of divisors of d?(where each divisor represents a finite geometry) and set of subsystems {∏(q)}?(with variables in Zq) of a finite quantum system ∏(d)?with variables in Zd?and a finite system from the subsets of the set of divisors of d?is established.
基金supported by the National Natural Science Foundation of China(Grant Nos.12271394 and 12071336)Shanxi Scholarship Council of China(Grant No.2020-031)Fundamental Research Program of Shanxi Province(Grant No.202203021212211)。
文摘The main purpose of this article is to study the lattice structure of quantum logics by using the theory of partially order sets.The goal is achieved by constructing a natural embedding map from the quantum logic posets into the complete lattices.The embedding map needs to be dense(in the order sense)and such complete lattices are so-called extended logics which preserve all essential features of the quantum logic.We obtain that the extended logic is unique up to a lattice isomorphism.
文摘A nonincreasing sequence ( of n nonnegative integers is said to be graphic if it is the degree sequence of a simple graph G of order n. The set of all graphic sequences of n terms with even sum 2m and trace f is a poset G_(n,m,f) under majorization relation. The paper characterizes the minimal elements in the poset G_(n,m,f) and determines the number of minimal elements in various posets of graphic sequences.
