Searcharxiv⌕ Search

arXiv · 0707.3373

How Much Work Does It Take To Straighten a Plane Graph Out?

Abstract

We prove that if one wants to make a plane graph drawing straight-line then in the worst case one has to move almost all vertices.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mihyun Kang, Mathias Schacht, Oleg Verbitsky. 2009-06-07. How Much Work Does It Take To Straighten a Plane Graph Out?. https://arxiv.org/abs/0707.3373

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

KEEP EXPLORING

Related papers

Trees with Prescribed Maximum Degree and Spectral Radius

It is well known that the spectral radius $ρ(T)$ of a tree $T$ with at least $3$ vertices satisfies $\frac 14ρ(T)^2+1<Δ(T)\le ρ(T)^2$, where $Δ(T)$ is the maximum degree of $T$. Let $\mathbb{P}$ denote the set of spectral radii of all non-trivial trees. We ask whether, for every $α\in \mathbb{P}\setminus \{1\}$ and every integer $r$ satisfying $\frac 14α^2+1<r\le α^2$, there exists a tree $T$ such that $Δ(T)=r$ and $ρ(T)=α$. For a positive integer $r$ and a positive real number $α$, let ${\mathscr W}_r(α)$ be the smallest subset of $[0,\infty)$ containing $α$ and closed under the following operation: if $q_1,\ldots,q_s$ are positive elements of ${\mathscr W}_r(α)$, not necessarily distinct, and $q=α-\sum_{i=1}^{s}q_i^{-1}$, then $q\in{\mathscr W}_r(α)$ whenever either $1\le s<r$ and $q\ge0$, or $s=r$ and $q=0$. We prove that $0\in {\mathscr W}_r(α)$ if and only if there exists a tree $T$ with $Δ(T)\le r$ and $ρ(T)=α$. Moreover, there exists a tree $T$ with $Δ(T)=r$ and $ρ(T)=α$ if and only if there are positive elements $q_1,\ldots,q_r\in\mathscr W_r(α)$, not necessarily distinct, satisfying $\sum_{i=1}^{r}q_i^{-1}=α$. Consequently, $\mathbb{P}=\{α\geq1:0\in {\mathscr W}_{\lfloorα^2\rfloor}(α)\}.$ As an application, we show that for integers $k,r\ge 2$, there exists a tree $T$ with $Δ(T)=r$ and $ρ(T)=\sqrt k$ if and only if $\frac 14 k+1<r\le k$.

math.CO↗

Monomial expansions of modified Macdonald polynomials

We discover a family $A$ of statistics on fillings of any given Young diagram and prove new combinatorial formulas for modified Macdonald polynomials, that is, $$\widetilde{H}_λ(X;q,t)=\sum_{σ\in T(λ)}x^σt^{maj(σ)}q^{η(σ)}$$ for each statistic $η\in A$. Building upon this new formula, we establish four compact formulas for the modified Macdonald polynomials, namely, $$\widetilde{H}_λ(X;q,t)=\sum_σd_{\varepsilon}(σ)x^σt^{maj(σ)}q^{η(σ)},$$ which are summed over all canonical or dual canonical fillings of a Young diagram, where $d_{\varepsilon}(σ)$ is a product of $q$-multinomials. Finally, the compact formulas enable us to derive four explicit expressions for the monomial expansion of modified Macdonald polynomials, one of which coincides with the formula due to Garbali and Wheeler (2020), obtained by making extensive use of the Yang-Baxter integrability approach.

math.CO↗

Freeness of Arrangements with Regular Underlying Matroids

We classify freeness for finite central arrangements whose underlying matroids are regular. Let $\mathcal A$ be such an arrangement over an arbitrary field, and put $M=M(\mathcal A)$. Then $\mathcal A$ is free if and only if $M$ is supersolvable; equivalently, $M$ admits a nice partition; equivalently, $M$ is the cycle matroid of a chordal simple graph. Thus, for arrangements with regular underlying matroids, freeness has a complete combinatorial classification independent of the base field. We use Seymour's decomposition theorem for regular matroids to prove that freeness forces supersolvability. We also characterize nice partitions of finite simple binary matroids: a partition is nice if and only if it is independent and no line is contained in a single block. Consequently, a finite loopless binary matroid admits a nice partition if and only if it is simple and supersolvable.

math.CO↗