English
Related papers

Related papers: Poset homology of Rees products, and $q$-Eulerian …

200 papers

We prove that the 18-element non-lattice orthomodular poset depicted in the paper is the smallest one and unique up to isomorphism. Since not every Boolean poset is orthomodular, we consider the class of the so-called generalized…

Quantum Algebra · Mathematics 2022-10-12 Ivan Chajda , Miroslav Kolařík , Helmut Länger

We prove that every poset with bounded cliquewidth and with sufficiently large dimension contains the standard example of dimension $k$ as a subposet. This applies in particular to posets whose cover graphs have bounded treewidth, as the…

Combinatorics · Mathematics 2025-10-21 Gwenaël Joret , Piotr Micek , Michał Pilipczuk , Bartosz Walczak

Motivated by generalizing Khovanov's categorification of the Jones polynomial, we study functors $F$ from thin posets $P$ to abelian categories $\mathcal{A}$. Such functors $F$ produce cohomology theories $H^*(P,\mathcal{A},F)$. We find…

Combinatorics · Mathematics 2019-12-09 Alex Chandler

In this note we extend the cyclic homology functor, and in particular the periodic cyclic homology, to the category of DG (= differential graded) coalgebras. We are partly motivated by the question of products and coproducts in the cyclic…

Quantum Algebra · Mathematics 2007-05-23 Masoud Khalkhali

Associated to a newform $f(z)$ is a Dirichlet series $L_f(s)$ with functional equation and Euler product. Hecke showed that if the Dirichlet series $F(s)$ has a functional equation of a particular form, then $F(s)=L_f(s)$ for some…

Number Theory · Mathematics 2007-05-23 David W. Farmer , Kevin Wilson

We study generating functions of strict and non-strict order polynomials of series-parallel posets, called order series. These order series are closely related to Ehrhart series and h*-polynomials of the associated order polytopes. We…

Combinatorics · Mathematics 2026-01-27 Jose Antonio Arciniega-Nevarez , Marko Berghoff , Eric Dolores-Cuenca

For each positive integer n, Khovanov and Rozansky constructed an invariant of links in the form of a doubly-graded cohomology theory whose Euler characteristic is the sl(n) link polynomial. We use Lagrangian Floer cohomology on some…

Symplectic Geometry · Mathematics 2007-05-23 Ciprian Manolescu

The tensor product of props was defined by Hackney and Robertson as an extension of the Boardman-Vogt product of operads to more general monoidal theories. Theories that factor as tensor products include the theory of commutative monoids…

Category Theory · Mathematics 2021-01-27 Amar Hadzihasanovic

The Lannes-Quillen theorem relates the mod-$p$ cohomology of a finite group $G$ with the mod-$p$ cohomology of centralizers of abelian elementary $p$-subgroups of $G$, for $p>0$ a prime number. This theorem was extended to profinite groups…

Group Theory · Mathematics 2026-02-02 Marco Boggi

Stanley introduced in 1986 the order polytope and the chain polytope for a given finite poset. These polytopes contain much information about the poset and have given rise to important examples in polyhedral geometry. In 1993, Reiner…

Combinatorics · Mathematics 2023-11-09 Matthias Beck , Max Hlavacek

The Stern poset $\mathcal{S}$ is a graded infinite poset naturally associated to Stern's triangle, which was defined by Stanley analogously to Pascal's triangle. Let $P_n$ denote the interval of $\mathcal{S}$ from the unique element of row…

Combinatorics · Mathematics 2020-06-02 Arthur L. B. Yang

In a recent paper, Regev and Roichman introduced the <_L order and the L-descent number statistic, des_L, on the group of colored permutations, C_a \wr S_n. Here we define the L-reverse major index statistic, rmaj_L, on the same group and…

Combinatorics · Mathematics 2007-05-23 Dan Bernstein

The $Q$-polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit the $Q$-polynomial property. Only recently the $Q$-polynomial…

Combinatorics · Mathematics 2024-04-22 Blas Fernández , Roghayeh Maleki , Štefko Miklavič , Giusy Monzillo

In this manuscript we develop the theory of poset pinball, a combinatorial game recently introduced by Harada and Tymoczko for the study of the equivariant cohomology rings of GKM-compatible subspaces of GKM spaces. Harada and Tymoczko also…

Algebraic Geometry · Mathematics 2010-12-30 Darius Bayegan , Megumi Harada

The aim of this short note is to develop a (co)homology theory for topological spaces together with the specialisation preorder. A known way to construct such a (co)homology is to define a partial order on the topological space starting…

Algebraic Topology · Mathematics 2020-04-23 Manuel Norman

We generalize chain enumeration in graded partially ordered sets by relaxing the graded, poset and Eulerian requirements. The resulting balanced digraphs, which include the classical Eulerian posets having an $R$-labeling, imply the…

Combinatorics · Mathematics 2019-09-25 Richard Ehrenborg , Margaret Readdy

We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…

Logic · Mathematics 2020-06-30 Ivan Chajda , Helmut Länger

Binomial Eulerian polynomials first appeared in work of Postnikov, Reiner and Williams on the face enumeration of generalized permutohedra. They are $\gamma$-positive (in particular, palindromic and unimodal) polynomials which can be…

Combinatorics · Mathematics 2020-01-24 Christos A. Athanasiadis

We investigate the homology representation of the symmetric group on rank-selected subposets of subword order. We show that the homology module for words of bounded length, over an alphabet of size $n,$ decomposes into a sum of tensor…

Representation Theory · Mathematics 2025-09-09 Sheila Sundaram

It is proved an amplification of Cusick-Cheon's conjecture on balanced Boolean functions in the cosets of the binary Reed-Muller code RM(k,m) of order k and length 2^m, in the cases where k = 1 or k >= (m-1)/2.

Information Theory · Computer Science 2008-04-14 Yuri L. Borissov