English
Related papers

Related papers: Divisibility in the Stone-\v{C}ech compactificatio…

200 papers

Let $M$ be a free module of rank $m$ over a commutative unital ring $R$ and let $N$ be its free submodule. We consider the problem when a given element of the exterior product $\Lambda^pM$ is divisible, in a sense, over elements of the…

Commutative Algebra · Mathematics 2022-04-04 Bronisław Jakubczyk

Mitsch's natural partial order on the semigroup of binary relations is here characterised by equations in the theory of relation algebras. The natural partial order has a complex relationship with the compatible partial order of inclusion,…

Group Theory · Mathematics 2015-07-21 D. G. FitzGerald

We study completely syndetic (CS) sets in discrete groups - subsets that for every natural n admit finitely many left translates that jointly cover every n-tuple of group elements. While for finitely-generated groups, the non-virtually…

Group Theory · Mathematics 2025-06-24 Guy Salomon , Yotam Svoray , Ariel Yadin

We carry out a systematic, topos-theoretically inspired, investigation of Wallman compactifications with a particular emphasis on their relations with Gelfand spectra and Stone-Cech compactifications. In addition to proving several specific…

Category Theory · Mathematics 2012-04-17 Olivia Caramello

This article aims to obtain a characterization of the canonical extension of Boolean homomorphisms through the Stone-\v{C}ech compactification. Then, we will show that one-to-one homomorphisms and onto homomorphisms extend to one-to-one…

Logic · Mathematics 2018-06-04 Luciano J. González

We consider three notions of divisibility in the Cuntz semigroup of a C*-algebra, and show how they reflect properties of the C*-algebra. We develop methods to construct (simple and non-simple) C*-algebras with specific divisibility…

Operator Algebras · Mathematics 2014-02-26 Leonel Robert , Mikael Rordam

Our purpose is to study in the setting of locally compact groupoids the analogues of the well-known equivalent definitions of exactness for discrete groups. Our best results are obtained for a class of \'etale groupoids that we call inner…

Operator Algebras · Mathematics 2026-03-10 Claire Anantharaman-Delaroche

The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…

Group Theory · Mathematics 2026-04-10 Angsuman Das , Hiranya Kishore Dey , Khyati Sharma

The paper studies computability-theoretic aspects of topological $T_0$-spaces. We introduce effective versions of the notions of a countable $c$-poset and a (second-countable) topological space with base. Based on this, we prove an…

We define the notion of componentwise regularity and study some of its basic properties. We prove an analogue, when working with weight orders, of Buchberger's criterion to compute Gr\"obner bases; the proof of our criterion relies on a…

Commutative Algebra · Mathematics 2013-08-28 Giulio Caviglia , Matteo Varbaro

Assuming $\mathfrak b = \mathfrak c$ (or some weaker statement), we construct a compactification $\gamma\omega$ of $\omega$ such that its remainder $\gamma\omega\setminus\omega$ is nonseparable and carries a strictly positive measure.

General Topology · Mathematics 2015-01-29 Piotr Drygier , Grzegorz Plebanek

The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…

Combinatorics · Mathematics 2019-09-17 Peter Bernstein , Cashous Bortner , Samuel Coskey , Shuni Li , Connor Simpson

We describe a partial order on finite simplicial complexes. This partial order provides a poset stratification of the product of the Ran space of a metric space and the nonnegative real numbers, through the \v Cech simplicial complex. We…

Algebraic Topology · Mathematics 2021-04-27 Jānis Lazovskis

We describe a natural generalization of irreducibility in order lattices with arbitrary metrics. We analyse the special cases of valuation metrics and more general metrics for lattices. This article is mainly based on a part of the author's…

Metric Geometry · Mathematics 2010-05-28 Andreas Lochmann

In [Decompositions and statistics for \beta(1,0)-trees and nonseparable permutations, Advances Appl. Math. 42 (2009) 313--328] we introduced an involution, h, on \beta(1,0)-trees. We neglected, however, to prove that h indeed is an…

Combinatorics · Mathematics 2012-10-08 Anders Claesson , Sergey Kitaev , Einar Steingrímsson

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

Logic in Computer Science · Computer Science 2011-02-15 Saeed Asaeedi , Farzad Didehvar

We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…

Logic · Mathematics 2025-11-07 Jason Block , Russell Miller

Let $G$ be a group, $\beta G$ is the Stone-$\check{C}$ech compactification of $\beta G$ endowed with the structure of a right topological semigroup, $G^*=\beta G\setminus G$. Given any subset $A$ of $G$ and $p\in G^*$, we define the…

Group Theory · Mathematics 2013-08-08 I. Protasov , S. Slobodianiuk

Let $k$ be a number field, let ${\mathcal{A}}$ be a commutative algebraic group defined over $k$ and let $p$ be a prime number. Let ${\mathcal{A}}[p]$ denote the $p$-torsion subgroup of ${\mathcal{A}}$. We give some sufficient conditions…

Number Theory · Mathematics 2019-04-09 Laura Paladino

The finite satisfiability problem of monadic second order logic is decidable only on classes of structures of bounded tree-width by the classic result of Seese (1991). We prove the following problem is decidable: Input: (i) A monadic second…

Logic in Computer Science · Computer Science 2016-04-19 Tomer Kotek , Helmut Veith , Florian Zuleger