SearcharxivSearch

arXiv subjects

Adrian Pastine

Publications and source records attributed to Adrian Pastine.

2 recordsLinked to original sources

Simple factor graphs associated with split graphs

We introduce and study a loopless multigraph associated with a split graph $(S,K,I)$: its factor graph $\Phi(S,K,I)$, whose vertex set is $I$ and whose edges, counted with multiplicity, record the 2-switches acting on $S$. In contrast with the $A_4$-structure $\mathcal{A}_4(S)$ introduced by Barrus and West, the factor graph is supported on the independent set alone; it is therefore more compact and, although it retains less information, it still determines the 2-switch-degree of $S$. We show that an active split graph is indecomposable if and only if its factor graph is connected, an analogue for split graphs of the Barrus--West characterization of indecomposable graphs. Finally, we describe completely the active split graphs whose factor graph is simple and connected.

math.CO

Two unfortunate properties of pure f-vectors

The set of f-vectors of pure simplicial complexes is an important but little understood object in combinatorics and combinatorial commutative algebra. Unfortunately, its explicit characterization appears to be a virtually intractable problem, and its structure very irregular and complicated. The purpose of this note, where we combine a few different algebraic and combinatorial techniques, is to lend some further evidence to this fact. We first show that pure (in fact, Cohen-Macaulay) f-vectors can be nonunimodal with arbitrarily many peaks, thus improving the corresponding results known for level Hilbert functions and pure O-sequences. We provide both an algebraic and a combinatorial argument for this result. Then, answering negatively a question of the second author and collaborators posed in the recent AMS Memoir on pure O-sequences, we show that the Interval Property fails for the set of pure f-vectors, even in dimension 2.

math.CO