4,443 research outputs found
Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs
A graph is {\em matching-decyclable} if it has a matching such that
is acyclic. Deciding whether is matching-decyclable is an NP-complete
problem even if is 2-connected, planar, and subcubic. In this work we
present results on matching-decyclability in the following classes: Hamiltonian
subcubic graphs, chordal graphs, and distance-hereditary graphs. In Hamiltonian
subcubic graphs we show that deciding matching-decyclability is NP-complete
even if there are exactly two vertices of degree two. For chordal and
distance-hereditary graphs, we present characterizations of
matching-decyclability that lead to -time recognition algorithms
Balancedness of subclasses of circular-arc graphs
A graph is balanced if its clique-vertex incidence matrix contains no square submatrix of odd order with exactly two ones per row and per column. There is a characterization of balanced graphs by forbidden induced subgraphs, but no characterization by mininal forbidden induced subgraphs is known, not even for the case of circular-arc graphs. A circular-arc graph is the intersection graph of a family of arcs on a circle. In this work, we characterize when a given graph G is balanced in terms of minimal forbidden induced subgraphs, by restricting the analysis to the case where G belongs to certain classes of circular-arc graphs, including Helly circular-arc graphs, claw-free circular-arc graphs, and gem-free circular-arc graphs. In the case of gem-free circular-arc graphs, analogous characterizations are derived for two superclasses of balanced graphs: clique-perfect graphs and coordinated graphs.Fil: Bonomo, Flavia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones CientÃficas y Técnicas; ArgentinaFil: Duran, Guillermo Alfredo. Consejo Nacional de Investigaciones CientÃficas y Técnicas; Argentina. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Universidad de Chile; ChileFil: Safe, Martin Dario. Consejo Nacional de Investigaciones CientÃficas y Técnicas; Argentina. Universidad Nacional de General Sarmiento. Instituto de Ciencias; ArgentinaFil: Wagler, Annegret Katrin. Centre National de la Recherche Scientifique; Franci
Tonal prisms: iterated quantization in chromatic tonality and Ravel's 'Ondine'
The mathematics of second-order maximal evenness has far-reaching potential for application in music analysis. One of its assets is its foundation in an inherently continuous conception of pitch, a feature it shares with voice-leading geometries. This paper reformulates second-order maximal evenness as iterated quantization in voice-leading spaces, discusses the implications of viewing diatonic triads as second-order maximally even sets for the understanding of nineteenth-century modulatory schemes, and applies a second-order maximally even derivation of acoustic collections in an in-depth analysis of Ravel's ‘Ondine’. In the interaction between these two very different applications, the paper generalizes the concepts and analytical methods associated with iterated quantization and also pursues a broader argument about the mutual dependence of mathematical music theory and music analysis.Accepted manuscrip
TDMA is Optimal for All-unicast DoF Region of TIM if and only if Topology is Chordal Bipartite
The main result of this work is that an orthogonal access scheme such as TDMA
achieves the all-unicast degrees of freedom (DoF) region of the topological
interference management (TIM) problem if and only if the network topology graph
is chordal bipartite, i.e., every cycle that can contain a chord, does contain
a chord. The all-unicast DoF region includes the DoF region for any arbitrary
choice of a unicast message set, so e.g., the results of Maleki and Jafar on
the optimality of orthogonal access for the sum-DoF of one-dimensional convex
networks are recovered as a special case. The result is also established for
the corresponding topological representation of the index coding problem
Two-Page Book Embeddings of 4-Planar Graphs
Back in the Eighties, Heath showed that every 3-planar graph is
subhamiltonian and asked whether this result can be extended to a class of
graphs of degree greater than three. In this paper we affirmatively answer this
question for the class of 4-planar graphs. Our contribution consists of two
algorithms: The first one is limited to triconnected graphs, but runs in linear
time and uses existing methods for computing hamiltonian cycles in planar
graphs. The second one, which solves the general case of the problem, is a
quadratic-time algorithm based on the book-embedding viewpoint of the problem.Comment: 21 pages, 16 Figures. A shorter version is to appear at STACS 201
Groupoid Extensions of Mapping Class Representations for Bordered Surfaces
The mapping class group of a surface with one boundary component admits
numerous interesting representations including as a group of automorphisms of a
free group and as a group of symplectic transformations. Insofar as the mapping
class group can be identified with the fundamental group of Riemann's moduli
space, it is furthermore identified with a subgroup of the fundamental path
groupoid upon choosing a basepoint. A combinatorial model for this, the mapping
class groupoid, arises from the invariant cell decomposition of Teichm\"uller
space, whose fundamental path groupoid is called the Ptolemy groupoid. It is
natural to try to extend representations of the mapping class group to the
mapping class groupoid, i.e., construct a homomorphism from the mapping class
groupoid to the same target that extends the given representations arising from
various choices of basepoint.
Among others, we extend both aforementioned representations to the groupoid
level in this sense, where the symplectic representation is lifted both
rationally and integrally. The techniques of proof include several algorithms
involving fatgraphs and chord diagrams. The former extension is given by
explicit formulae depending upon six essential cases, and the kernel and image
of the groupoid representation are computed. Furthermore, this provides
groupoid extensions of any representation of the mapping class group that
factors through its action on the fundamental group of the surface including,
for instance, the Magnus representation and representations on the moduli
spaces of flat connections.Comment: 24 pages, 4 figures Theorem 3.6 has been strengthened, and Theorems
8.1 and 8.2 have been adde
- …