相关论文: On rank functions for heaps

Let E be a modular elliptic curve defined over a rational function field k of odd characteristic. We construct a sequence of Heegner points on E, defined over a $Z_p^{\infty}$-tower of finite extensions of k, and show that these Heegner…

For each composition $\vec{c}$ we show that the order complex of the poset of pointed set partitions $\Pi^{\bullet}_{\vec{c}}$ is a wedge of spheres of the same dimension with the multiplicity given by the number of permutations with…

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

The Chen groups of a group $G$ are the lower central series quotients of the maximal metabelian quotient of $G$. Under certain conditions, we relate the ranks of the Chen groups to the first resonance variety of $G$, a jump locus for the…

We study the ranks of commutators and generalized semicommutators of Toeplitz operators with quasihomogeneous symbols on both the harmonic Bergman space and the Bergman Space. In particular, when one of quasihomogeneous symbols is the the…

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 are the subject of the (3+1)-free conjecture of Stanley and Stembridge. Recently, Lewis and Zhang have…

Persistent homology, while ostensibly measuring changes in topology, captures multiscale geometrical information. It is a natural tool for the analysis of point patterns. In this paper we explore the statistical power of the (persistent…

Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…

We give an upper bound for the cactus rank of any multi-homogeneous polynomial.

In this paper we study quotients of posets by group actions. In order to define the quotient correctly we enlarge the considered class of categories from posets to loopfree categories: categories without nontrivial automorphisms and…

We examine so-called rank function equations and their solutions consisting of non-nilpotent matrices. Secondly, we present some geometrical properties of the set of solutions to certain rank function equations in the nilpotent case.

We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the one proposed in [Ehrenfeucht et al, 2011] in that it…

Given a function defined over a parabolic subgroup of a Coxeter group, equidistributed with the length, we give a procedure to construct a function over the entire group, equidistributed with the length. Such a procedure permits to define…

We derive explicit formulae for the subalgebra zeta functions of all higher Heisenberg Lie algebras over an arbitrary compact discrete valuation ring $\mathfrak{o}$. To this end, we develop Hecke-theoretic techniques for the enumeration, by…

We continue the study on sheaves of rings on finite posets. We present examples where the ring of global sections coincide with toric faces rings, quotients of a polynomial ring by a monomial ideal and algebras with straightening laws. We…

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…

We consider the problem of statistical inference for ranking data, specifically rank aggregation, under the assumption that samples are incomplete in the sense of not comprising all choice alternatives. In contrast to most existing methods,…

$\Pi_1^1$-ranks are a natural tool for studying coanalytic sets in descriptive set theory. In the book "Classical descriptive set theory", Kechris provided a technique to build $\Pi_1^1$-ranks using derivatives. In this note we will prove a…