Results 31 to 40 of about 26,296,882 (186)

Homomesy in products of two chains [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
Many cyclic actions $τ$ on a finite set $\mathcal{S}$ ; of combinatorial objects, along with a natural statistic $f$ on $\mathcal{S}$, exhibit ``homomesy'': the average of $f$ over each $τ$-orbit in $\mathcal{S} $ is the same as the average of $f$ over ...
James Propp, Tom Roby
doaj   +1 more source

Maximal 0-1-fillings of moon polyominoes with restricted chain lengths and rc-graphs [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We show that maximal 0-1-fillings of moon polynomials, with restricted chain lengths, can be identified with certain rc-graphs, also known as pipe dreams.
Martin Rubey
doaj   +1 more source

The topology of restricted partition posets [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $Π ^• _{\vec{c}}$ is a wedge of $β\vec{c}$ spheres of the same dimensions, where $β\vec{c}$ is the number of permutations with descent composition ^$\vec{
Richard Ehrenborg, JiYoon Jung
doaj   +1 more source

Open Set Lattices of Subspaces of Spectrum Spaces

open access: yesDemonstratio Mathematica, 2015
We take a unified approach to study the open set lattices of various subspaces of the spectrum of a multiplicative lattice L. The main aim is to establish the order isomorphism between the open set lattice of the respective subspace and a sub-poset of L.
Nai Y.T., Zhao D.
doaj   +1 more source

On the additive image of zeroth persistent homology

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract For a category X$X$ and a finite field F$F$, we study the additive image of the functor H0(−;F)∗:rep(X,Top)→rep(X,VectF)$\operatorname{H}_0(-;F)_* \colon \operatorname{rep}(X, \mathbf {Top}) \rightarrow \operatorname{rep}(X, \mathbf {Vect}_F)$, or equivalently, of the free functor rep(X,Set)→rep(X,VectF)$\operatorname{rep}(X, \mathbf {Set ...
Ulrich Bauer   +3 more
wiley   +1 more source

How to get the weak order out of a digraph ? [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$$n-1$, $B$$n$, $Ã$$n$, and the flag weak order on the wreath ...
Francois Viard
doaj   +1 more source

Context‐free graphs and their transition groups

open access: yesTransactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.
Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli   +3 more
wiley   +1 more source

A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

open access: yesJournal of Graph Theory, Volume 113, Issue 3, Page 462-469, November 2026.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source

Germs in a poset

open access: yes, 2020
Motivated by the theory of correspondence functors, we introduce the notion of germ in a finite poset, and the notion of germ extension of a poset. We show that any finite poset admits a largest germ extension called its germ closure.
Bouc, Serge
core   +1 more source

SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES

open access: yesUral Mathematical Journal
For a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of  \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj   +1 more source

Home - About - Disclaimer - Privacy