相关论文: On rank functions for heaps

In this paper, we have considered the dense rank for assigning positions to alternatives in weak orders. If we arrange the alternatives in tiers (i.e., indifference classes), the dense rank assigns position 1 to all the alternatives in the…

Some zeta functions which are naturally attached to the locally homogeneous vector bundles over compact locally symmetric spaces of rank one are investigated. We prove that such functions can be expressed in terms of entire functions whose…

In this paper, we study the posets of classes of subgroups of finite group having same set of orders of elements. We show that this poset is a chain only in the case of p-groups and moreover, we characterize all finite groups for which this…

This paper presents a simple extension of the binary heap, the List Heap. We use List Heaps to demonstrate the idea of adaptive heaps: heaps whose performance is a function of both the size of the problem instance and the disorder of the…

We study two possible tropical analogues of Weierstrass semigroups on graphs, called rank and functional Weierstrass sets. We prove that on simple graphs, the first is contained in the second. We completely characterize the subsets of N…

Vector addition systems are an important model in theoretical computer science and have been used for the analysis of systems in a variety of areas. Termination is a crucial property of vector addition systems and has received considerable…

We introduce matching functions as a means of summing heavy-quark logarithms to any order. Our analysis is based on Witten's approach, where heavy quarks are decoupled one at a time in a mass-independent renormalization scheme. The outcome…

In this paper, we find weight decomposition and rank of a weight in the integral (co)homology of the positive system of a semi-simple Lie algebra over $\Bbb C$ and prove that the (co)homology of the weight subcomplex over a field of…

To an extended permutohedron we associate the weighted integer points enumerator, whose principal specialization is the $f$-polynomial. In the case of poset cones it refines Gessel's $\mathsf{P}$-partitions enumerator. We show that this…

In this paper, we apply stack theoretic ideas to the classification problem in Dieudonn\'e theory. First, we use crystalline cohomology of classifying stacks to directly reconstruct the classical Dieudonn\'e module of a finite, $p$-power…

We use the properties of Hermite and Kamp\'e de F\'eriet polynomials to get closed forms for the repeated derivatives of functions whose argument is a quadratic or higher-order polynomial. The results we obtain are extended to product of…

We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…

We give formulas for the second and third integral homology of an arbitrary finitely generated Coxeter group, solely in terms of the corresponding Coxeter diagram. The first of these calculations refines a theorem of Howlett, while the…

A fundamental step in the classification of finite-dimensional complex pointed Hopf algebras is the determination of all finite-dimensional Nichols algebras of braided vector spaces arising from groups. The most important class of braided…

An autoregressive-moving average model in which all roots of the autoregressive polynomial are reciprocals of roots of the moving average polynomial and vice versa is called an all-pass time series model. All-pass models are useful for…

We introduce the concept of hyperreflection groups, which are a generalization of Coxeter groups. We prove the Deletion and Exchange Conditions for hyperreflection groups, and we discuss special subgroups and fundamental sectors of…

In 1980, Edelman defined a poset on objects called the noncrossing 2-partitions. They are closely related with noncrossing partitions and parking functions. To some extent, his definition is a precursor of the parking space theory, in the…

Starting from the data of an arbor, which is a rooted tree with vertices decorated by disjoint sets, we introduce a lattice polytope and a partial order on its lattice points. We give recursive algorithms for various classical invariants of…

We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.

We define the rank of elements of general unital rings, discuss its properties and give several examples to support the definition. In semiprime rings we give a characterization of rank in terms of invertible elements. As an application we…