Related papers: Stable representations of posets

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…

We consider probability distributions with constant rate on partially ordered sets, generalizing distributions in the usual reliability setting that have constant failure rate. In spite of the minimal algebraic structure, there is a…

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

Let M be a hyperbolizable, nontrivial compression body without toroidal boundary components. In this paper, we characterize which discrete and faithful representations of the fundamental group of M into PSL(2,C) are separable-stable. The…

We introduce stable reflection length in Coxeter groups, as a way to study the asymptotic behaviour of reflection length. This creates connections to other well-studied stable length functions in groups, namely stable commutator length and…

We prove the stability in weighted $W^{1,1}$ spaces for standard finite element approximations of the Poisson equation in convex polygonal or polyhedral domains, when the weight belongs to Muckenhoupt's class $A_1$ and the family of meshes…

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…

It is known that nontrivial ultraproducts of complete partially ordered sets (posets) are almost never complete. We show that complete additivity of functions is preserved in ultraproducts of posets. Since failure of this property is…

Motivated by the study of the recurrent orbits in a Morse set of a Morse decomposition, we introduce the concept of Morse predecomposition of an isolated invariant set in the setting of combinatorial and classical dynamical systems. We…

Let $\mathfrak{P}_r$ be a representation system of the non-isomorphic finite posets, and let ${\cal H}(P,Q)$ be the set of order homomorphisms from $P$ to $Q$. For finite posets $R$ and $S$, we write $R \sqsubseteq_G S$ iff, for every $P…

The $1/3$-$2/3$ Conjecture, originally formulated in 1968, is one of the best-known open problems in the theory of posets, stating that the balance constant (a quantity determined by the linear extensions) of any non-total order is at least…

We construct the moduli space of finite dimensional representations of generalized quivers for arbitrary connected complex reductive groups using Geometric Invariant Theory as well as Symplectic reduction methods. We explicit characterize…

Fix K a p-adic field and denote by G_K its absolute Galois group. Let K_infty be the extension of K obtained by adding (p^n)-th roots of a fixed uniformizer, and G_\infty its absolute Galois group. In this article, we define a class of…

We introduce a notion of representation for a class of generalised quivers known as Coxeter quivers. These representations are built using fusion categories associated to $U_q(\mathfrak{s}\mathfrak{l}_2)$ at roots of unity and we show that…

This paper continues the study of the poset of eigenspaces of elements of a unitary reflection group (for a fixed eigenvalue), which was commenced in [6] and [5]. The emphasis in this paper is on the representation theory of unitary…

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 prove that the irreducible decomposition of the permutation representation of GL(n,q) on GL(n,q)/GL(n-m,q) stabilizes for large n. We deduce, as a consequence, a representation stability theorem for finitely generated VIC-modules.

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…

Sets of desirable gambles constitute a quite general type of uncertainty model with an interesting geometrical interpretation. We give a general discussion of such models and their rationality criteria. We study exchangeability assessments…