Improved Compact Visibility Representation of Planar Graph via Schnyder's Realizer

Let $G$ be an $n$-node planar graph. In a visibility representation of $G$, each node of $G$ is represented by a horizontal line segment such that the line segments representing any two adjacent nodes of $G$ are vertically visible to each other. In the present paper we give the best known compact visibility representation of $G$. Given a canonical ordering of the triangulated $G$, our algorithm draws the graph incrementally in a greedy manner. We show that one of three canonical orderings obtained from Schnyder's realizer for the triangulated $G$ yields a visibility representation of $G$ no wider than $\frac{22n-40}{15}$. Our easy-to-implement O(n)-time algorithm bypasses the complicated subroutines for four-connected components and four-block trees required by the best previously known algorithm of Kant. Our result provides a negative answer to Kant's open question about whether $\frac{3n-6}{2}$ is a worst-case lower bound on the required width. Also, if $G$ has no degree-three (respectively, degree-five) internal node, then our visibility representation for $G$ is no wider than $\frac{4n-9}{3}$ (respectively, $\frac{4n-7}{3}$). Moreover, if $G$ is four-connected, then our visibility representation for $G$ is no wider than $n-1$, matching the best known result of Kant and He. As a by-product, we obtain a much simpler proof for a corollary of Wagner's Theorem on realizers, due to Bonichon, Sa\"{e}c, and Mosbah.Comment: 11 pages, 6 figures, the preliminary version of this paper is to appear in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS), Berlin, Germany, 200

Teaching linguistics gotta catch ’em all: Skills grading in undergraduate linguistics

Dissatisfied with traditional grading, we developed a grading system to directly assess whether students have mastered course material. We identified the set of skills students need to master in a course and provided multiple opportunities for students to demonstrate mastery of each skill. We describe in detail how we implemented the system for two undergraduate courses, Introductory Phonetics and Phonology I. Our goals were to decrease student stress, increase student learning and make students’ study efforts more effective, increase students’ metacognitive awareness, promote a growth mindset, encourage students to aim for mastery rather than partial credit, be fairer to students facing structural and institutional disadvantages, reduce our time spent on grading, and facilitate complying with new accreditation requirements. Our own reflections and student feedback indicate that many of these goals were met

Unified structure for exact towers of scar states in the AKLT and other models

Quantum many-body scar states are many-body states with finite energy density in non-integrable models that do not obey the eigenstate thermalization hypothesis. Recent works have revealed "towers" of scar states that are exactly known and are equally spaced in energy, specifically in the AKLT model, the spin-1 XY model, and a spin-1/2 model that conserves number of domain walls. We provide a common framework to understand and prove known exact towers of scars in these systems, by evaluating the commutator of the Hamiltonian and a ladder operator. In particular we provide a simple proof of the scar towers in the integer-spin 1d AKLT models by studying two-site spin projectors. Through this picture we deduce a family of Hamiltonians that share the scar tower with the AKLT model, and also find common parent Hamiltonians for the AKLT and XY model scars. We also introduce new towers of exact states, organized in a "pyramid" structure, in the spin-1/2 model through successive application of a non-local ladder operator

Osculating and neighbour-avoiding polygons on the square lattice

We study two simple modifications of self-avoiding polygons. Osculating polygons are a super-set in which we allow the perimeter of the polygon to touch at a vertex. Neighbour-avoiding polygons are only allowed to have nearest neighbour vertices provided these are joined by the associated edge and thus form a sub-set of self-avoiding polygons. We use the finite lattice method to count the number of osculating polygons and neighbour-avoiding polygons on the square lattice. We also calculate their radius of gyration and the first area-weighted moment. Analysis of the series confirms exact predictions for the critical exponents and the universality of various amplitude combinations. For both cases we have found exact solutions for the number of convex and almost-convex polygons.Comment: 14 pages, 5 figure

Exact Scaling Functions for Self-Avoiding Loops and Branched Polymers

It is shown that a recently conjectured form for the critical scaling function for planar self-avoiding polygons weighted by their perimeter and area also follows from an exact renormalization group flow into the branched polymer problem, combined with the dimensional reduction arguments of Parisi and Sourlas. The result is generalized to higher-order multicritical points, yielding exact values for all their critical exponents and exact forms for the associated scaling functions.Comment: 5 pages; v2: factors of 2 corrected; v.3: relation with existing theta-point results clarified, some references added/update

Stereospecific synthesis of the aglycone of pseudopterosin E

No description supplie

α\alpha-Particle Spectrum in the Reaction p+11^{11}B→α+8Be∗→3α\to \alpha + ^8Be^*\to 3\alpha

Using a simple phenomenological parametrization of the reaction amplitude we calculated $\alpha$-particle spectrum in the reaction p+$^{11}$B$\to \alpha + ^8Be^*\to 3\alpha$ at the resonance proton energy 675 KeV. The parametrization includes Breit-Wigner factor with an energy dependent width for intermediate $^8Be^*$ state and the Coulomb and the centrifugal factors in $\alpha$-particle emission vertexes. The shape of the spectrum consists of a well defined peak corresponding to emission of the primary $\alpha$ and a flat shoulder going down to very low energy. We found that below 1.5 MeV there are 17.5% of $\alpha$'s and below 1 MeV there are 11% of them.Comment: 6 pages, 3 figure