Related papers: Cofinitary groups and projective well-orders
We provide a method of constructing better-quasi-orders by generalising a technique for constructing operator algebras that was developed by Pouzet. We then generalise the notion of $\sigma$-scattered to partial orders, and use our method…
Sieg and Wegner showed that the stable exact sequences define a maximal exact structure (in the sense of Quillen) in any pre-abelian category. We generalize this result for weakly idempotent complete additive categories.
Let $A$ be a commutative noetherian ring, $\frak a$ be an ideal of $A$, $m,n$ be non-negative integers and let $M$ be an $A$-module such that $\Ext^i_A(A/\frak a,M)$ is finitely generated for all $i\leq m+n$. We define a class $\cS_n(\frak…
In this paper, we consider covers of finite groups by centralizers of elements. We show that the set of centralizers that are maximal under the partial ordering form a cover of the group. We also show that the set of centralizers that are…
We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…
We introduce and investigate the resolvent order, which is a binary relation on the set of firmly nonexpansive mappings. It unifies well-known orders introduced by Loewner (for positive semidefinite matrices) and by Zarantonello (for…
We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…
The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…
We establish a dilation-theoretic characterization of the Choquet order on the space of measures on a compact convex set using ideas from the theory of operator algebras. This yields an extension of Cartier's dilation theorem to the…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
We study algebraic properties of the semigroup $\mathscr{O\!\!I\!}_n(L)$ of finite partial order isomorphisms of the rank $\leq n$ of an infinite linearly ordered set $(L,\leqslant)$. In particular we describe its idempotents, the natural…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…
We present a proof of a result, previously announced by the second author, that there is a closed (even $\Pi^0_1$) set generating an $F_\sigma$ (even $\Sigma^0_2$) maximal cofinitary group (short, mcg) which is isomorphic to a free group.…
For an algebraic number $\alpha$ we consider the orders of the reductions of $\alpha$ in finite fields. In the case where $\alpha$ is an integer, it is known by the work on Artin's primitive root conjecture that the order is "almost always…
We propose a quantitative notion of permutation stability for finitely generated groups. Our notion is related to, but distinct from, the ``stability rate'' introduced by Becker and Mosheiff (which is valid within the class of finitely…
We investigate two notions about descriptions of groups using first-order language: quasi-finite axiomatizability, concerning infinite groups, and polylogarithmic compressibility, concerning classes of finite groups.
A strict quantization of a compact symplectic manifold $S$ on a subset $I\subseteq\R$, containing 0 as an accumulation point, is defined as a continuous field of $C^*$-algebras $\{A_{\hbar}\}_{\hbar\in I}$, with $A_0=C_0(S)$, and a set of…
Motivated by results on generic-case complexity in group theory, we apply the ideas of effective Baire category and effective measure theory to study complexity classes of functions which are "fractionally computable" by a partial…
We develop a toolbox for forcing over arbitrary models of set theory without the axiom of choice. In particular, we introduce a variant of the countable chain condition and prove an iteration theorem that applies to many classical forcings…