Related papers: Counting linear extensions of restricted posets
In this paper we study the $L^p-L^r$ boundedness of the extension operators associated with paraboloids in vector spaces over finite fields.In higher even dimensions, we estimate the number of additive quadruples in the subset $E$ of the…
This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several…
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…
The main purpose of the present paper is to study the numerical properties of supersolvable resolutions of line arrangements. We provide upper-bounds on the so-called extension to supersolvability numbers for certain extreme line…
For a given finite poset $P$, $La(n,P)$ denotes the largest size of a family $\mathcal{F}$ of subsets of $[n]$ not containing $P$ as a weak subposet. We exactly determine $La(n,P)$ for infinitely many $P$ posets. These posets are built from…
This paper explores the cohomology of linear cycle sets, focusing on extensions of a specific linear cycle set H by an abelian group I. We derive explicit formulas for the second cohomology group, which classifies these extensions, and…
For a certain class of finite posets, we prove that all their irreducible orthoscalar representations are finite-dimensional and describe those, for which there exist essential (non-degenerate) irreducible orthoscalar representations.
A binary poset code of codimension M (of cardinality 2^{N-M}, where N is the code length) can correct maximum M errors. All possible poset metrics that allow codes of codimension M to be M-, (M-1)- or (M-2)-perfect are described. Some…
In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…
We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P $\neq$ NP then this disproves a conjecture of Recski.
We show that posets of bounded height whose cover graphs exclude a fixed graph as a topological minor have bounded dimension. This result was already proven by Walczak. However, our argument is entirely combinatorial and does not rely on…
We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.
We prove that the problem of counting the number of colourings of the vertices of a graph with at most two colours, such that the colour classes induce connected subgraphs is #P-complete. We also show that the closely related problem of…
Motivated by quite recent research involving the relationship between the dimension of a poset and graph-theoretic properties of its cover graph, we show that for every $d\geq 1$, if $P$ is a poset and the dimension of a subposet $B$ of $P$…
We prove existence of extension dimension for paracompact spaces. Here is the main result of the paper: \proclaim{Theorem} Suppose X is a paracompact space. There is a CW complex K such that {a.} K is an absolute extensor of X up to…
Layered pathwidth is a new graph parameter studied by Bannister et al (2015). In this paper we present two new results relating layered pathwidth to two types of linear layouts. Our first result shows that, for any graph $G$, the stack…
We present effective upper bounds on the symmetric bilinear complexity of multiplication in extensions of a base finite field Fp2 of prime square order, obtained by combining estimates on gaps between prime numbers together with an optimal…
The dimension of a partially-ordered set (poset), introduced by Dushnik and Miller (1941), has been studied extensively in the literature. Recently, Ueckerdt (2016) proposed a variation called local dimension which makes use of partial…
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 introduce and study additive posets. We show that the top homology group (with coefficients in Z/2Z) of a finite dimensional CW-complex carries a structure of an additive poset invariant under subdivisions. Applications to CW-complexes…