Related papers: Infinite Lexicographic Products
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This result generalises the ones given up to date.
We prove that, consistently with ZFC, no ultraproduct of countably infinite (or separable metric, non-compact) structures is isomorphic to a reduced product of countable (or separable metric) structures associated to the Fr\'echet filter.…
To each discrete product system E of finite-dimensional Hilbert spaces we associate a C*-algebra O_E. When E is the n-dimensional product system over N, O_E is the Cuntz algebra O_n, and the irrational rotation algebras appear as O_E for…
Let $\mathcal C$ be the category of finite graphs. Lov\`{a}sz shows that the semi-ring of isomorphism classes of $\mathcal C$ (with coproduct as sum, and product as multiplication) is embedded into the direct product of the semi-ring of…
We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…
Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…
Increasingly in recent years, probabilistic computation has been investigated through the lenses of categorical algebra, especially via string diagrammatic calculi. Whereas categories of discrete and Gaussian probabilistic processes have…
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…
We construct centrally large subalgebras in crossed products of $C (X, D)$ by automorphisms in which $D$ is simple, $X$ is compact metrizable, the automorphism induces a minimal homeomorphism of $X$, and a mild technical assumption holds.…
We introduce lexicographic cones, a method of assigning an ordered vector space $\Lex(S)$ to a poset $S$, generalising the standard lexicographic cone. These lexicographic cones are then used to prove that the projective tensor cone of two…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
We classify indecomposable summands of mixed tensor powers of the natural representation for the general linear supergroup up to isomorphism. We also give a formula for the characters of these summands in terms of composite supersymmetric…
We study the asymptotics and fine-scale behavior of quantitative combinatorial measures of infinite words and related dynamical and algebraic structures. We construct infinite recurrent words $w$ whose complexity functions $p_w(n)$ are…
In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"{\i}ss\'{e} limits of classes of finite Steiner triple systems avoiding certain subsystems. The…
We establish the following model-theoretic characterization: profinite $L$-structures, the cofiltered limits of finite $L$-structures,are retracts of ultraproducts of finite $L$-structures. As a consequence, any elementary class of…
The main result of this paper is a probabilistic construction of finite rigid structures. It yields a finitely axiomatizable class of finite rigid structures where no L^omega_{infty, omega} formula with counting quantifiers defines a linear…
We define the continuous modeling property for first-order structures and show that a first-order structure has the continuous modelling property if and only if its age has the embedding Ramsey property. We use generalized indiscernible…
A relational structure is called reversible iff every bijective endomorphism of that structure is an automorphism. We give several equivalents of that property in the class of disconnected binary structures and some its subclasses. For…
We establish a canonical and unique tensor product for commutative monoids and groups in an infinity-category C which generalizes the ordinary tensor product of abelian groups. Using this tensor product we show that E_n-(semi)ring objects…