Related papers: Chain conditions, elementary amenable groups, and …

Let L be a lattice admitting a left-modular chain of length r, not necessarily maximal. We show that if either L is graded or the chain is modular, then the (r-2)-skeleton of L is vertex-decomposable (hence shellable). This proves a…

Families of unconditionally $\tau$-closed and $\tau$-algebraic sets in a group are defined, which are natural generalizations of unconditionally closed and algebraic sets defined by Markov. A sufficient condition for the coincidence of…

We prove that every countable subgroup of a compact metrizable abelian group has a characterizing set. As an application, we answer several questions on maximally almost periodic (MAP) groups and give a characterization of the class of…

We show that the tensor product of approximately amenable algebras need not be approximately amenable, and investigate conditions under which $A$ and $B$ being approximately amenable implies, or is implied by, $A\hat{\otimes}B$ or…

We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We show that treeable, hyper-u-amenable countable Borel…

Mostof the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample. However, many practical problems are characterized by temporal dependence and strong…

We establish a new connection between local and large-scale structure in compactly generated totally disconnected locally compact (t.d.l.c.) groups $G$, finding a sufficient condition for $G$ to have more than one end in terms of its…

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

Beyond the locally compact case, equivalent notions of amenability diverge, and some properties no longer hold, for instance amenability is not inherited by topological subgroups. This investigation is guided by some amenability-type…

We investigate the supports of extremal martingale measures with pre-specified marginals in a two-period setting. First, we establish in full generality the equivalence between the extremality of a given measure $Q$ and the denseness in…

This paper considers a challenging problem of identifying a causal graphical model under the presence of latent variables. While various identifiability conditions have been proposed in the literature, they often require multiple pure…

We show that every free continuous action of a countably infinite elementary amenable group on a finite-dimensional compact metrizable space is almost finite. As a consequence, the crossed products of minimal such actions are…

We consider a dichotomy for analytic families of trees stating that either there is a colouring of the nodes for which all but finitely many levels of every tree are nonhomogeneous, or else the family contains an uncountable antichain. This…

We show that elementary amenable groups, which have a bound on the orders of their finite subgroups, admit a finite dimensional model for the classifying space with virtually cyclic isotropy.

We give three necessary and sufficient conditions for a pro-p group to be p-adic analytic. We show that a noetherian pro-p group having finite chain length has a finite rank and conversely. We further deduce that a noetherian pro-p group…

The literature provides dichotomies involving homomorphisms (like the G 0 dichotomy) or reductions (like the characterization of sets potentially in a Wadge class of Borel sets, which holds on a subset of a product). However, part of the…

We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…

Chain conditions are one of the major tools used in the theory of forcing. We say that a partial order has the countable chain condition if every antichain (in the sense of forcing) is countable. Without the axiom of choice antichains tend…

Deciding whether a collection of unrooted trees is compatible is a fundamental problem in phylogenetics. Two different graph-theoretic characterizations of tree compatibility have recently been proposed. In one of these, tree compatibility…

This paper presents new graph-theoretic conditions for structural target controllability of directed networks. After reviewing existing conditions and highlighting some gaps in the literature, we introduce a new class of network systems,…