English
Related papers

Related papers: Saturation of reduced products

200 papers

Given weakly exact tracial von Neumann algebras $M_{1}, M_{2}$ with a common injective amalgam $B$, we prove that the amalgamated free product $M_{1}\overline{*}_{B}M_{2}$ is biexact relative to $\{M_{1},M_{2}\}$. In the case where $ M_1 $…

Operator Algebras · Mathematics 2025-08-19 Kai Toyosawa , Zhiyuan Yang

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

Combinatorics · Mathematics 2024-05-17 Paul Bastide , Carla Groenland , Maria-Romina Ivan , Tom Johnston

We prove that the module categories of Noether algebras (i.e., algebras module finite over a noetherian center) and affine noetherian PI algebras over a field enjoy the following product property: Whenever a direct product $\prod_{n \in…

Representation Theory · Mathematics 2014-07-10 Birge Huisgen-Zimmermann , Manuel Saorín

We show that if E is a Frechet G\rtimes S(M)-module, for which the canonical map from the projective completion G\rtimes S(M) {\widehat \otimes} E to E is surjective, then every element of E can be written as a finite sum of elements of the…

funct-an · Mathematics 2016-02-15 Larry B. Schweitzer

We call a restriction semigroup almost perfect if it is proper and its least monoid congruence is perfect. We show that any such semigroup is isomorphic to a `$W$-product' $W(T,Y)$, where $T$ is a monoid, $Y$ is a semilattice and there is a…

Group Theory · Mathematics 2014-04-28 Peter R. Jones

We first prove that for every metrizable space $X$, for every closed subset $F$ whose complement is zero-dimensional, the space $X$ can be embedded into a product space of the closed subset $F$ and a metrizable zero-dimensional space as a…

General Topology · Mathematics 2026-01-13 Yoshito Ishiki

For infinite products of compact spaces, Tychonoff's theorem asserts that their product is compact, in the product topology. Tychonoff's theorem is shown to be equivalent to the axiom of choice. In this paper, we show that any countable…

General Mathematics · Mathematics 2021-11-05 Garimella Sagar , Duggirala Ravi

In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…

Dynamical Systems · Mathematics 2025-01-29 Dimitrios Charamaras , Andreas Mountakis

We characterize ultrafilter convergence and ultrafilter compactness in linearly ordered and generalized ordered topological spaces. In such spaces, and for every ultrafilter $D$, the notions of $D$-compactness and of $D$-pseudocompactness…

General Topology · Mathematics 2016-08-30 Paolo Lipparini

Let $A$ be a homogeneous C*-algebra and $\phi$ a state on $A.$ We show that if $\phi$ satisfies a certain faithfulness condition, then there is a net of finite-rank, unital completely positive, $\phi$-preserving maps on $A$ that tend to the…

Operator Algebras · Mathematics 2013-06-19 Caleb Eckhardt

A squarefree monomial ideal is called an $f$-ideal if its Stanley-Reisner and facet simplicial complexes have the same $f$-vector. We show that $f$-ideals generated in a fixed degree have asymptotic density zero when the number of variables…

Commutative Algebra · Mathematics 2020-11-09 Huy TÀi HÀ , Graham Keiper , Hasan Mahmood , Jonathan L. O'Rourke

We prove that product-free sets of the free group over a finite alphabet have maximum density $1/2$ with respect to the natural measure that assigns total weight one to each set of irreducible words of a given size. This confirms a…

Combinatorics · Mathematics 2024-09-12 Miquel Ortega , Juanjo Rué , Oriol Serra

This paper presents a type theory with a form of equality reflection: provable equalities can be used to coerce the type of a term. Coercions and other annotations, including implicit arguments, are dropped during reduction of terms. We…

Programming Languages · Computer Science 2011-01-25 Vilhelm Sjöberg , Aaron Stump

We study the notion of permutation stability (or P-stability) for countable groups. Our main result provides a wide class of non-amenable product groups which are not P-stable. This class includes the product group $\Sigma\times\Lambda$,…

Group Theory · Mathematics 2019-09-04 Adrian Ioana

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

Group Theory · Mathematics 2021-02-16 D. Osin

A topological space is iso-dense if it has a dense set of isolated points. A topological space is scattered if each of its non-empty subspaces has an isolated point. In $\mathbf{ZF}$, in the absence of the axiom of choice, basic properties…

General Topology · Mathematics 2021-01-11 Kyriakos Keremedis , Eleftherios Tachtsis , Eliza Wajch

In this paper, we study stability of $M$-compactness for $l^p$ sum of Banach spaces for $1\leq p<\infty$. We also obtain a characterization of $M$-compact sets in terms of statistically maximizing sequence, a notion which is weaker than a…

Functional Analysis · Mathematics 2020-08-20 Susmita Seal , Sumit Som , Sudeshna Basu , Lakshmi Kanta Dey

We study the combinatorial, algebraic and geometric properties of the free product operation on matroids. After giving cryptomorphic definitions of free product in terms of independent sets, bases, circuits, closure, flats and rank…

Combinatorics · Mathematics 2007-05-23 Henry Crapo , William Schmitt

Let $\left(X_n, d_n\right)$ be a sequence of metric spaces and let $\mathcal{F}=\left\{f_n\right\}_{n \in \mathbb{Z}}$ be a sequence of continuous and onto maps $f_n: X_n \rightarrow X_{n+1}, n \in \mathbb{Z}_{+}$. In this paper, we prove…

Dynamical Systems · Mathematics 2024-03-26 Min An

Saturation is a fundamental game-semantic property satisfied by strategies that interpret higher-order concurrent programs. It states that the strategy must be closed under certain rearrangements of moves, and corresponds to the intuition…

Programming Languages · Computer Science 2024-02-14 Alex Dixon , Andrzej S. Murawski