English
Related papers

Related papers: $P$-Partition Generating Function Equivalence of N…

200 papers

This paper introduces two matrix analogues for set partitions. A composition matrix on a finite set X is an upper triangular matrix whose entries partition X, and for which there are no rows or columns containing only empty sets. A…

Combinatorics · Mathematics 2011-02-16 Anders Claesson , Mark Dukes , Martina Kubitzke

We focus on writing closed forms of generating functions for the number of partitions with gap conditions as double sums starting from a combinatorial construction. Some examples of the sets of partitions with gap conditions to be discussed…

Combinatorics · Mathematics 2021-07-28 Ali K. Uncu

We study the combinatorial equivalence of separable elements in types $A$ and $B$. A bijection is constructed from the set of separable permutations in the symmetric group $S_{n+1}$ to the set of separable signed permutations in the…

Combinatorics · Mathematics 2025-10-15 Yong Liao , Yuping Yang , Houyi Yu

In this paper we consider the rank generating function of a separable permutation $\pi$ in the weak Bruhat order on the two intervals $[\text{id}, \pi]$ and $[\pi, w_0]$, where $w_0 = n,(n-1),..., 1$. We show a surprising result that the…

Combinatorics · Mathematics 2010-09-30 Fan Wei

We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…

Algebraic Geometry · Mathematics 2020-11-04 Ben Davison , Jared Ongaro , Balazs Szendroi

The notion of generating functions of Poisson structures was first studied in math.SG/0312380.They are special functions which induce, on open subsets of $\R^d$, a Poisson structure together with the local symplectic groupoid integrating…

Symplectic Geometry · Mathematics 2009-11-11 Benoit Dherin

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Combinatorics · Mathematics 2015-08-04 Alexander Barvinok , Pablo Soberón

We consider the tiling generating functions of semi-hexagons and quartered hexagons with dents on their sides. In general, there are no simple product formulas for these generating functions. However, we show that the modification in the…

Combinatorics · Mathematics 2022-05-17 Tri Lai

In this paper we use the technique of Hopf algebras and quasi-symmetric functions to study the combinatorial polytopes. Consider the free abelian group $\mathcal{P}$ generated by all combinatorial polytopes. There are two natural bilinear…

Combinatorics · Mathematics 2015-05-20 Victor M. Buchstaber , Nickolai Erokhovets

The main aim of this paper is twofold: (1) Suggesting a statistical mechanical approach to the calculation of the generating function of restricted integer partition functions which count the number of partitions --- a way of writing an…

Statistical Mechanics · Physics 2018-08-10 Chi-Chun Zhou , Wu-Sheng Dai

It is known that partial spreads is a class of bent partitions. In \cite{AM2022Be,MP2021Be}, two classes of bent partitions whose forms are similar to partial spreads were presented. In \cite{AKM2022Ge}, more bent partitions $\Gamma_{1},…

Information Theory · Computer Science 2023-01-03 Jiaxin Wang , Fang-Wei Fu , Yadi Wei

A noncommutative and noncocommutative Hopf algebra on finite topologies H_T is introduced and studied (freeness, cofreeness, self-duality...). Generalizing Stanley's definition of P-partitions associated to a special poset, we define the…

Rings and Algebras · Mathematics 2014-10-07 Loïc Foissy , Claudia Malvenuto

We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…

Representation Theory · Mathematics 2015-01-14 Raymundo Bautista , Ivon Dorado

We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection between partial matchings avoiding three…

Combinatorics · Mathematics 2010-09-24 William Y. C. Chen , Neil J. Y. Fan , Alina F. Y. Zhao

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

Let P be a poset and let P* be the set of all finite length words over P. Generalized subword order is the partial order on P* obtained by letting u \leq w if and only if there is a subword u' of w having the same length as u such that each…

Combinatorics · Mathematics 2012-02-14 Peter R. W. McNamara , Bruce E. Sagan

We define several sorts of mappings on a poset like monotone, strictly monotone, upper cone preserving and variants of these. Our aim is to characterize posets in which some of these mappings coincide. We define special mappings determined…

Combinatorics · Mathematics 2021-03-01 Ivan Chajda , Helmut Länger

We consider a group $GL(\infty)$ and its parabolic subgroup $B$ corresponding to partition $\infty=\infty+m+\infty$. Denote by $P$ the kernel of the natural homomorphism $B\to GL(m)$. We show that the space of double cosets of $GL(\infty)$…

Representation Theory · Mathematics 2013-10-08 Yury A. Neretin

A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…

Combinatorics · Mathematics 2015-12-31 Mathieu Guay-Paquet , Alejandro H. Morales , Eric Rowland

For a prime $p$ and nonnegative integers $j$ and $n$ let $\vartheta_p(j,n)$ be the number of entries in the $n$-th row of Pascal's triangle that are exactly divisible by $p^j$. Moreover, for a finite sequence $w=(w_{r-1}\cdots w_0)\neq…

Number Theory · Mathematics 2017-11-09 Lukas Spiegelhofer , Michael Wallner