Loading [MathJax]/jax/output/CommonHTML/jax.js
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  Bestsellers

  • articleNo Access

    ON COMPLETING PARTIAL GROUPOIDS TO SEMIGROUPS

    Let formula be a class of semigroups containing all finite commutative bands, and let p(x) be a real polynomial. The formula-completion problem asks whether for a given partial groupoid G there exists a semigroup formula such that G ⊆ S, every product for (a, b) ∈ G2 defined in G coincides with that for (a, b) in S, and |S| ≤ p(|G|). We prove the problem to be ℕℙ-hard in general and ℕℙ-complete if the membership problem for formula is in ℙ.

  • articleNo Access

    Distributive and completely distributive lattice extensions of ordered sets

    It is known that a poset can be embedded into a distributive lattice if, and only if, it satisfies the prime filter separation property. We describe here a class of “prime filter completions” for posets with the prime filter separation property that are completely distributive lattices generated by the poset and preserve existing finite meets and joins. The free completely distributive lattice generated by a poset can be obtained through such a prime filter completion. We also show that every completely distributive completion of a poset with the prime filter separation property is representable as a canonical extension of the poset with respect to some set of filters and ideals. The connections between the prime filter completions and canonical extensions are described and yield the following corollary: the canonical extension of any distributive lattice is the free completely distributive lattice generated by the lattice. A construction that is a variant of the prime filter completion is given that can be used to obtain the free distributive lattice generated by a poset. In addition, it is shown that every distributive lattice extension of the poset can be represented by such a construction. Finally, we show that a poset with the prime filter separation property and the free distributive lattice generated by it generates the same free completely distributive lattice.

  • articleNo Access

    What actually happens when you approach a gravitational singularity?

    Roger Penrose’s 2020 Nobel Prize in Physics recognizes that his identification of the concepts of “gravitational singularity” and an “incomplete, inextendible, null geodesic” is physically very important. The existence of an incomplete, inextendible, null geodesic does not say much, however, if anything, about curvature divergence, nor is it a helpful definition for performing actual calculations. Physicists have long sought for a coordinate independent method of defining where a singularity is located, given an incomplete, inextendible, null geodesic, that also allows for standard analytic techniques to be implemented. In this essay, we present a solution to this issue. It is now possible to give a concrete relationship between an incomplete, inextendible, null geodesic and a gravitational singularity, and to study any possible curvature divergence using standard techniques.

  • articleNo Access

    ON THE COMPLETION OF PRIORITY ORDERINGS IN NONMONOTONIC REASONING SYSTEMS

    We discuss the structure of nonmonotonic reasoning. We suggest that an important aspect of nonmonotonic reasoning systems is the ordering relationship (preference structure) on the propositions in the knowledge. We suggest that this ordering relationship must be a weak order, a complete and transitive relationship. We provide a comprehensive discussion of some central issues in preference theory. In most real applications of nonmonotonic knowledge bases the ordering relationship available is often not complete. We suggest a mechanism for completing these relationships. The basic imperative used in providing this completion is to do it in such a manner as to add as few unjustified inferences as necessary. To formally accomplish this task we introduce a measure of buoyancy associated with a weak order and suggest that the preferred completion is the one with the maximal buoyancy.

  • articleNo Access

    I-COMPACT RIGHT CHAIN DOMAINS

    Generalizing the concept of convergency to valued fields, Ostrowski in the 1930s introduced pseudo-convergent sequences. In the present paper we classify pseudo-convergent sequences in right chain domains R according to the prime ideal P associated to the breadth I of the sequence using an ideal theory developed for right cones in groups. The ring R is I-compact if every pseudo-convergent sequence in R with breadth I has a limit in R, and we construct right chain domains R which are I-compact only for right ideals I in particular subsets formula of the set of all right ideals of R. Krull's perfect valuation rings and then Ribenboim's notion of a valuation ring complete par étages, where formula is the minimal set containing the completely prime ideals in a commutative valuation ring, is a special case. For a non-discrete right invariant rank-one right chain domain R there are exactly two possibilities for the set formula if the value group of R is the group of real numbers under addition, and there are infinitely many possibilities for formula in all other cases.

  • articleNo Access

    Kernels in tropical geometry and a Jordan–Hölder theorem

    When considering affine tropical geometry, one often works over the max-plus algebra (or its supertropical analog), which, lacking negation, is a semifield (respectively, ν-semifield) rather than a field. One needs to utilize congruences rather than ideals, leading to a considerably more complicated theory. In his dissertation, the first author exploited the multiplicative structure of an idempotent semifield, which is a lattice ordered group, in place of the additive structure, in order to apply the extensive theory of chains of homomorphisms of groups. Reworking his dissertation, starting with a semifieldF, we pass to the semifieldF(λ1,,λn) of fractions of the polynomial semiring, for which there already exists a well developed theory of kernels, which are normal convex subgroups of F(λ1,,λn); the parallel of the zero set now is the 1-set, the set of vectors on which a given rational function takes the value 1. These notions are refined in supertropical algebra to ν-kernels (Definition 4.1.4) and 1ν-sets, which take the place of tropical varieties viewed as sets of common ghost roots of polynomials. The ν-kernels corresponding to tropical hypersurfaces are the 1ν-sets of what we call “corner internal rational functions,” and we describe ν-kernels corresponding to “usual” tropical geometry as ν-kernels which are “corner-internal” and “regular.” This yields an explicit description of tropical affine varieties in terms of various classes of ν-kernels. The literature contains many tropical versions of Hilbert’s celebrated Nullstellensatz, which lies at the foundation of algebraic geometry. The approach in this paper is via a correspondence between 1ν-sets and a class of ν-kernels of the rational ν-semifield called polars, originating from the theory of lattice-ordered groups. When F is the supertropical max-plus algebra of the reals, this correspondence becomes simpler and more applicable when restricted to principalν-kernels, intersected with the ν-kernel generated by F. For our main application, we develop algebraic notions such as composition series and convexity degree, leading to a dimension theory which is catenary, and a tropical version of the Jordan–Hölder theorem for the relevant class of ν-kernels.

  • articleNo Access

    Some characterizations of relative sequentially Cohen–Macaulay and relative Cohen–Macaulay modules

    Let M be an R-module over a Noetherian ring R and 𝔞 an ideal of R with c=cd(𝔞,R). First, over an 𝔞-relative Cohen–Macaulay local ring (R,𝔪), we provide a characterization of the 𝔞-relative sequentially Cohen–Macaulay modules M in terms of 𝔞-relative Cohen–Macaulayness of the R-modules ExtciR(M,D𝔞) for all i0, where D𝔞=HomR(Hc𝔞(R),E(R/𝔪)). Next, we prove that M is finite 𝔞-relative Cohen–Macaulay if and only if Hi(LΛ𝔞(Hcd(𝔞,M)𝔞(M)))=0 for all icd(𝔞,M) and Hcd(𝔞,M)(LΛ𝔞(Hcd(𝔞,M)𝔞(M)))ˆM𝔞. Finally, we provide another characterization of 𝔞-relative sequentially Cohen–Macaulay modules M in terms of vanishing of the local homology modules Hj(LΛ𝔞(Hi𝔞(M)))=0 for all 0icd(𝔞,M) and for all ji.

  • articleNo Access

    COMPLETION OF MULTIVARIATE WAVELETS

    The construction of wavelet functions from known scaling functions is called the 'completion problem'. Completion algorithms exist for univariate wavelets, including multiwavelets. For multivariate wavelets, however, completion is not always possible. We present a new algorithm (a generalization of a method of Lai) which works in many cases.

  • articleNo Access

    Compactifications of manifolds with boundary

    This paper is concerned with compactifications of high-dimensional manifolds. Siebenmann’s iconic 1965 dissertation [L. C. Siebenmann, The obstruction to finding a boundary for an open manifold of dimension greater than five, Ph.D. thesis, Princeton Univ. (1965), MR 2615648] provided necessary and sufficient conditions for an open manifold Mm (m6) to be compactifiable by addition of a manifold boundary. His theorem extends easily to cases where Mm is noncompact with compact boundary; however, when Mm is noncompact, the situation is more complicated. The goal becomes a “completion” of Mm, i.e. a compact manifold ˆMm containing a compactum AMm such that ˆMmAMm. Siebenmann did some initial work on this topic, and O’Brien [G. O’Brien, The missing boundary problem for smooth manifolds of dimension greater than or equal to six, Topology Appl.16 (1983) 303–324, MR 722123] extended that work to an important special case. But, until now, a complete characterization had yet to emerge. Here, we provide such a characterization. Our second main theorem involves 𝒵-compactifications. An important open question asks whether a well-known set of conditions laid out by Chapman and Siebenmann [T. A. Chapman and L. C. Siebenmann, Finding a boundary for a Hilbert cube manifold, Acta Math.137 (1976) 171–208, MR 0425973] guarantee 𝒵-compactifiability for a manifold Mm. We cannot answer that question, but we do show that those conditions are satisfied if and only if Mm×[0,1] is 𝒵-compactifiable. A key ingredient in our proof is the above Manifold Completion Theorem — an application that partly explains our current interest in that topic, and also illustrates the utility of the π1-condition found in that theorem.

  • chapterNo Access

    Kac-Moody Groups and Their Representations

    In this expository paper we review some recent results about representations of Kac-Moody groups. We sketch the construction of these groups. If practical, we present the ideas behind the proofs of theorems. At the end we pose open questions.

  • chapterNo Access

    CHARACTERIZING AND COMPLETING NON-RANDOM MISSING VALUES

    Many methods deal with missing values, mainly focused on their completion. However, they complete indifferently all the missing values regardless of their origin, i.e., they assume that all the missing values occur randomly in a dataset. In this paper, we show that many missing values do not stem from randomness, We use the relationships within the data and define four types of missing values. The characterization is made for each missing value. We claim that such a local characterization enables us perceptive techniques to deal with missing values according to their origins. Next, we show how this typology is suitable for completing the missing values: it considers the non-randomness appearance of the missing values and suggests the values of completion.