Related papers: Graded posets zeta matrix formula

Three-graded root systems can be arranged into nested sequences. One exceptional sequence provides a natural means to recover some structures and symmetries familiar in the context of particle physics.

We study the poset of Borel congruence classes of symmetric matrices ordered by containment of closures. We give a combinatorial description of this poset and calculate its rank function. We discuss the relation between this poset and the…

We introduce Reeb complexes in order to capture how generators of homology flow along sections of a real valued continuous function. This intuition suggests a close relation of Reeb complexes to established methods in topological data…

The enumeration of points on (or off) the union of some linear or affine subspaces over a finite field is dealt with in combinatorics via the characteristic polynomial and in algebraic geometry via the zeta function. We discuss the basic…

This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…

We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…

Let $G$ be a bipartite graph and its adjacency matrix $\mathbb A$. If $G$ has a unique perfect matching, then $\mathbb A$ has an inverse $\mathbb A^{-1}$ which is a symmetric integral matrix, and hence the adjacency matrix of a multigraph.…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

Garland introduced a vanishing criterion for a characteristic zero cohomology group of a locally finite and locally connected simplicial complex. The criterion is based on the spectral gaps of the graph Laplacians of the links of faces and…

We classify a class of complex representations of an arbitrary Coxeter group via characters of the integral homology of certain graphs. Such representations can be viewed as a generalization of the geometric representation and correspond to…

We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…

We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…

For an infinite chain bicomplex we show that the orthogonality and grading conditions provide it with the structure of a bigraded differential algebra with respect to a natural multiplication of several elements bicomplex spaces.…

Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series $\psi(x, y, z; 1, 1+\beta)$ with an additional parameter $\beta$ that may be interpreted as a continuous deformation of the rooted…

A quotient of a poset $P$ is a partial order obtained on the equivalence classes of an equivalence relation $\theta$ on $P$; $\theta$ is then called a congruence if it satisfies certain conditions, which vary according to different…

In this paper we obtain the set of grafts from some set of 12 elementary functions on 12 critical strips. We make use this directly for grafting of elements of the corresponding set of $\zeta$-factorization formulas. This procedure gives…

We introduce a new invariant for triangulated categories: the poset of spherical subcategories ordered by inclusion. This yields several numerical invariants, like the cardinality and the height of the poset. We explicitly describe…

Motivated by the work of Panina and her coauthors on cyclopermutohedron we study a poset whose elements correspond to equivalence classes of partitions of the set $\{1,\cdots, n+1\}$ up to cyclic permutations and orientation reversion. This…

One considers here orderable acyclic digraphs named KoDAGs which represent the outmost general chains of dibicliques denoting thus the outmost general chains of binary relations. Because of this fact KoDAGs start to become an outstanding…

Recently a class of molecular graphs, called altans, became a focus of attention of several theoretical chemists and mathematicians. In this paper we study primary iterated altans and show, among other things, their connections with…