We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
By previous work of Giordano and the author, ergodic actions of $\mathbf{Z}$ (and other discrete groups) are completely classified measure-theoretically by their dimension space, a construction analogous to the dimension group used in $\text{C}^{\ast }$-algebras and topological dynamics. Here we investigate how far from approximately transitive (AT) actions can be that derive from circulant (and related) matrices. It turns out not very: although non-AT actions can arise from this method of construction, under very modest additional conditions, approximate transitivity arises. KIn addition, if we drop the positivity requirement in the isomorphism of dimension spaces, then all these ergodic actions satisfy an analogue of AT. Many examples are provided.
In this paper we integrate two strands of the literature on stability of general state Markov chains: conventional, total-variation-based results and more recent order-theoretic results. First we introduce a complete metric over Borel probability measures based on ‘partial’ stochastic dominance. We then show that many conventional results framed in the setting of total variation distance have natural generalizations to the partially ordered setting when this metric is adopted.
We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice induced by antisymmetric closed subsets of roots is again a lattice. We then study further subposets of this lattice that naturally correspond to the elements, the intervals, and the faces of the permutahedron and the generalized associahedra of the corresponding Weyl group. These results extend to arbitrary finite crystallographic root systems the recent results of G. Chatel, V. Pilaud, and V. Pons on the weak order on posets and its induced subposets.
This paper explores the structure groups G(X,r) of finite non-degenerate set-theoretic solutions (X,r) to the Yang–Baxter equation. Namely, we construct a finite quotient $\overline {G}_{(X,r)}$ of G(X,r), generalizing the Coxeter-like groups introduced by Dehornoy for involutive solutions. This yields a finitary setting for testing injectivity: if X injects into G(X,r), then it also injects into $\overline {G}_{(X,r)}$. We shrink every solution to an injective one with the same structure group, and compute the rank of the abelianization of G(X,r). We show that multipermutation solutions are the only involutive solutions with diffuse structure groups; that only free abelian structure groups are bi-orderable; and that for the structure group of a self-distributive solution, the following conditions are equivalent: bi-orderable, left-orderable, abelian, free abelian and torsion free.
This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to whether the set of initial sections of reflection orders, ordered by inclusion, forms a complete lattice. Meet and join in weak order are described in terms of a suitable closure operator. Galois connections are defined from the power set of $W$ to itself, under which maximal subgroups of certain groupoids correspond to certain complete meet subsemilattices of weak order. An analogue of weak order for standard parabolic subsets of any rank of the root system is defined, reducing to the usual weak order in rank zero, and having some analogous properties in rank one (and conjecturally in general).
A new class of functions with a unique identification minor is introduced: functions determined by content and singletons. Relationships between this class and other known classes of functions with a unique identification minor are investigated. Some properties of functions determined by content and singletons are established, especially concerning invariance groups and similarity.
An EMV-algebra resembles an MV-algebra in which a top element is not guaranteed. For $\unicode[STIX]{x1D70E}$-complete $EMV$-algebras, we prove an analogue of the Loomis–Sikorski theorem showing that every $\unicode[STIX]{x1D70E}$-complete $EMV$-algebra is a $\unicode[STIX]{x1D70E}$-homomorphic image of an $EMV$-tribe of fuzzy sets where all algebraic operations are defined by points. To prove it, some topological properties of the state-morphism space and the space of maximal ideals are established.
This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\unicode[STIX]{x1D6F1}$. Natural bijections are constructed between important objects including join-irreducible congruences, join-irreducible (respectively, meet-irreducible) elements of $W$, indecomposable $\unicode[STIX]{x1D70F}$-rigid (respectively, $\unicode[STIX]{x1D70F}^{-}$-rigid) modules and layers of $\unicode[STIX]{x1D6F1}$. The lattice-theoretically natural labelling of the Hasse quiver by join-irreducible elements of $W$ is shown to coincide with the algebraically natural labelling by layers of $\unicode[STIX]{x1D6F1}$. We show that layers of $\unicode[STIX]{x1D6F1}$ are nothing but bricks (or equivalently stones, or 2-spherical modules). The forcing order on join-irreducible elements of $W$ (arising from the study of lattice congruences) is described algebraically in terms of the doubleton extension order. We give a combinatorial description of indecomposable $\unicode[STIX]{x1D70F}^{-}$-rigid modules for type $A$ and $D$.
For a C*-algebra A, determining the Cuntz semigroup Cu(A ⊗) in terms of Cu(A) is an important problem, which we approach from the point of view of semigroup tensor products in the category of abstract Cuntz semigroups by analysing the passage of significant properties from Cu(A) to Cu(A)⊗Cu Cu(). We describe the effect of the natural map Cu(A) → Cu(A)⊗Cu Cu() in the order of Cu(A), and show that if A has real rank 0 and no elementary subquotients, Cu(A)⊗Cu Cu() enjoys the corresponding property of having a dense set of (equivalence classes of) projections. In the simple, non-elementary, real rank 0 and stable rank 1 situation, our investigations lead us to identify almost unperforation for projections with the fact that tensoring with is inert at the level of the Cuntz semigroup.
We provide an equivariant extension of the bivariant Cuntz semigroup introduced in previous work for the case of compact group actions over C*-algebras. Its functoriality properties are explored, and some well-known classification results are retrieved. Connections with crossed products are investigated, and a concrete presentation of equivariant Cuntz homology is provided. The theory that is here developed can be used to define the equivariant Cuntz semigroup. We show that the object thus obtained coincides with the one recently proposed by Gardella [‘Regularity properties and Rokhlin dimension for compact group actions’, Houston J. Math.43(3) (2017), 861–889], and we complement their work by providing an open projection picture of it.
We show that any regular pseudocomplemented Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra determined by a tolerance induced by an irredundant covering.
A function $f:X\rightarrow X$ determines a topology $P(f)$ on $X$ by taking the closed sets to be those sets $A\subseteq X$ with $f(A)\subseteq A$. The topological space $(X,P(f))$ is called a functionally Alexandroff space. We completely characterise the homogeneous functionally Alexandroff spaces.
In this paper, it is proved that the complement of the zero-divisor graph of a partially ordered set is weakly perfect if it has finite clique number, completely answering the question raised by Joshi and Khiste [‘Complement of the zero divisor graph of a lattice’, Bull. Aust. Math. Soc.89 (2014), 177–190]. As a consequence, the intersection graph of an intersection-closed family of nonempty subsets of a set is weakly perfect if it has finite clique number. These results are applied to annihilating-ideal graphs and intersection graphs of submodules.
A random binary search tree grown from the uniformly random permutation of [n] is studied. We analyze the exact and asymptotic counts of vertices by rank, the distance from the set of leaves. The asymptotic fraction ck of vertices of a fixed rank k ≥ 0 is shown to decay exponentially with k. We prove that the ranks of the uniformly random, fixed size sample of vertices are asymptotically independent, each having the distribution {ck}. Notoriously hard to compute, the exact fractions ck have been determined for k ≤ 3 only. We present a shortcut enabling us to compute c4 and c5 as well; both are ratios of enormous integers, the denominator of c5 being 274 digits long. Prompted by the data, we prove that, in sharp contrast, the largest prime divisor of the denominator of ck is at most 2k+1 + 1. We conjecture that, in fact, the prime divisors of every denominator for k > 1 form a single interval, from 2 to the largest prime not exceeding 2k+1 + 1.
Given a poset $P$ and a standard closure operator $\unicode[STIX]{x1D6E4}:{\wp}(P)\rightarrow {\wp}(P)$, we give a necessary and sufficient condition for the lattice of $\unicode[STIX]{x1D6E4}$-closed sets of ${\wp}(P)$ to be a frame in terms of the recursive construction of the $\unicode[STIX]{x1D6E4}$-closure of sets. We use this condition to show that, given a set ${\mathcal{U}}$ of distinguished joins from $P$, the lattice of ${\mathcal{U}}$-ideals of $P$ fails to be a frame if and only if it fails to be $\unicode[STIX]{x1D70E}$-distributive, with $\unicode[STIX]{x1D70E}$ depending on the cardinalities of sets in ${\mathcal{U}}$. From this we deduce that if a poset has the property that whenever $a\wedge (b\vee c)$ is defined for $a,b,c\in P$ it is necessarily equal to $(a\wedge b)\vee (a\wedge c)$, then it has an $(\unicode[STIX]{x1D714},3)$-representation.
The jaggedness of an order ideal $I$ in a poset $P$ is the number of maximal elements in $I$ plus the number of minimal elements of $P$ not in $I$. A probability distribution on the set of order ideals of $P$ is toggle-symmetric if for every $p\in P$, the probability that $p$ is maximal in $I$ equals the probability that $p$ is minimal not in $I$. In this paper, we prove a formula for the expected jaggedness of an order ideal of $P$ under any toggle-symmetric probability distribution when $P$ is the poset of boxes in a skew Young diagram. Our result extends the main combinatorial theorem of Chan–López–Pflueger–Teixidor [Trans. Amer. Math. Soc., forthcoming. 2015, arXiv:1506.00516], who used an expected jaggedness computation as a key ingredient to prove an algebro-geometric formula; and it has applications to homomesies, in the sense of Propp–Roby, of the antichain cardinality statistic for order ideals in partially ordered sets.
To a pair $P$ and $Q$ of finite posets we attach the toric ring $K[P,Q]$ whose generators are in bijection to the isotone maps from $P$ to $Q$. This class of algebras, called isotonian, are natural generalizations of the so-called Hibi rings. We determine the Krull dimension of these algebras and for particular classes of posets $P$ and $Q$ we show that $K[P,Q]$ is normal and that their defining ideal admits a quadratic Gröbner basis.
We study a natural generalization of the noncrossing relation between pairs of elements in $[n]$ to $k$-tuples in $[n]$ that was first considered by Petersen et al. [J. Algebra324(5) (2010), 951–969]. We give an alternative approach to their result that the flag simplicial complex on $\binom{[n]}{k}$ induced by this relation is a regular, unimodular and flag triangulation of the order polytope of the poset given by the product $[k]\times [n-k]$ of two chains (also called Gelfand–Tsetlin polytope), and that it is the join of a simplex and a sphere (that is, it is a Gorenstein triangulation). We then observe that this already implies the existence of a flag simplicial polytope generalizing the dual associahedron, whose Stanley–Reisner ideal is an initial ideal of the Grassmann–Plücker ideal, while previous constructions of such a polytope did not guarantee flagness nor reduced to the dual associahedron for $k=2$. On our way we provide general results about order polytopes and their triangulations. We call the simplicial complex the noncrossing complex, and the polytope derived from it the dual Grassmann associahedron. We extend results of Petersen et al. [J. Algebra324(5) (2010), 951–969] showing that the noncrossing complex and the Grassmann associahedron naturally reflect the relations between Grassmannians with different parameters, in particular the isomorphism$G_{k,n}\cong G_{n-k,n}$. Moreover, our approach allows us to show that the adjacency graph of the noncrossing complex admits a natural acyclic orientation that allows us to define a Grassmann–Tamari order on maximal noncrossing families. Finally, we look at the precise relation of the noncrossing complex and the weak separability complex of Leclerc and Zelevinsky [Amer. Math. Soc. Transl.181(2) (1998), 85–108]; see also Scott [J. Algebra290(1) (2005), 204–220] among others. We show that the weak separability complex is not only a subcomplex of the noncrossing complex as noted by Petersen et al. [J. Algebra324(5) (2010), 951–969] but actually its cyclically invariant part.
In the 1970s, Feldman and Moore classified separably acting von Neumann algebras containing Cartan maximal abelian self-adjoint subalgebras (MASAs) using measured equivalence relations and 2-cocycles on such equivalence relations. In this paper we give a new classification in terms of extensions of inverse semigroups. Our approach is more algebraic in character and less point-based than that of Feldman and Moore. As an application, we give a restatement of the spectral theorem for bimodules in terms of subsets of inverse semigroups. We also show how our viewpoint leads naturally to a description of maximal subdiagonal algebras.
Skew Boolean algebras for which pairs of elements have natural meets, called intersections, are studied from a universal algebraic perspective. Their lattice of varieties is described and shown to coincide with the lattice of quasi-varieties. Some connections of relevance to arbitrary skew Boolean algebras are also established.