The fractional weak discrepancy of a partially ordered set

In this paper we introduce the notion of the fractional weak discrepancy of a poset, building on previous work on weak discrepancy in [J.G. Gimbel and A.N. Trenk, On the weakness of an ordered set, SIAM J. Discrete Math. 11 (1998) 655-663; P.J. Tanenbaum, A.N. Trenk, P.C. Fishburn, Linear discrepancy and weak discrepancy of partially ordered sets, ORDER 18 (2001) 201-225; A.N. Trenk, On k-weak orders: recognition and a tolerance result, Discrete Math. 181 (1998) 223-237]. The fractional weak discrepancywd_F(P) of a poset P=(V,?) is the minimum nonnegative k for which there exists a function f:V→R satisfying (1) if a?b then f(a)+1?f(b) and (2) if a∥b then |f(a)-f(b)|?k. We formulate the fractional weak discrepancy problem as a linear program and show how its solution can also be used to calculate the (integral) weak discrepancy. We interpret the dual linear program as a circulation problem in a related directed graph and use this to give a structural characterization of the fractional weak discrepancy of a poset.     

When linear and weak discrepancy are equal

The linear discrepancy of a poset P is the least k such that there is a linear extension L of P such that if x and y are incomparable, then |h_L(x)−h_L(y)|≤k, whereas the weak discrepancy is the least k such that there is a weak extension W of P such that if x and y are incomparable, then |h_W(x)−h_W(y)|≤k. This paper resolves a question of Tanenbaum, Trenk, and Fishburn on characterizing when the weak and linear discrepancy of a poset are equal. Although it is shown that determining whether a poset has equal weak and linear discrepancy is -complete, this paper provides a complete characterization of the minimal posets with equal weak and linear discrepancy. Further, these minimal posets can be completely described as a family of interval orders.     

Linear Discrepancy of the Product of Two Chains

The linear discrepancy of a partially ordered set P = (X, ≺) is the minimum integer l such that ∣f(a) − f(b)∣ ≤ l for any injective isotone and any pair of incomparable elements a, b in X. It measures the degree of difference of P from a chain. Despite of increasing demands to the applications, the discrepancies of just few simple partially ordered sets are known. In this paper, we obtain the linear discrepancy of the product of two chains. For this, we firstly give a lower bound of the linear discrepancy and then we construct injective isotones on the product of two chains, which show that the obtained lower bound is tight.     

Fractional weak discrepancy and interval orders

The fractional weak discrepancywd_F(P) of a poset P=(V,?) was introduced in [A. Shuchat, R. Shull, A. Trenk, The fractional weak discrepancy of a partially ordered set, Discrete Applied Mathematics 155 (2007) 2227-2235] as the minimum nonnegative k for which there exists a function satisfying (i) if a?b then f(a)+1≤f(b) and (ii) if a∥b then |f(a)−f(b)|≤k. In this paper we generalize results in [A. Shuchat, R. Shull, A. Trenk, Range of the fractional weak discrepancy function, ORDER 23 (2006) 51-63; A. Shuchat, R. Shull, A. Trenk, Fractional weak discrepancy of posets and certain forbidden configurations, in: S.J. Brams, W.V. Gehrlein, F.S. Roberts (Eds.), The Mathematics of Preference, Choice, and Order: Essays in Honor of Peter C. Fishburn, Springer, New York, 2009, pp. 291-302] on the range of the wd_F function for semiorders (interval orders with no induced ) to interval orders with no , where n≥3. In particular, we prove that the range for such posets P is the set of rationals that can be written as r/s, where 0≤s−1≤r<(n−2)s. If wd_F(P)=r/s and P has an optimal forcing cycle C with and , then r≤(n−2)(s−1). Moreover when s≥2, for each r satisfying s−1≤r≤(n−2)(s−1) there is an interval order having such an optimal forcing cycle and containing no.     

Average relational distance in linear extensions of posets

We consider a natural analogue of the graph linear arrangement problem for posets. Let P=(X,?) be a poset that is not an antichain, and let λ:X→[n] be an order-preserving bijection, that is, a linear extension of P. For any relation a?b of P, the distance between a and b in λ is λ(b)−λ(a). The average relational distance of λ, denoted , is the average of these distances over all relations in P. We show that we can find a linear extension of P that maximises in polynomial time. Furthermore, we show that this maximum is at least , and this bound is extremal.     

On the stability of linear systems with an exact constraint set

This paper deals with the stability of the intersection of a given set with the solution, , of a given linear system whose coefficients can be arbitrarily perturbed. In the optimization context, the fixed constraint set X can be the solution set of the (possibly nonlinear) system formed by all the exact constraints (e.g., the sign constraints), a discrete subset of (as or { 0,1} ⁿ , as it happens in integer or Boolean programming) as well as the intersection of both kind of sets. Conditions are given for the intersection to remain nonempty (or empty) under sufficiently small perturbations of the data. Research supported by Fondecyt Grant 1020(7020)-646. Research supported by DGES and FEDER, Grant BFM2002-04114-C02-01     

Fast perfect sampling from linear extensions

In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded algorithms that generate approximately uniform samples. Here, we create a bounding chain for one such Markov chain, and by using a non-Markovian coupling together with a modified form of coupling from the past, we build an algorithm for perfectly generating samples. The expected running time of the procedure is O(n³lnn), making the technique as fast as the mixing time of the Karzanov/Khachiyan chain upon which it is based.     

A Characterisation of Posets that Are nearly Antichains

We present a characterisation of posets of size n with linear discrepancy n − 2. These are the posets that are “furthest” from a linear order without being an antichain. This revised version was published online in September 2006 with corrections to the Cover Date.     

The Generalized Center Galois Extensions of Rings

Let B be a ring with 1, C the center of B, G a finite automorphism group of B, and I_i = {c - g_i(c) | c C} for each g_i G. Then, B is called a center Galois extension with Galois group G if BI_i = B for each g_i 1 in G, and a weak center Galois extension with group G if BI_i = Be_i for some nonzero idempotent e_i in C for each g_i 1 in G. When e_i is a minimal element in the Boolean algebra generated by {e_i | g_i G} Be_i is a center Galois extension with Galois group H_i for some subgroup H_i of G. Moreover, the central Galois algebra B(1 – e_i) is characterized when B is a Galois algebra with Galois group G.AMS Subject Classification (1991): 16S35 16W20Supported by a Caterpillar Fellowship, Bradley University, Peoria, Illinois, USA. We would like to thank Caterpillar Inc. for their support.     

The endomorphism spectrum of an ordered set

Theendomorphism spectrum of an ordered setP, spec(P)={|f(P)|:f End(P)} andspectrum number, sp(P)=max(spec(P)\{|P|}) are introduced. It is shown that |P|>(1/2)n(n – 1) ^{n – 1} implies spec(P) = {1, 2, ...,n} and that if a projective plane of ordern exists, then there is an ordered setP of size 2n ²+2n+2 with spec(P)={1, 2, ..., 2n+2, 2n+4}. Lettingh(n)=max{|P|: sp(P)n}, it follows thatc ₁ n ²h(n)c ₂ n ⁿ⁺¹ for somec ₁ andc ₂. The lower bound disproves the conjecture thath(n)2n. It is shown that if |P| – 1 spec(P) thenP has a retract of size |P| – 1 but that for all there is a bipartite ordered set with spec(P) = {|P| – 2, |P| – 4, ...} which has no proper retract of size|P| – . The case of reflexive graphs is also treated.Partially supported by a grant from the NSERC.Partially supported by a grant from the NSERC.     

Representing an ordered set as the intersection of super greedy linear extensions

A linear extension [x ₁2<...t] of a finite ordered set P=(P, <) is super greedy if it can be obtained using the following procedure: Choose x ₁ to be a minimal element of P; suppose x ₁,...,x _i have been chosen; define p(x) to be the largest ji such that x _jj exists and 0 otherwise; choose x _i+1 to be a minimal element of P-{ x ₁,...,x _i} which maximizes p. Every finite ordered set P can be represented as the intersection of a family of super greedy linear extensions, called a super greedy realizer of P. The super greedy dimension of P is the minimum cardinality of a super greedy realizer of P. Best possible upper bounds for the super greedy dimension of P are derived in terms of |P-A| and width (P-A), where A is a maximal antichain.Research supported in part by NSF grant IPS-80110451.Research supported in part by ONR grant N00014-85K-0494 and NSERC grants 69-3378, 69-0259, and 69-1325.Research supported in part by NSF grant DMS-8401281.     

5元素集合上T_0拓扑总数的计算

利用有限偏序集上的几个重要结果并借助于拓扑空间对应的特殊化序与拓扑之间的关系计算得出5元素集合上T0拓扑总数为4231,拓扑总数为6942.     

The number of depth-first searches of an ordered set

We show that the problems of deciding whether an ordered set has at leastk depth-first linear extensions and whether an ordered set has at leastk greedy linear extensions are NP-hard.Supported by Office of Naval Research contract N00014-85K-0494.Supported by National Science Foundation grant DMS-8713994.     

A set of staircase linear programming test problems

A set of staircase linear programming test problems are made available for computational experiments.Research supported by the U.S. Department of Energy under contract DE-AC02-76CH00016.Research supported by the Belgian National Research Program in Energy, contract E/I/3.     

The Structure Theorems of Weak Hopf Algebras

In this article, we mainly give the structure theorem of endomorphism algebras of weak Hopf algebras, and give another structure theorem as well as some applications for weak Doi–Hopf modules.     

The set of toric minimal log discrepancies

We describe the set of minimal log discrepancies of toric log varieties, and study its accumulation points. This work is supported by a 21st Century COE Kyoto Mathematics Fellowship, and a JSPS Grant-in-Aid No 17740011.