English
Related papers

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

200 papers

It is shown that a gerenalised radical group has no chain of non-pronormal subgroups with the same order type as the set of the real numbers if and only if either the group is minimax or all subgroups are pronormal.

Group Theory · Mathematics 2023-07-19 Ulderico Dardano , Fausto De Mari

In the field of categorical probability, one uses concepts and techniques from category theory, such as monads and monoidal categories, to study the structures of probability and statistics. In this paper, we connect some ideas from…

Category Theory · Mathematics 2025-02-24 Mika Bohinen , Paolo Perrone

In 1994, Sule presented the necessary and sufficient conditions of the feedback stabilizability of systems over unique factorization domains in terms of elementary factors and in terms of reduced minors. Recently, Mori and Abe have…

Optimization and Control · Mathematics 2007-05-23 Kazuyoshi MORI

We derive sufficient conditions for the memory kernel which guarantee legitimate (completely positive and trace-preserving) dynamical map. It turns out that these conditions provide a natural parameterizations of the dynamical map being a…

Quantum Physics · Physics 2016-08-24 Dariusz Chruściński , Andrzej Kossakowski

Suitable reachability conditions can make two different fixed point semantics of a transition system coincide. For instance, the total and partial expected reward semantics on Markov chains (MCs) coincide whenever the MC at hand is almost…

Logic in Computer Science · Computer Science 2025-09-08 Mayuko Kori , Kazuki Watanabe , Jurriaan Rot

It is well-known that a Kleinian group is amenable if and only if it is elementary. We establish an analogous property for equivalence relations and foliations with Gromov hyperbolic leaves: they are amenable if and only if they are…

Functional Analysis · Mathematics 2007-05-23 Vadim A. Kaimanovich

In this note, we prove that a semigroup $S$ is left amenable if and only if every two nonzero elements of $\ell^1_+(S)$ have a common nonzero right multiple, where $\ell^1_+(S)$ is the positive part of the Banach algebra $\ell^1(S)$, or…

Functional Analysis · Mathematics 2021-01-29 Tobias Fritz

We study first-order model checking, by which we refer to the problem of deciding whether or not a given first-order sentence is satisfied by a given finite structure. In particular, we aim to understand on which sets of sentences this…

Logic in Computer Science · Computer Science 2014-07-15 Hubie Chen

Classifier chains are popular and effective method to tackle a multi-label classification problem. The aim of this paper is to study the asymptotic properties of the chain model in which the conditional probabilities are of the logistic…

Machine Learning · Computer Science 2016-02-25 Paweł Teisseyre

People organize in groups and contagions spread across them. A simple stochastic process, yet complex to model due to dynamical correlations within and between groups. Moreover, groups can evolve if agents join or leave in response to…

Physics and Society · Physics 2025-05-22 Giulio Burgio , Guillaume St-Onge , Laurent Hébert-Dufresne

We consider general Markov chains with discrete time in an arbitrary measurable (phase) space and homogeneous in time. Markov chains are defined by the classical transition function which within the framework of the operator treatment…

Probability · Mathematics 2020-06-17 Alexander I. Zhdanok

This is the third installment in a series of papers on algebraic set theory. In it, we develop a uniform approach to sheaf models of constructive set theories based on ideas from categorical logic. The key notion is that of a "predicative…

Logic · Mathematics 2014-02-26 Benno van den Berg , Ieke Moerdijk

The class A of countable groups that admit a faithful, transitive, amenable -- in the sense that there is an invariant mean -- action on a set has been widely investigated in the past. In this paper, we no longer require the action to be…

Group Theory · Mathematics 2018-04-18 Claire Anantharaman-Delaroche

Inner amenability is a bridge between amenability of an object and amenability of its operator algebras. It is an open problem of Ananantharman-Delaroche to decide whether all \'etale groupoids are inner amenable. Approximate lattices and…

Operator Algebras · Mathematics 2023-07-06 Gabriel Favre

We consider the notion of herdability, a set-based reachability condition, which asks whether the state of a system can be controlled to be element-wise larger than a non-negative threshold. First a number of foundational results on…

Systems and Control · Computer Science 2019-04-19 Sebastian F Ruf , Magnus Egerstedt , Jeff S. Shamma

We establish a characterization of amenability for general Hausdorff topological groups in terms of matchings with respect to finite uniform coverings. Furthermore, we prove that it suffices to just consider two-element uniform coverings.…

Group Theory · Mathematics 2018-10-16 Friedrich Martin Schneider , Andreas Thom

The configuration space of causal sets is vast. It is a critical goal to map out this space. Here, we take a practical step towards this goal. We investigate nine classes of causal sets, most of them not studied before. These include…

General Relativity and Quantum Cosmology · Physics 2026-05-28 Astrid Eichhorn , Harald Mack , Kim Tuyen Le , Fabian Wagner

Let G be a connected reductive algebraic group over an algebraically closed field k. In a recent paper, Bate, Martin, R\"ohrle and Tange show that every (smooth) subgroup of G is separable provided that the characteristic of k is very good…

Group Theory · Mathematics 2011-12-19 Sebastian Herpel

For certain theories of existentially closed topological differential fields, we show that there is a strong relationship between $\mathcal L\cup\{D\}$-definable sets and their $\mathcal L$-reducts, where $\mathcal L$ is a relational…

Logic · Mathematics 2017-07-26 Françoise Point

The {\em atom-bond connectivity (ABC) index} is a degree-based molecular descriptor, that found chemical applications. It is well known that among all connected graphs, the graphs with minimal ABC index are trees. A complete…

Discrete Mathematics · Computer Science 2014-01-03 Darko Dimitrov
‹ Prev 1 3 4 5 6 7 10 Next ›