English
Related papers

Related papers: On rank functions for heaps

200 papers

Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…

Representation Theory · Mathematics 2024-12-10 Sefi Ladkani

We define the notion of connectivity set for elements of any finitely generated Coxeter group. Then we define an order related to this new statistic and show that the poset is graded and each interval is a shellable lattice. This implies…

Combinatorics · Mathematics 2010-03-31 Nantel Bergeron , Christophe Hohlweg , Mike Zabrocki

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

Logic · Mathematics 2019-02-01 Rob Egrot

For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections…

Combinatorics · Mathematics 2017-08-22 Elise delMas , Thomas Hameister , Victor Reiner

How important is the weight of a given column in determining the ranking of tuples in a table? To address such an explanation question about a ranking function, we investigate the computation of SHAP scores for column weights, adopting a…

Databases · Computer Science 2026-01-12 Christoph Standke , Nikolaos Tziavelis , Wolfgang Gatterbauer , Benny Kimelfeld

We establish strict growth for the rank function of an r-differential poset. We do so by exploiting the representation theoretic techniques developed by Reiner and the author for studying related Smith forms.

Combinatorics · Mathematics 2012-02-15 Alexander Miller

The Fibonacci polynomials $\big\{F_n(x)\big\}_{n\ge 0}$ have been studied in multiple ways. In this paper we study them by means of the theory of Heaps of Viennot. In this setting our polynomials form a basis $\big\{P_n(x)\big\}_{n\ge 0}$…

Combinatorics · Mathematics 2020-09-23 A. Garsia , G. Ganzberger

Solomon showed that the Poincar\'e polynomial of a Coxeter group $W$ satisfies a product decomposition depending on the exponents of $W$. This polynomial coincides with the rank-generating function of the poset of regions of the underlying…

Combinatorics · Mathematics 2017-06-30 Tilman Moeller , Gerhard Roehrle

For a standard graded algebra $R$, we consider embeddings of the the poset of Hilbert functions of quotients of $R$ into the poset of ideals of $R$, as a way of classification of Hilbert functions. There are examples of rings for which such…

Commutative Algebra · Mathematics 2012-08-09 Giulio Caviglia , Manoj Kummini

We present a method to compute integral cohomology of posets. This toolbox is applicable as soon as the sub-posets under each object possess certain structure. This is the case for simplicial complexes and simplex-like posets. The method is…

Algebraic Topology · Mathematics 2007-06-15 Antonio Diaz

In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.

Number Theory · Mathematics 2007-08-07 Kathrin Bringmann

Given a ring $R$, the notion of Sylvester rank function was conceived within the context of Cohn's classification theory of epic division $R$-rings. In this paper we study and describe the space of Sylvester rank functions on certain…

Rings and Algebras · Mathematics 2021-01-01 Andrei Jaikin-Zapirain , Diego López-Álvarez

We introduce the notions of boundary vertex, linear equivalence and effective boundary vertex in the context of Viennot's heaps of pieces. We prove that in the heap of a fully commutative element in a star reducible Coxeter group, every…

Combinatorics · Mathematics 2008-10-07 Brent G. Pohlmann

The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…

Combinatorics · Mathematics 2025-12-02 Christos A. Athanasiadis , Theo Douvropoulos , Katerina Kalampogia-Evangelinou

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…

Combinatorics · Mathematics 2022-06-28 Angela Carnevale , Matthew Dyer , Paolo Sentinelli

We study the general and connected stable ranks for $C^{\ast}$-algebras. We estimate these ranks for certain $C(X)$-algebras, and use that to do the same for certain group $C^{\ast}$-algebras. Furthermore, we also give estimates for the…

Operator Algebras · Mathematics 2020-11-18 Anshu Nirbhay , Prahlad Vaidyanathan

We define a functor which gives the "global rank of a quiver representation" and prove that it has nice properties which make it a generalization of the rank of a linear map. We demonstrate how to construct other "rank functors" for a…

Representation Theory · Mathematics 2009-03-10 Ryan Kinser

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

Logic in Computer Science · Computer Science 2017-12-05 Lane A. Hemaspaandra , Daniel Rubery

We establish certain topological properties of rank understood as a function on the set of invariant measures on a topological dynamical system. To be exact, we show that rank is of Young class LU (i.e., it is the limit of an increasing…

Dynamical Systems · Mathematics 2012-06-04 Tomasz Downarowicz , Yonatan Gutman , Dawid Huczek

Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…

Combinatorics · Mathematics 2025-07-02 Matthew Baker , Noah Solomon , Tianyi Zhang