67 research outputs found
Grafos com poucos cruzamentos e o número de cruzamentos do Kp,q em superfícies topológicas
Orientador: Orlando LeeTese (doutorado) - Universidade Estadual de Campinas, Instituto de ComputaçãoResumo: O número de cruzamentos de um grafo G em uma superfície ? é o menor número de cruzamentos de arestas dentre todos os possíveis desenhos de G em ?. Esta tese aborda dois problemas distintos envolvendo número de cruzamentos de grafos: caracterização de grafos com número de cruzamentos igual a um e determinação do número de cruzamentos do Kp,q em superfícies topológicas. Para grafos com número de cruzamentos um, apresentamos uma completa caracterização estrutural. Também desenvolvemos um algoritmo "prático" para reconhecer estes grafos. Em relação ao número de cruzamentos do Kp,q em superfícies, mostramos que para um inteiro positivo p e uma superfície ? fixos, existe um conjunto finito D(p,?) de desenhos "bons" de grafos bipartidos completos Kp,r (possivelmente variando o r) tal que, para todo inteiro q e todo desenho D de Kp,q, existe um desenho bom D' de Kp,q obtido através de duplicação de vértices de um desenho D'' em D(p,?) tal que o número de cruzamentos de D' é menor ou igual ao número de cruzamentos de D. Em particular, para todo q suficientemente grande, existe algum desenho do Kp,q com o menor número de cruzamentos possível que é obtido a partir de algum desenho de D(p,?) através da duplicação de vértices do mesmo. Esse resultado é uma extensão de outro obtido por Cristian et. al. para esferaAbstract: The crossing number of a graph G in a surface ? is the least amount of edge crossings among all possible drawings of G in ?. This thesis deals with two problems on crossing number of graphs: characterization of graphs with crossing number one and determining the crossing number of Kp,q in topological surfaces. For graphs with crossing number one, we present a complete structural characterization. We also show a "practical" algorithm for recognition of such graphs. For the crossing number of Kp,q in surfaces, we show that for a fixed positive integer p and a fixed surface ?, there is a finite set D(p,?) of good drawings of complete bipartite graphs Kp,r (with distinct values of r) such that, for every positive integer q and every good drawing D of Kp,q, there is a good drawing D' of Kp,q obtained from a drawing D'' of D(p,?) by duplicating vertices of D'' and such that the crossing number of D' is at most the crossing number of D. In particular, for any large enough q, there exists some drawing of Kp,q with fewest crossings which can be obtained from a drawing of D(p,?) by duplicating vertices. This extends a result of Christian et. al. for the sphereDoutoradoCiência da ComputaçãoDoutor em Ciência da Computação2014/14375-9FAPES
Hanani-Tutte for Approximating Maps of Graphs
We resolve in the affirmative conjectures of A. Skopenkov and Repovs (1998), and M. Skopenkov (2003) generalizing the classical Hanani-Tutte theorem to the setting of approximating maps of graphs on 2-dimensional surfaces by embeddings. Our proof of this result is constructive and almost immediately implies an efficient algorithm for testing whether a given piecewise linear map of a graph in a surface is approximable by an embedding. More precisely, an instance of this problem consists of (i) a graph G whose vertices are partitioned into clusters and whose inter-cluster edges are partitioned into bundles, and (ii) a region R of a 2-dimensional compact surface M given as the union of a set of pairwise disjoint discs corresponding to the clusters and a set of pairwise disjoint "pipes" corresponding to the bundles, connecting certain pairs of these discs. We are to decide whether G can be embedded inside M so that the vertices in every cluster are drawn in the corresponding disc, the edges in every bundle pass only through its corresponding pipe, and every edge crosses the boundary of each disc at most once
Approximate and discrete Euclidean vector bundles
We introduce
-approximate versions of the notion of a Euclidean vector bundle for
, which recover the classical notion of a Euclidean vector bundle when
. In particular, we study Čech cochains with coefficients in the orthogonal group that satisfy an approximate cocycle condition. We show that
-approximate vector bundles can be used to represent classical vector bundles when
is sufficiently small. We also introduce distances between approximate vector bundles and use them to prove that sufficiently similar approximate vector bundles represent the same classical vector bundle. This gives a way of specifying vector bundles over finite simplicial complexes using a finite amount of data and also allows for some tolerance to noise when working with vector bundles in an applied setting. As an example, we prove a reconstruction theorem for vector bundles from finite samples. We give algorithms for the effective computation of low-dimensional characteristic classes of vector bundles directly from discrete and approximate representations and illustrate the usage of these algorithms with computational examples
Characterizing 2-crossing-critical graphs
It is very well-known that there are precisely two minimal non-planar graphs: K5 and K3,3 (degree 2 vertices being irrelevant in this context). In the language of crossing numbers, these are the only 1-crossing-critical graphs: They each have crossing number at least one, and every proper subgraph has crossing number less than one. In 1987, Kochol exhibited an infinite family of 3-connected, simple, 2-crossing-critical graphs. In this work, we: (i) determine all the 3-connected 2-crossing-critical graphs that contain a subdivision of the Möbius Ladder V10; (ii) show how to obtain all the not 3-connected 2-crossing-critical graphs from the 3-connected ones; (iii) show that there are only finitely many 3-connected 2-crossing-critical graphs not containing a subdivision of V10; and (iv) determine all the 3-connected 2-crossing-critical graphs that do not contain a subdivision of V8
Coordinate Independent Convolutional Networks -- Isometry and Gauge Equivariant Convolutions on Riemannian Manifolds
Motivated by the vast success of deep convolutional networks, there is a
great interest in generalizing convolutions to non-Euclidean manifolds. A major
complication in comparison to flat spaces is that it is unclear in which
alignment a convolution kernel should be applied on a manifold. The underlying
reason for this ambiguity is that general manifolds do not come with a
canonical choice of reference frames (gauge). Kernels and features therefore
have to be expressed relative to arbitrary coordinates. We argue that the
particular choice of coordinatization should not affect a network's inference
-- it should be coordinate independent. A simultaneous demand for coordinate
independence and weight sharing is shown to result in a requirement on the
network to be equivariant under local gauge transformations (changes of local
reference frames). The ambiguity of reference frames depends thereby on the
G-structure of the manifold, such that the necessary level of gauge
equivariance is prescribed by the corresponding structure group G. Coordinate
independent convolutions are proven to be equivariant w.r.t. those isometries
that are symmetries of the G-structure. The resulting theory is formulated in a
coordinate free fashion in terms of fiber bundles. To exemplify the design of
coordinate independent convolutions, we implement a convolutional network on
the M\"obius strip. The generality of our differential geometric formulation of
convolutional networks is demonstrated by an extensive literature review which
explains a large number of Euclidean CNNs, spherical CNNs and CNNs on general
surfaces as specific instances of coordinate independent convolutions.Comment: The implementation of orientation independent M\"obius convolutions
is publicly available at https://github.com/mauriceweiler/MobiusCNN
Notes in Pure Mathematics & Mathematical Structures in Physics
These Notes deal with various areas of mathematics, and seek reciprocal
combinations, explore mutual relations, ranging from abstract objects to
problems in physics.Comment: Small improvements and addition
- …