Results 81 to 90 of about 523 (235)

Compact and finite‐type support in the homology of big mapping class groups

open access: yesJournal of the London Mathematical Society, Volume 112, Issue 3, September 2025.
Abstract For any infinite‐type surface S$S$, a natural question is whether the homology of its mapping class group contains any non‐trivial classes that are supported on (i) a compact subsurface; or (ii) a finite‐type subsurface. Our purpose here is to study this question, in particular giving an almost‐complete answer when the genus of S$S$ is ...
Martin Palmer, Xiaolei Wu
wiley   +1 more source

Modal operators for meet-complemented lattices [PDF]

open access: yes, 2020
We investigate some modal operators of necessity and possibility in the context of meet-complemented (not necessarily distributive) lattices. We proceed in stages.
Castiglioni, José Luis   +1 more
core  

Producing posets

open access: yesDiscrete Mathematics, 1981
AbstractMany of the well-known selection and sorting problems can be understood as the production of certain partial orders, using binary comparisons. The paper discusses the complexity of the production of arbitrary posets all of a given size n (on a totally ordered ground-set).
openaire   +3 more sources

Geometric realizations of the s‐weak order and its lattice quotients

open access: yesJournal of the London Mathematical Society, Volume 112, Issue 3, September 2025.
Abstract For an n$n$‐tuple s${\bm{s}}$ of nonnegative integers, the s${\bm{s}}$‐weak order is a lattice structure on s${\bm{s}}$‐trees, generalizing the weak order on permutations. We first describe the join irreducible elements, the canonical join representations, and the forcing order of the s${\bm{s}}$‐weak order in terms of combinatorial objects ...
Eva Philippe, Vincent Pilaud
wiley   +1 more source

Cyclic posets and triangulation clusters

open access: yes, 2019
Triangulated categories coming from cyclic posets were originally introduced by the authors in [IT15b] as a generalization of the constructions of various triangulated categories with cluster structures.
Igusa, Kiyoshi, Todorov, Gordana
core   +1 more source

Independence posets

open access: yesJournal of Combinatorics, 2019
Let $G$ be an acylic directed graph. For each vertex $g \in G$, we define an involution on the independent sets of $G$. We call these involutions flips, and use them to define a new partial order on independent sets of $G$. Trim lattices generalize distributive lattices by removing the graded hypothesis: a graded trim lattice is a distributive lattice,
Thomas, Hugh, Williams, Nathan
openaire   +2 more sources

The diagonal p$p$‐permutation functor kRk$kR_k$

open access: yesJournal of the London Mathematical Society, Volume 112, Issue 3, September 2025.
Abstract Let k$k$ be an algebraically closed field of positive characteristic p$p$. We describe the full lattice of subfunctors of the diagonal p$p$‐permutation functor kRk$kR_k$ obtained by k$k$‐linear extension from the functor Rk$R_k$ of linear representations over k$k$. This leads to the description of the “composition factors” SP$S_P$ of kRk$kR_k$,
Serge Bouc
wiley   +1 more source

Covering posets

open access: yesDiscrete Mathematics, 1988
Let \((X,\leq)\) be an ordered set. A pair \((a,b)\) of elements of \(X\) is a covering pair if \(b\) covers \(a\). The set \(C(X)\) of all covering pairs of \(X\) can be naturally ordered by \((a,b)\leq (c,d)\) iff \((a,b)=(c,d)\) or \(b\leq c\). The poset \((C(X),\leq)\) is called the covering poset of \((X,\leq)\).
openaire   +3 more sources

G$G$‐typical Witt vectors with coefficients and the norm

open access: yesJournal of Topology, Volume 18, Issue 3, September 2025.
Abstract For a profinite group G$G$ we describe an abelian group WG(R;M)$W_G(R; M)$ of G$G$‐typical Witt vectors with coefficients in an R$R$‐module M$M$ (where R$R$ is a commutative ring). This simultaneously generalises the ring WG(R)$W_G(R)$ of Dress and Siebeneicher and the Witt vectors with coefficients W(R;M)$W(R; M)$ of Dotto, Krause, Nikolaus ...
Thomas Read
wiley   +1 more source

Home - About - Disclaimer - Privacy