Tae Ho Choe, Young Park · Pacific Journal of Mathematics · 1979
For a completely regular ordered space X, the Stone-Cech order compactification &(X) has been constructed by Nachbin. This compactification is a generalized concept of the ordinary Stone-Cech compactification (X) in the sense that if X has the discrete order: x ^ y iff x = y, then X = X. In this paper, for a convex ordered space X with a semi-closed order, the Wallman order compactification o (X) is constructed by the use of the concept of maximal bifilters. o (X) is a Tx-compact ordered topological space in which X is densely embedded in both the topological and order sense.
Cited by 32Open access
University of Pennsylvania Press, Inc. eBooks · 2022
Cited by 0
National Cancer Institute · Definitions · 2020
Ope n Pe e r v ie
Cited by 0Open access
Т. Жанлав, О. Чулуунбаатар · Mathematical engineering · 2024
Cited by 0
Richard Laver · Annals of Mathematics · 1971
ing from the embeddability relation between order types, define a quasi-order to be a reflexive, transitive relation. Throughout this paper, the letters Q and R will range over quasi-ordered sets and classes. Various quasi-ordered spaces will be defined; in each case we will use the symbol i<(,, of members of Q, 9i, j < (o: i < j and qj ? qj, equivalently, (ii) every descending sequence of members of Q is finite, and every antichain of members of Q is finite. Thus, in these terms, the first of the two theorems listed in the introduction reads: the class OR is wqo under the embeddability relation. Well-quasi-orderings were first studied by Higman in [5], where the equivalence of the two definitions (immediate from Ramsey's theorem) was observed. If q E Q, let Qq ={r E Q: q S r}. From part (i) in the definition of wqo (which will be the version of wqo used from now on) we have immediately the following Induction principle for well-quasi-orderings: If a proposition F(Q) is true This content downloaded from 157.55.39.17 on Wed, 31 Aug 2016 04:08:56 UTC All use subject to http://about.jstor.org/terms
Cited by 171
Einfeldt, B., Aachen Technische Hochschule (Germany). Inst. fuer Geometrie und Praktische Mathematik., Deutsche Forschungsgemeinschaft (DFG), Bonn (Germany) · OpenGrey (Institut de l'Information Scientifique et Technique) · 1985
Cited by 0
PAN, XUEYU · Monash University · 2021
It is a central theme in group theory to classify groups up to isomorphism. Of particular interest is the classification of all groups of a given order. In this thesis I investigate groups whose orders factorise in few primes. Classifications of these groups exist in the literature, but it is often difficult to extract the results. The aim of my thesis is to describe these classifications in a unified, modern language. An important and practical aspect of my new descriptions is that they lead to efficient algorithms for enumerating, constructing, and identifying groups of these orders.
Cited by 0Open access
2008
Cited by 0
WORLD SCIENTIFIC eBooks · 2025
Cited by 0
Richard Laver · Annals of Mathematics · 1973
Cited by 36
Donatien N’dri, André Garon, Marie‐Isabelle Farinas et al. · Communications in Numerical Methods in Engineering · 2005
In this note we study two bubbles stabilized methods used for the incompressible Navier–Stokes equations. The well known mini element and the recently developed pressure bubbles stabilization, which consist of using the mini element enriched with one additional bubble function for the velocity and one pressure bubble function. Both elements are stable in the sense that the underlying pair of discrete spaces for velocity and pressure satisfies the so-called ‘inf–sup’ condition. For some two-dimensional problems, we compared numerically both elements in order to assess the impact of the two additional bubbles in terms of stability and accuracy. Copyright © 2005 John Wiley & Sons, Ltd.
Cited by 0
Xueyu Pan · Figshare · 2021
It is a central theme in group theory to classify groups up to isomorphism. Of particular interest is the classification of all groups of a given order. In this thesis I investigate groups whose orders factorise in few primes. Classifications of these groups exist in the literature, but it is often difficult to extract the results. The aim of my thesis is to describe these classifications in a unified, modern language. An important and practical aspect of my new descriptions is that they lead to efficient algorithms for enumerating, constructing, and identifying groups of these orders.
Cited by 1Open access
Human Rhinovirus A, Human Rhinovirus B · 2015
Code † To remove from the existing genus in the family°* the following species: Code † To assign the species above in the existing genus:* in the family°* Code † To remove the existing genus:* in the family°* † Assigned by ICTV officers ° leave blank if inappropriate * repeat these lines and the corresponding arguments for each genus created in the family Author(s) with email address(es) of the Taxonomic Proposal
Cited by 0
Stephanie Weirich · 2003
Cited by 0
Scott Francis Davis · SIAM Journal on Scientific and Statistical Computing · 1988
Harten, Lax, and van Leer showed how to construct a simple approximate Riemann solution which contains only one intermediate step. This construction assumes that you have a priori bounds on the smallest and largest signal velocities in the exact Riemann solution. Here we propose a number of algorithms for obtaining these bounds. Heuristic arguments are presented to support our choice of bounds. We derive first-order schemes which use these approximate Riemann solutions and show their relationship to known finite difference schemes. Next, we use the approach of van Leer et al. [1] to construct second-order schemes based on these approximate Riemann solutions. Of particular interest is a central difference scheme requiring no upwind switches. This scheme is only slightly more complex than standard predictor–corrector finite difference schemes. Preliminary numerical results are presented which show that these schemes are nonoscillatory, have good shock resolution and produce results which are competitive with those produced by more complex second order Godunov-type schemes.
Cited by 435
Greg Aloupis, John Iacono, Stefan Langerman et al. · arXiv (Cornell University) · 2013
The order type of a point set in $R^d$ maps each $(d{+}1)$-tuple of points to its orientation (e.g., clockwise or counterclockwise in $R^2$). Two point sets $X$ and $Y$ have the same order type if there exists a mapping $f$ from $X$ to $Y$ for which every $(d{+}1)$-tuple $(a_1,a_2,\ldots,a_{d+1})$ of $X$ and the corresponding tuple $(f(a_1),f(a_2),\ldots,f(a_{d+1}))$ in $Y$ have the same orientation. In this paper we investigate the complexity of determining whether two point sets have the same order type. We provide an $O(n^d)$ algorithm for this task, thereby improving upon the $O(n^{\lfloor{3d/2}\rfloor})$ algorithm of Goodman and Pollack (1983). The algorithm uses only order type queries and also works for abstract order types (or acyclic oriented matroids). Our algorithm is optimal, both in the abstract setting and for realizable points sets if the algorithm only uses order type queries.
Cited by 0Open access
Iordanis Kalaitzoglou, Boulis Maher Ibrahim · International Review of Financial Analysis · 2023
Cited by 2
Schaik, M.C. van · Utrecht University Repository (Utrecht University) · 2019
Cited by 0Open access
David R. Dowty, Robert E. Wall, Stanley Peters · Studies in linguistics and philosophy · 1981
Cited by 0
Masatoshi Fujii, Eizaburo Kamei · 2015
Abstract. Uchiyama gave a generalization of the grand Furuta inequality and Furuta discussed it based on his previous result. Motivated by such discussions around the Furuta inequality, we consider Furuta type operator inequalities, whose hidden key is the chaotic order, i.e., logA ≥ logB for positive invertible operators A and B. Among others, Furuta’s theorem is appeared as follows: For A ≥ B ≥ C&gt; 0 and 0 ≤ t ≤ 1 ≤ p (1) B ≥ C ≥ B t2A−tB t2] 1 β (Bt \\ β−t p−t Cp) ≥ B t2A−rB t2] 1−t+r β−t+r (Bt \\ β−t p−t
Cited by 0