Related papers: Order polynomial product formulas and poset dynami…
Let g be a complex finite-dimensional simple Lie algebra. Given a positive integer k and a dominant weight \lambda, we define a preorder on the set $P(\lambda, k)$ of k-tuples of dominant weights which add up to \lambda. Let $P(\lambda,…
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…
We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…
We introduce Lipschitz functions on a finite partially ordered set $P$ and study the associated Lipschitz polytope $L(P)$. The geometry of $L(P)$ can be described in terms of descent-compatible permutations and permutation statistics that…
We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…
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…
For a general one-sided nonautonomous dynamics defined by a sequence of linear operators, we consider the notion of a polynomial dichotomy with respect to a sequence of norms and we characterize it completely in terms of the admissibility…
We prove that every finite poset has a directed cut with at least one half of the poset's pairwise order relations. The bound is tight. Also, the largest directed cut in a poset can be found in linear time.
We show that every complemented modular lattice can be converted into a left residuated lattice where the binary operations of multiplication and residuum are term operations. The concept of an operator left residuated poset was introduced…
Proportional ranking rules aggregate approval-style preferences of agents into a collective ranking such that groups of agents with similar preferences are adequately represented. Motivated by the application of live Q&A platforms, where…
We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…
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 consider random walk polynomial sequences $(P_n(x))_{n\in\mathbb{N}_0}\subseteq\mathbb{R}[x]$ given by recurrence relations of the form $P_0(x)=1$, $P_1(x)=x$ and $x P_n(x)=a_n P_{n+1}(x)+c_n P_{n-1}(x)\;(n\in\mathbb{N})$, where $a_n$…
We derive an integration by parts formula for functionals of determinantal processes on compact sets, completing the arguments of [4]. This is used to show the existence of a configuration-valued diffusion process which is non-colliding and…
In this paper we investigate a dynamic pricing model for constant demand elasticity where customers have a probability distribution on the number of items they order. This is a generalization from standard models which restrict customers to…
Motivated by constructions from applied topology, there has been recent interest in the homological algebra of linear representations of posets, particularly in the context of homological algebra relative to non-standard exact structures. A…
The derivatives with respect to order {\nu} for the Bessel functions of argument x (real or complex) are studied. Representations are derived in terms of integrals that involve the products pairs of Bessel functions, and in turn series…
The partition problem is a well-known basic NP-complete problem. We mainly consider the optimization version of it in this paper. The problem has been investigated from various perspectives for a long time and can be solved efficiently in…
We provide a multidimensional extension of previous results on the existence of polynomial progressions in dense subsets of the primes. Let $A$ be a subset of the prime lattice - the d-fold direct product of the primes - of positive…
Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…