English
Related papers

Related papers: The embedding structure for linearly ordered topol…

200 papers

We show that for any uncountable cardinal $\lambda$, the category of sets of cardinality at least $\lambda$ and monomorphisms between them cannot appear as the category of point of a topos, in particular is not the category of models of a…

Category Theory · Mathematics 2020-05-11 Simon Henry

Recently a new kind of approximation to continuum topological spaces has been introduced, the approximating spaces being partially ordered sets (posets) with a finite or at most a countable number of points. The partial order endows a poset…

q-alg · Mathematics 2008-02-03 Elisa Ercolessi , Giovanni Landi , Paulo Teotonio-Sobrinho

A new class of partial order-types, class $\gbqo^+$ is defined and investigated here. A poset $P$ is in the class $W^+ $ iff the free poset algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the free lattice $L(P)$.…

General Topology · Mathematics 2012-10-23 Uri Abraham , Robert Bonnet , Wieslaw Kubis

A (generalized) topological space is called an iso-dense space if the set of all its isolated points is dense in the space. The main aim of the article is to show in $\mathbf{ZF}$ a new characterization of iso-dense spaces in terms of…

General Topology · Mathematics 2024-04-11 Tom Richmond , Eliza Wajch

We investigate connections between resolvability and different forms of tightness. This study is adjacent to [1,2]. We construct a non-regular refinement $\tau^*$ of the natural topology of the real line $\mathbb{R}$ with properties such…

General Topology · Mathematics 2025-07-29 Anton Lipin

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…

Logic · Mathematics 2021-06-17 Paul K. Gorbow

We establish an upper bound on the number of real multiquadratic fields that admit a universal quadratic lattice of a given rank, or contain a given amount of indecomposable elements modulo totally positive units, obtaining density zero…

Number Theory · Mathematics 2024-05-08 Siu Hang Man

We classify all finite linear spaces on at most 15 points admitting a blocking set. There are no such spaces on 11 or fewer points, one on 12 points, one on 13 points, two on 14 points, and five on 15 points. The proof makes extensive use…

Combinatorics · Mathematics 2007-05-23 L. M. Pretorius , K. J. Swanepoel

In this paper we introduce a new topological Ramsey space whose elements are infinite ordered polyhedra. Then, we show as an application that the set of finite polyhedra satisfies two types of Ramsey property: one, when viewed as a category…

Combinatorics · Mathematics 2016-02-08 Jose G. Mijares , Gabriel Padilla

We show that the concept of topological order, introduced to describe ordered quantum systems which cannot be classified by broken symmetries, also applies to classical systems. Starting from a specific example, we show how to use pure…

Strongly Correlated Electrons · Physics 2011-11-09 Claudio Castelnovo , Claudio Chamon , .

We consider, for infinite cardinals kappa and alpha <= kappa^+, the group Pi(kappa,< alpha) of sequences of integers, of length kappa, with non-zero entries in fewer than alpha positions. Our main result tells when Pi(kappa,< alpha) can be…

Logic · Mathematics 2007-05-23 Andreas Blass , Saharon Shelah

We use finite group topological lattice gauge theory, also known as the quantum double model, as a lens to explore a notion of topological order enriched by a non-invertible symmetry. For invertible symmetry enriched topological order,…

Strongly Correlated Electrons · Physics 2026-05-28 Lea E. Bottini , Clement Delcamp , Edmund Heng , Campbell K. McLauchlan , Dominic J. Williamson

We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of $\omega_1$-like models of set theory. Specifically, under the $\diamondsuit$…

Logic · Mathematics 2015-01-07 Gunter Fuchs , Victoria Gitman , Joel David Hamkins

Spaces of quasi-invariant measures supplied with different topologies are studied. Their embeddings, projective decompositions, conditions for their metrizability are investigated. Theorems about convergence of nets of quasi-invariant…

Probability · Mathematics 2016-06-08 Sergey Victor Ludkowski

We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…

Logic · Mathematics 2018-12-06 Riccardo Camerlo , Alberto Marcone , Luca Motto Ros

Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…

Logic in Computer Science · Computer Science 2022-09-07 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

We investigate closed subsets (subsemigroups, resp.) of compact-like topological spaces (semigroups, resp.). We prove that each Hausdorff topological space can be embedded as a closed subspace into an H-closed topological space. However,…

General Topology · Mathematics 2019-08-09 Serhii Bardyla , Alex Ravsky

We propose a route toward realizing fractionalized topological phases of matter (i.e. with intrinsic topological order) by literally building on un-fractionalized phases. Our approach employs a Kondo lattice model in which a gapped…

Strongly Correlated Electrons · Physics 2017-10-20 Timothy H. Hsieh , Yuan-Ming Lu , Andreas W. W. Ludwig

We consider semiflows in general Banach spaces motivated by monotone cyclic feedback systems or differential equations with integer-valued Lyapunov functionals. These semiflows enjoy strong monotonicity properties with respect to cones of…

Dynamical Systems · Mathematics 2016-03-17 Lirui Feng , Yi Wang , Jianhong Wu

We study the program complexity of datalog on both finite and infinite linear orders. Our main result states that on all linear orders with at least two elements, the nonemptiness problem for datalog is EXPTIME-complete. While containment…

Logic in Computer Science · Computer Science 2015-07-01 Martin Grohe , Goetz Schwandtner
‹ Prev 1 8 9 10 Next ›