نتایج جستجو برای: kopkas d posets

تعداد نتایج: 579465  

Journal: :Order 2016
William T. Trotter Ruidong Wang

In recent years, researchers have shown renewed interest in combinatorial properties of posets determined by geometric properties of its order diagram and topological properties of its cover graph. In most cases, the roots for the problems being studied today can be traced back to the 1970’s, and sometimes even earlier. In this paper, we study the problem of bounding the dimension of a planar p...

Journal: :Eur. J. Comb. 2008
Erkko Lehtonen

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorphicity orders of k-posets and k-lattices are shown to be universal in the sense that every countable poset can be embedded into them. Labeled posets are represented by directed graphs, and a categorical isomorphism betw...

1997
Venu G. Menon

Z-continuous posets are common generalizations of continuous posets, completely distributive lattices, and unique factorization posets. Though the algebraic properties of Z-continuous posets had been studied by several authors, the topological properties are rather unknown. In this short note an intrinsic topology on a Z-continuous poset is de ned and its properties are explored.

Journal: :J. Comb. Theory, Ser. A 2007
Richard Ehrenborg Margaret Readdy

We give a complete classification of the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with n!, the factorial function of the infinite Boolean algebra, or 2n−1, the factorial function of the infinite butterfly poset. We also classify the factorial functions for Eulerian Sheffer posets. An Eulerian Sheffer poset with binomial factorial function B(n...

Journal: :journal of sciences, islamic republic of iran 2014
a. golchin l. nouri

in (golchin a. and rezaei p., subpullbacks and flatness properties of s-posets. comm. algebra. 37: 1995-2007 (2009)) study was initiated of flatness properties of right -posets  over a pomonoid  that can be described by surjectivity of  corresponding to certain (sub)pullback diagrams and new properties such as  and  were discovered. in this article first of all we describe po-flatness propertie...

Journal: :Order 2001
Richard Ehrenborg

A poset P is called k-Eulerian if every interval of rank k is Eulerian. The class of k-Eulerian posets interpolates between graded posets and Eulerian posets. It is a straightforward observation that a 2k-Eulerian poset is also (2k+1)-Eulerian. We prove that the ab-index of a (2k+1)Eulerian poset can be expressed in terms of c = a + b, d = ab + ba and e2k+1 = (a − b)2k+1. The proof relies upon ...

2005
Richard EHRENBORG Margaret A. READDY

We completely characterize the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with n!, the factorial function of the infinite Boolean algebra, or 2n−1, the factorial function of the infinite butterfly poset. We also classify the factorial functions for Eulerian Sheffer posets. An Eulerian Sheffer poset with binomial factorial function B(n) = n! has...

2015
Bérénice Delcroix-Oger

We present here a family of posets which generalizes both partition and pointed partition posets. After a short description of these new posets, we show that they are Cohen-Macaulay, compute their Moebius numbers and their characteristic polynomials. The characteristic polynomials are obtained using a combinatorial interpretation of the incidence Hopf algebra associated to these posets. Résumé....

Journal: :Electr. J. Comb. 2002
Marcel Erné Jobst Heitzig Jürgen Reinhold

We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and useful for combinatorial identities and inequalities are the numbers vk of vertically indecomposable distributive lattices of size k. We present the explicit values of the numbers dk and vk for k < 50 and prove the fo...

Journal: :J. Comb. Theory, Ser. A 2004
Sergei L. Bezrukov Victor P. Piotrowski Thomas J. Pfaff

We develop a new approach for establishing the Macaulayness of posets representable as cartesian powers of other posets. This approach is based on a problem of constructing an ideal of maximum rank in a poset. Using the relations between the maximum rank ideal problem and the edge-isoperimetric problem on graphs we demonstrate an application of our approach to specification of all posets with a...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید