Related papers: On rank functions for heaps
Via duality of Hopf algebras, there is a direct association between peak quasisymmetric functions and enumeration of chains in Eulerian posets. We study this association explicitly, showing that the notion of $\cd$-index, long studied in…
We prove various estimates for the asymptotics of counting functions associated to point sets of coherent frames and Riesz sequences. The obtained results recover the necessary density conditions for coherent frames and Riesz sequences for…
Word Embeddings have recently imposed themselves as a standard for representing word meaning in NLP. Semantic similarity between word pairs has become the most common evaluation benchmark for these representations, with vector cosine being…
In this paper we study the complexity of the problems: given a loop, described by linear constraints over a finite set of variables, is there a linear or lexicographical-linear ranking function for this loop? While existence of such…
We use geometry of Davis complex of a Coxeter group to prove the following result: if G is an infinite indecomposable Coxeter group and $H\subset G$ is a finite index reflection subgroup then the rank of H is not less than the rank of G.…
The set of matrices of given positive semidefinite rank is semialgebraic. In this paper we study the geometry of this set, and in small cases we describe its boundary. For general values of positive semidefinite rank we provide a conjecture…
In this paper, we study the rank of matrices of bicomplex numbers. The relationship between rank, idempotent column rank and idempotent row rank is examined. Then, the solution of a system of equations in bicomplex space is presented using…
We establish lower bounds on the rank of matrices in which all but the diagonal entries lie in a multiplicative group of small rank. Applying these bounds we show that the distance sets of finite pointsets in $\mathbb{R}^d$ generate high…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
We introduce the notion of a bounded weight function on a language, and show that the set of bounded weight functions on a regular language is a rational polyhedral cone. We study the cell recognised by a bounded weight function (that is,…
As a generalization of the Dedekind zeta function, Weng defined the high rank zeta functions and proved that they have standard properties of zeta functions, namely, meromorphic continuation, functional equation, and having only two simple…
Heaps are para-associative ternary operations bijectively exemplified by groups via the operation $(x,y,z) \mapsto x y^{-1} z$. They are also ternary self-distributive, and have a diagrammatic interpretation in terms of framed links.…
Recent work of Qi et al. arXiv:2004.11240v7 proposes a set of axioms for tensor rank functions. The current paper presents examples showing that their axioms allow rank functions to have some undesirable properties, and a stronger set of…
We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than $c$…
To determine whether an $n\times n$-matrix has rank at most $r$ it suffices to check that the $(r+1)\times (r+1)$-minors have rank at most $r$. In other words, to describe the set of $n\times n$-matrices with the property of having rank at…
Motivated by a problem in computational complexity, we consider the behavior of rank functions for tensors and polynomial maps under random coordinate restrictions. We show that, for a broad class of rank functions called natural rank…
Given a presentation for a rack $\mathcal R$, we define a process which systematically enumerates the elements of $\mathcal R$. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalizes…
This article extends a paper of Abraham and Bonnet which generalised the famous Hausdorff characterisation of the class of scattered linear orders. Abraham and Bonnet gave a poset hierarchy that characterised the class of scattered posets…
In this paper, we introduce a new family of argument-ranking semantics which can be seen as a refinement of the classification of arguments into skeptically accepted, credulously accepted and rejected. To this end we use so-called social…
Given a graded poset $P$, consider a chain decomposition $\mathcal{C}$ of $P$. If $|C_1|\le |C_2|$ implies that the set of the ranks of elements in $C_1$ is a subset of the ranks of elements in $C_2$ for any chains $C_1,C_2\in \mathcal{C}$,…