Ideals of finitely generated commutative monoids

We extend the concept of presentation of finitely generated commutative monoids to ideals of finitely generated commutative monoids and give algorithms to obtain information about an ideal from a given presentation.     

Ideals of a C *-algebra generated by an operator algebra

In this paper, we consider ideals of a C ^*-algebra C^*(B){C^*(\mathcal{B})} generated by an operator algebra B{\mathcal{B}} . A closed ideal J í C^*(B){J\subseteq C^*(\mathcal{B})} is called a K-boundary ideal if the restriction of the quotient map on B{\mathcal{B}} has a completely bounded inverse with cb-norm equal to K ⁻¹. For K = 1 one gets the notion of boundary ideals introduced by Arveson. We study properties of the K-boundary ideals and characterize them in the case when operator algebra λ-norms itself. Several reformulations of the Kadison similarity problem are given. In particular, the affirmative answer to this problem is equivalent to the statement that every bounded homomorphism from C^*(B){C^*(\mathcal{B})} onto B{\mathcal{B}} which is a projection on B{\mathcal{B}} is completely bounded. Moreover, we prove that Kadison’s similarity problem is decided on one particular C ^*-algebra which is a completion of the *-double of M₂(\mathbbC){M_2(\mathbb{C})} .     

Convex polytopes all of whose reverse lexicographic initial ideals are squarefree

A compressed polytope is an integral convex polytope any of whose reverse lexicographic initial ideals is squarefree. A sufficient condition for a -polytope to be compressed will be presented. One of its immediate consequences is that the class of compressed -polytopes includes (i) hypersimplices, (ii) order polytopes of finite partially ordered sets, and (iii) stable polytopes of perfect graphs.

     

Reverse lexicographic and lexicographic shifting

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, Δ_lex—an operation that transforms a monomial ideal of S = K[x_i: i ∈ ℕ] that is finitely generated in each degree into a squarefree strongly stable ideal—is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a squarefree strongly stable ideal I ⊂ S is fixed by lexicographic shifting if and only if I is a universal squarefree lexsegment ideal (abbreviated USLI) of S. Moreover, in the case when I is finitely generated and is not a USLI, it is verified that all the ideals in the sequence } are distinct. The limit ideal is well defined and is a USLI that depends only on a certain analog of the Hilbert function of I. Research partially supported by NSF grants DMS 0070571 and DMS 0100141.     

Quantale的理想及由理想生成的同余

给出了Quantale的理想的概念,讨论了Quantale的由任意子集生成的理想的具体结构, 讨论了由理想生成的同余,得到了Quantale的理想的若干性质.     

Infinite lexicographic products

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define dense substructures in infinite products and show that any countable product of countable transitive homogeneous structures has a unique countable dense substructure, up to isomorphism. Furthermore, this dense substructure is transitive, homogeneous and elementarily embeds into the product. This result is then utilized to construct a rigid elementarily indivisible structure.     

Learning lexicographic orders

The purpose of this paper is to learn the order of criteria of lexicographic decision under various reasonable assumptions. We give a sample evaluation and an oracle based algorithm. In the worst case analysis we are dealing with the adversarial models. We show that if the distances of the samples are less than 4, then it is not learnable, but 4-distance samples are polynomial learnable.     

Foundations of lexicographic utility

This paper presents an alternative mathematical characterization of lexicographic utility to the one given by Chipman (1960). A natural constructivistic procedure on imposing a lexicographic ordering on the product space of natural numbers is pursued. The consequences on the topological structure of such a space are examined.     

Automorphisms of lexicographic products

The automorphism group Γ(P) of a partially ordered set P consists of all permutations on P that preserve order (and have order preserving inverses). In this paper we raise, and partially answer, the question: How is the automorphism group of the lexicographic product (P × Q) of two orders (P and Q) related to the automorphism groups of the factors, P and Q?We show that the wreath product Γ(Q) wr ΓP) is always contained in Γ(P × Q). We find necessary and sufficient conditions for Γ(P × Q) to equal Γ(Q) wr Γ(P), and when P and Q are finite, we find a complete characterization of Γ(P × Q) in terms of Γ(P), Γ(Q) and properties of P and Q.     

On lexicographic probability relations

In this note I propose a definition for lexicographic probability relations and discuss the question, under what conditions is a probability relation lexicographic.     

Proper rationalizability in lexicographic beliefs

Proper consistency is defined by the property that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain belief of proper consistency, a most preferred strategy is properly rationalizable. Any strategy used with positive probability in a proper equilibrium is properly rationalizable. Only strategies that lead to the backward induction outcome are properly rationalizable in the strategic form of a generic perfect information game. Proper rationalizability can test the robustness of inductive procedures. Final version: December 2001     

On the ultimate lexicographic Hall-ratio

The Hall-ratio ρ(G) of a graph G is the ratio of the number of vertices and the independence number maximized over all subgraphs of G. The ultimate lexicographic Hall-ratio of a graph G is defined as , where G^°n denotes the nth lexicographic power of G (that is, n times repeated substitution of G into itself). Here we prove the conjecture of Simonyi stating that the ultimate lexicographic Hall-ratio equals the fractional chromatic number for all graphs.     

Cayley digraphs and lexicographic product

In this paper, we prove that a Cayley digraph Γ = Cay(G, S) is a nontrivial lexicographical product if and only if there is a nontrivial subgroup H of G such that S∖H is a union of some double cosets of H in G.      

Soft Ideals and Arithmetic Mean Ideals

This article investigates the soft-interior (se) and the soft-cover (sc) of operator ideals. These operations, and especially the first one, have been widely used before, but making their role explicit and analyzing their interplay with the arithmetic mean operations is essential for the study in [10] of the multiplicity of traces. Many classical ideals are ‘soft’, i.e., coincide with their soft interior or with their soft cover, and many ideal constructions yield soft ideals. Arithmetic mean (am) operations were proven to be intrinsic to the theory of operator ideals in [6, 7] and arithmetic mean operations at infinity (am-∞) were studied in [10]. Here we focus on the commutation relations between these operations and soft operations. In the process we characterize the am-interior and the am-∞ interior of an ideal. Both authors were partially supported by grants of the Charles Phelps Taft Research Center; the second named author was partially supported by NSF Grants DMS 95-03062 and DMS 97-06911.     

On Ideals Generated by Positive Operators

Algebra structure of principle ideals of order bounded operators is studied.