Search arXivSearch

arXiv · 2401.14958

Unrestricted Red Size and Sign-Coherence

Abstract

The unrestricted red size of a quiver is the maximal number of red vertices in its framed quiver after any given mutation sequence. In a 2023 paper by E. Bucher and J. Machacek, it was shown that connected, mutation-finite quivers either have an unrestricted red size of $n-1$ or $n$, where $n$ is the number of vertices in the quiver. We prove here that the same holds for the connected, mutation-infinite case using forks. As such, the unrestricted red size for any quiver equals $n-c$, where $c$ is the number of connected components of the quiver that do not admit a reddening sequence. Additionally, we prove a result on the $c$-vectors of forks that allows us to show that the $c$-vectors of both abundant acyclic quivers on any number of vertices and mutation-cyclic quivers on three vertices are sign-coherent with only elementary methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tucker J. Ervin. 2024-08-15. Unrestricted Red Size and Sign-Coherence. https://arxiv.org/abs/2401.14958

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO