English
Related papers

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

200 papers

Every symbolic system supports a Borel measure that is invariant under the shift, but it is not known if every such systems supports a measure that is invariant under all of its automorphisms; known as a characteristic measure. We give…

Dynamical Systems · Mathematics 2023-07-14 Van Cyr , Bryna Kra , Samuel Petite

Recent work on the logical structure of non-locality has constructed scenarios where observations of multi-partite systems cannot be adequately described by compositions of non-signaling subsystems. In this paper we apply these frameworks…

Computer Science and Game Theory · Computer Science 2015-12-10 William Zeng , Philipp Zahn

In this paper, our goal is to characterize two graph classes based on the properties of minimal vertex (edge) separators. We first present a structural characterization of graphs in which every minimal vertex separator is a stable set. We…

Discrete Mathematics · Computer Science 2011-03-16 Mrinal Kumar , Gaurav Maheswari , N. Sadagopan

In 2005, Abdollahi and Rejali, studied the relations between paradoxical decompositions and configurations for semigroups. In the present paper, we introduce another concept of amenability on semigroups and groups which includes amenability…

Functional Analysis · Mathematics 2015-01-27 Ali Tavakoli , Ali Rejali

Non-local correlations between a fully characterised quantum system and an untrusted black box device are described by an assemblage of conditional quantum states. These assemblages form a convex set, whose extremal points are relevant in…

Quantum Physics · Physics 2022-09-14 Thomas Cope , Tobias J. Osborne

We study the class structure of finite-alphabet Markov chains with arbitrary memory length. To capture the structural constraints induced by prohibited transitions, we introduce the skeleton of a higher-order transition kernel, defined as a…

It is known that the set of permutations, under the pattern containment ordering, is not a partial well-order. Characterizing the partially well-ordered closed sets (equivalently: down sets or ideals) in this poset remains a wide-open…

Combinatorics · Mathematics 2007-05-23 Maximillian Murphy , Vincent Vatter

A nonparametric family of conditional distributions is introduced, which generalizes conditional exponential families using functional parameters in a suitable RKHS. An algorithm is provided for learning the generalized natural parameter,…

Machine Learning · Statistics 2018-04-10 Michael Arbel , Arthur Gretton

Adapting a proof of Bouscaren and Delon, we show that every type-definable connected group in a given stable theory of fields embeds into an algebraic group, under a condition on the definable closure. We also present general hypotheses…

Logic · Mathematics 2025-10-29 Charlotte Bartnick

Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…

Logic · Mathematics 2012-11-19 Tomasz Gogacz , Krzysztof Krupinski

In Pawlak rough sets, the structure of the definable set families is simple and clear, but in generalizing rough sets, the structure of the definable set families is a bit more complex. There has been much research work focusing on this…

Artificial Intelligence · Computer Science 2013-10-10 Hua Yao , William Zhu

We consider reducibility of equivalence relations (ERs, for brevity), in a nonstandard domain, in terms of the Borel reducibility and the countably determined (CD, for brevity) reducibility. This reveals phenomena partially analogous to…

Logic · Mathematics 2018-08-16 Vladimir Kanovei , Michael Reeken

Irreducible Artin groups of finite type can be parametrized via their associated Coxeter diagrams into six sporadic examples and four infinite families, each of which is further parametrized by the natural numbers. Within each of these four…

Group Theory · Mathematics 2018-04-13 Arpan Kabiraj , T. V. H. Prathamesh , Rishi Vyas

This paper deals with dynamical networks for which the relations between node signals are described by proper transfer functions and external signals can influence each of the node signals. We are interested in graph-theoretic conditions…

Optimization and Control · Mathematics 2019-12-02 Henk J. van Waarde , Pietro Tesi , M. Kanat Camlibel

This paper studies the problem of learning causal structures from observational data. We reformulate the Structural Equation Model (SEM) with additive noises in a form parameterized by binary graph adjacency matrix and show that, if the…

Machine Learning · Computer Science 2022-01-11 Ignavier Ng , Shengyu Zhu , Zhuangyan Fang , Haoyang Li , Zhitang Chen , Jun Wang

The subgroup generated by all solvable normal subgroups in a pseudo-finite group with the descending chain condition on centralizers up to finite index is solvable. Additionally, there is no finitely generated pseudo-finite group whose…

Group Theory · Mathematics 2026-05-06 Nadja Hempel , Ulla Karhumäki

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

Group Theory · Mathematics 2010-07-06 Robert Gilman , Alexei Miasnikov , Denis Osin

We obtain a complete structural characterization of Cohn-Leavitt algebras over no-exit objects as graded involutive algebras. Corollaries of this result include graph-theoretic conditions characterizing when a Leavitt path algebra is a…

Rings and Algebras · Mathematics 2020-04-08 Lia Vas

Let $\Gamma$ be a countable group acting on a countable set $X$ by permutations. We give a necessary and sufficient condition for the action to have a quasi-invariant mean with a given cocycle. This can be viewed as a combinatorial analogue…

Functional Analysis · Mathematics 2011-10-11 Gabor Elek , Adam Timar

The reduced C*-algebra of a countable linear group G is shown to be simple if and only if G has no nontrivial normal amenable subgroups. Moreover, these conditions are shown to be equivalent to the uniqueness of tracial state on the…

Group Theory · Mathematics 2009-05-24 Tal Poznansky