Antichain Cutsets of Strongly Connected Posets

Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We also consider a generalization to strongly connected d-uniform hypergraphs.     

Upper Maximal Graphs of Posets

We introduce and study a class of simple graphs, the upper-maximal graphs (UM-graphs), associated to finite posets. The vertices of the UM-graph of a given poset P are the elements of P, and edges are formed by those vertices x and y whenever any maximal element of P that is greater than x is also greater than y or vise versa. We show that the class of UM-graphs constitutes a subclass of comparability graphs. We further provide a characterization of chordal UM-graphs, and compare UM-graphs with known bound graphs of posets.     

偏序集上的滤子极大理想

在偏序集上引入并考察了滤子极大理想的概念,证明了相应的存在性定理。引入并考察了伪极大元和伪既约元的概念,利用图表的形式对连续格中各种类型的既约元和素元之间的关系进行了归纳总结,完善了文献《Continuous Lattices and Domains》(作者:G.Gierz,et al)中的一个图表的相关内容,填补了在分配的连续格情形该图表的一个未知内容,部分地回答了该文献中的一个问题。     

Antichain sequences

For any finite partially ordered set S we display a dual transportation system of linear inequalities, and a bijection A(x) from the maximal integer-valued solutions x of this system onto the maximal sequences of k antichains in S. This provides a simple translation to a dual transportation problem of the problem: find a maximum weight union of k antichains.Research supported by the Natural Sciences and Engineering Research of Canada.     

Antichain Codes

We show that almost all codes satisfy an antichain condition. This states that the minimum length of a two dimensional subcode of a code C increases if the subcode is constrained to contain a minimum weight codeword. In particular, almost no code satisfies the chain condition. In passing, we study the typical behaviour of codes with respect to generalized distances and show that almost all lie on a generalized Varshamov-Gilbert bound.     

Antichain cutsets

A subset A of an ordered set P is a cutset if each maximal chain of P meets A; if, in addition, A is an antichain call it an antichain cutset. Our principal result is a characterization, by means of a forbidden configuration, of those finite ordered sets, which can be expressed as the union of antichain cutsets.     

The Fixed Point Property for Posets of Small Width

The fixed point property for finite posets of width 3 and 4 is studied in terms of forbidden retracts. The ranked forbidden retracts for width 3 and 4 are determined explicitly. The ranked forbidden retracts for the width 3 case that are linearly indecomposable are examined to see which are minimal automorphic. Part of a problem of Niederle from 1989 is thus solved.     

具有极值亏量和的亚纯函数的一个性质

本文在涉及重值的情况下，给出了具有极值亏量和的亚纯函数的一个性质．推广了Ｓｉｎｇｈ和Ｋｕｌｋａｒｎｉ的结果．     

最大公因式的一个性质

给出了最大公因式的两个性质,应用此性质推广了文[1]中相应的结论,并给出了两个推论．     

Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property

We provide results allowing to state, by the simple inspection of suitable classes of posets (propositional Kripke frames), that the corresponding intermediate propositional logics are maximal among the ones which satisfy the disjunction property. Starting from these results, we directly exhibit, without using the axiom of choice, the Kripke frames semantics of 2^No maximal intermediate propositional logics with the disjunction property. This improves previous evaluations, giving rise to the same conclusion but made with an essential use of the axiom of choice, of the cardinality of the set of the maximal intermediate propositional logics with the disjunction property. Mathematics Subject Classification: 03B55, 03C90.     

Persistence Approximation Property for Maximal Roe Algebras

Persistence approximation property was introduced by Hervé Oyono-Oyono and Guoliang Yu. This property provides a geometric obstruction to Baum-Connes conjecture. In this paper, the authors mainly discuss the persistence approximation property for maximal Roe algebras. They show that persistence approximation property of maximal Roe algebras follows from maximal coarse Baum-Connes conjecture. In particular, let X be a discrete metric space with bounded geometry, assume that X admits a fibred coar...     

A Bernstein Property of Affine Maximal Hypersurfaces

Let x: M A ^{n + 1} be a locally strongly convex hypersurface, given as a graph of a locally strongly convexfunction x _{n + 1} =f(x ₁, ..., x _n )defined in a domain A ⁿ . We introduce a Riemannian metricG ^# = (² f/x _i x _j )dx _i dx _j on M. In this paper, we investigate the affine maximalhypersurfaces which are complete with respect to the metricG ^# and prove a Bernstein property for the affine maximalhypersurfaces.     

An Infinite Antichain of Planar Tanglegrams

Contrary to the expectation arising from the tanglegram Kuratowski theorem of Czabarka et al. (SIAM J. Discrete Math. 31(3), 1732–1750, 2017), we construct an infinite antichain of planar tanglegrams with respect to the induced subtanglegram partial order. R.E. Tarjan, R. Laver, D.A. Spielman and M. Bóna, and possibly others, showed that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain, i.e., there exists an infinite collection of permutations, such that none of them contains another as a pattern. Our construction adds a twist to the construction of Spielman and Bóna (Electr. J. Comb. 7, N2, 2000).

     

代数的局部完备集范畴和FS-局部dcpo范畴的笛卡儿闭性

本文引入了代数的局部完备集,FS-局部dcpo,局部稳定映射等概念．主要结果是：以局部Scott连续映射为态射的代数的局部完备集范畴,以局部稳定映射为态射的代数的局部完备集范畴以及以局部Scott连续映射为态射的FS-局部dcpo范畴都是笛卡儿闭范畴．     

极大η-单调集值映射的一个性质

本文着重研究了在什么条件下集值映射I λT的值域是全空间Rn这一问题,其中I是恒等映射,λ>0是任意给定的常数,T是一个极大η-单调的集值映射．文中主要结果部分地解决了C．-H．Lee,Q．H．Ansari和J．-C．Yao在2000年提出的一个公开问题．此外,针对真下半连续泛函的η-次微分映射,也讨论了上述问题．     

On Lattice Representations with Dcc Posets

Order - In this paper, we investigate the class of lattices representable with posets satisfying the DCC condition. We describe a way to decide whether a finite lattice is in this class. We also...     

Function Spaces of Posets with Projections

This paper investigates function spaces of structures consisting of a partially ordered set together with some directed family of projections.More precisely, given a fixed directed index set (I,), we consider triples (D,,(p _i ) _iI ) with (D,) a poset and (p _i ) _iI a monotone net of projections of D. We call them (I,)-pop's (posets with projections). Our main purpose is to study structure preserving maps between (I,)-pop's. Such homomorphisms respect both order and projections.Any (I,)-pop is known to induce a uniformity and thus a topology. The set of all homomorphisms between two (I,)-pop's turns out to form an (I,)-pop itself. We show that its uniformity is the uniformity of uniform convergence. This enables us to prove that properties such as completeness and compactness transfer to function pop's.Concerning categorical properties of (I,)-pop's, we will see that we are in a lucky situation from a computer scientist's point of view: we obtain Cartesian closed categories. Moreover, by a D -construction we get (I,)-pop's that are isomorphic to their own exponent. This yields new models for the untyped -calculus.     

Partitioning Posets

Given a poset P = (X, ≺ ), a partition X ₁, ..., X _k of X is called an ordered partition of P if, whenever x ∈ X _i and y ∈ X _j with x ≺ y, then i ≤ j. In this paper, we show that for every poset P = (X, ≺ ) and every integer k ≥ 2, there exists an ordered partition of P into k parts such that the total number of comparable pairs within the parts is at most (m − 1)/k, where m ≥ 1 is the total number of edges in the comparability graph of P. We show that this bound is best possible for k = 2, but we give an improved bound, , for k ≥ 3, where c(k) is a constant depending only on k. We also show that, given a poset P = (X, ≺ ) and an integer 2 ≤ k ≤ |X|, we can find an ordered partition of P into k parts that minimises the total number of comparable pairs within parts in time polynomial in the size of P. We prove more general, weighted versions of these results. Supported by an EPSRC doctoral training grant.     

Tchebyshev Posets

We construct for each $n$ an Eulerian partially ordered set $T_n$ of rank $n+1$ whose $ce$-index provides a non-commutative generalization of the $n$th Tchebyshev polynomial. We show that the order complex of each $T_n$ is shellable, homeomorphic to a sphere, and that its face numbers minimize the expression $\max_{|x|\leq 1} |\sum_{j=0}^n (f_{j-1}/f_{n-1})\cdot 2^{-j}\cdot (x-1)^j|$ among the $f$-vectors of all $(n-1)$-dimensional simplicial complexes. The duals of the posets constructed have a recursive structure similar to face lattices of simplices or cubes, offering the study of a new special class of Eulerian partially ordered sets to test the validity of Stanleys conjecture on the non-negativity of the $cd$-index of all Gorenstein$^*$ posets.