An Infinite Family of Sum-Paint Critical Graphs

2020 ◽  
Vol 36 (5) ◽  
pp. 1563-1571
Author(s):  
Thomas Mahoney ◽  
Chad Wiley
Keyword(s):  
Infinite Family ◽  
Critical Graphs

scholarly journals Book Embedding of Infinite Family ((2h+3 2))-Crossing-Critical Graphs for h=1 with Rational Average Degree r∈(3.5,4)

d'CARTESIAN ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 145
Author(s):  
Sheren H. Wilar ◽  
Benny Pinontoan ◽  
Chriestie E.J.C. Montolalu
Keyword(s):  
Intersection Number ◽  
Infinite Family ◽  
Infinite Graph ◽  
Average Degree ◽  
Critical Graphs ◽  
Book Embedding ◽  
Embed Graph ◽  
Principal Tool ◽  
Page Book

A principal tool used in construction of crossing-critical graphs are tiles. In the tile concept, tiles can be arranged by gluing one tile to another in a linear or circular fashion. The series of tiles with circular fashion form an infinite graph family. In this way, the intersection number of this family of graphs can be determined. In this research, has been formed an infinite family graphs Q_((1,s,b) ) (n) with average degree r between 3.5 and 4. The graph formed by gluing together many copies of the tile P_((1,s,b) ) in circular fashion, where the tile P_((1,s,b) ) consist of two identical pieces of tile. And then, the graph embedded into the book to determine the pagenumber that can be formed. When embed graph into book, the vertices are put on a line called the spine and the edges are put on half-planes called the pages. The results obtained show that the graph Q_((1,s,b) ) (n) has 10-crossing-critical and book embedding of graph has 4-page book.

scholarly journals KONSTRUKSI FAMILI GRAF HAMPIR PLANAR DENGAN ANGKA PERPOTONGAN TERTENTU

2011 ◽  
Vol 15 (1) ◽  
pp. 150
Author(s):  
Benny Pinontoan
Keyword(s):  
Planar Graph ◽  
Planar Graphs ◽  
Large Scale ◽  
Infinite Family ◽  
Crossing Number ◽  
Plane Graphs ◽  
Critical Graphs ◽  
Product Of Graphs ◽  
Infinite Sequences

KONSTRUKSI FAMILI GRAF HAMPIR PLANAR DENGAN ANGKA PERPOTONGAN TERTENTU Benny Pinontoan1) 1) Program Studi Matematika FMIPA Universitas Sam Ratulangi Manado, 95115ABSTRAK Sebuah graf adalah pasangan himpunan tak kosong simpul dan himpunan sisi. Graf dapat digambar pada bidang dengan atau tanpa perpotongan. Angka perpotongan adalah jumlah perpotongan terkecil di antara semua gambar graf pada bidang. Graf dengan angka perpotongan nol disebut planar. Graf memiliki penerapan penting pada desain Very Large Scale of Integration (VLSI). Sebuah graf dinamakan perpotongan kritis jika penghapusan sebuah sisi manapun menurunkan angka perpotongannya, sedangkan sebuah graf dinamakan hampir planar jika menghapus salah satu sisinya membuat graf yang sisa menjadi planar. Banyak famili graf perpotongan kritis yang dapat dibentuk dari bagian-bagian kecil yang disebut ubin yang diperkenalkan oleh Pinontoan dan Richter (2003). Pada tahun 2010, Bokal memperkenalkan operasi perkalian zip untuk graf. Dalam artikel ini ditunjukkan sebuah konstruksi dengan menggunakan ubin dan perkalian zip yang jika diberikan bilangan bulat k ³ 1, dapat menghasilkan famili tak hingga graf hampir planar dengan angka perpotongan k. Kata kunci: angka perpotongan, ubin graf, graf hampir planar. CONSTRUCTION OF INFINITE FAMILIES OF ALMOST PLANAR GRAPH WITH GIVEN CROSSING NUMBER ABSTRACT A graph is a pair of a non-empty set of vertices and a set of edges. Graphs can be drawn on the plane with or without crossing of its edges. Crossing number of a graph is the minimal number of crossings among all drawings of the graph on the plane. Graphs with crossing number zero are called planar. Crossing number problems find important applications in the design of layout of Very Large Scale of Integration (VLSI). A graph is crossing-critical if deleting of any of its edge decreases its crossing number. A graph is called almost planar if deleting one edge makes the graph planar. Many infinite sequences of crossing-critical graphs can be made up by gluing small pieces, called tiles introduced by Pinontoan and Richter (2003). In 2010, Bokal introduced the operation zip product of graphs. This paper shows a construction by using tiles and zip product, given an integer k ³ 1, to build an infinite family of almost planar graphs having crossing number k. Keywords: Crossing number, tile, almost planar graph.

scholarly journals Improvement on the Crossing Number of Crossing-Critical Graphs

2020 ◽  
Author(s):  
János Barát ◽  
Géza Tóth
Keyword(s):  
Crossing Number ◽  
Critical Graphs ◽  
Minimum Number ◽  
Edge Crossings

AbstractThe crossing number of a graph G is the minimum number of edge crossings over all drawings of G in the plane. A graph G is k-crossing-critical if its crossing number is at least k, but if we remove any edge of G, its crossing number drops below k. There are examples of k-crossing-critical graphs that do not have drawings with exactly k crossings. Richter and Thomassen proved in 1993 that if G is k-crossing-critical, then its crossing number is at most $$2.5\, k+16$$ 2.5 k + 16 . We improve this bound to $$2k+8\sqrt{k}+47$$ 2 k + 8 k + 47 .

scholarly journals More on holographic correlators: twisted and dimensionally reduced structures

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Connor Behan ◽  
Pietro Ferrero ◽  
Xinan Zhou
Keyword(s):  
Field Theory ◽  
Theoretical Data ◽  
Infinite Family ◽  
Tree Level ◽  
Chiral Algebra ◽  
Perfect Agreement ◽  
Four Dimensions ◽  
Independent Field ◽  
Superconformal Theories ◽  
Emergent Structure

Abstract Recently four-point holographic correlators with arbitrary external BPS operators were constructively derived in [1, 2] at tree-level for maximally superconformal theories. In this paper, we capitalize on these theoretical data, and perform a detailed study of their analytic properties. We point out that these maximally supersymmetric holographic correlators exhibit a hidden dimensional reduction structure à la Parisi and Sourlas. This emergent structure allows the correlators to be compactly expressed in terms of only scalar exchange diagrams in a dimensionally reduced spacetime, where formally both the AdS and the sphere factors have four dimensions less. We also demonstrate the superconformal properties of holographic correlators under the chiral algebra and topological twistings. For AdS5× S5 and AdS7× S4, we obtain closed form expressions for the meromorphic twisted correlators from the maximally R-symmetry violating limit of the holographic correlators. The results are compared with independent field theory computations in 4d $$ \mathcal{N} $$ N = 4 SYM and the 6d (2, 0) theory, finding perfect agreement. For AdS4× S7, we focus on an infinite family of near-extremal four-point correlators, and extract various protected OPE coefficients from supergravity. These OPE coefficients provide new holographic predictions to be matched by future supersymmetric localization calculations. In deriving these results, we also develop many technical tools which should have broader applicability beyond studying holographic correlators.

scholarly journals AdS2 × S2 × CY2 solutions in Type IIB with 8 supersymmetries

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Yolanda Lozano ◽  
Carlos Nunez ◽  
Anayeli Ramirez
Keyword(s):  
Quantum Mechanics ◽  
Riemann Surface ◽  
Central Charge ◽  
Global Solutions ◽  
Infinite Family ◽  
Dimensional System ◽  
One Dimensional

Abstract We present a new infinite family of Type IIB supergravity solutions preserving eight supercharges. The structure of the space is AdS2 × S2 × CY2 × S1 fibered over an interval. These solutions can be related through double analytical continuations with those recently constructed in [1]. Both types of solutions are however dual to very different superconformal quantum mechanics. We show that our solutions fit locally in the class of AdS2 × S2 × CY2 solutions fibered over a 2d Riemann surface Σ constructed by Chiodaroli, Gutperle and Krym, in the absence of D3 and D7 brane sources. We compare our solutions to the global solutions constructed by Chiodaroli, D’Hoker and Gutperle for Σ an annulus. We also construct a cohomogeneity-two family of solutions using non-Abelian T-duality. Finally, we relate the holographic central charge of our one dimensional system to a combination of electric and magnetic fluxes. We propose an extremisation principle for the central charge from a functional constructed out of the RR fluxes.

scholarly journals An infinite family of higher-order difference operators that commute with Ruijsenaars operators of type A

2021 ◽  
Vol 111 (4) ◽  
Author(s):  
Masatoshi Noumi ◽  
Ayako Sano
Keyword(s):  
Infinite Family ◽  
Type A ◽  
Higher Order ◽  
Difference Operators ◽  
Order Difference

AbstractWe introduce a new infinite family of higher-order difference operators that commute with the elliptic Ruijsenaars difference operators of type A. These operators are related to Ruijsenaars’ operators through a formula of Wronski type.

scholarly journals An infinite family of Williamson matrices

1977 ◽  
Vol 24 (2) ◽  
pp. 252-256 ◽  
Author(s):  
Edward Spence
Keyword(s):  
Prime Power ◽  
Hadamard Matrix ◽  
Infinite Family ◽  
Williamson Matrices

AbstractIn this paper the following result is proved. Suppose there exists a C-matrix of order n + 1. Then if n≡1 (mod 4) there exists a Hadamard matrix of order 2nr(n + 1), while if n≡3 (mod 4) there exists a Hadamard matrix of order nr(n + 1) for all r ≧0. If n≡1 (mod 4) is a prime power, the method is adapted to prove the existence of a Hadamard matrix of the Williamson type, of order 2nr(n + 1), for all r ≧0.

scholarly journals Colored HOMFLY-PT for hybrid weaving knot $$ {\hat{\mathrm{W}}}_3 $$(m, n)

2021 ◽  
Vol 2021 (6) ◽  
Author(s):  
Vivek Kumar Singh ◽  
Rama Mishra ◽  
P. Ramadevi
Keyword(s):  
Closed Form ◽  
Topological Strings ◽  
Chebyshev Polynomials ◽  
Fibonacci Numbers ◽  
Infinite Family ◽  
Closed Form Expression ◽  
Two Dimensional ◽  
Laurent Polynomials ◽  
Form Expression ◽  
Torus Knots

Abstract Weaving knots W(p, n) of type (p, n) denote an infinite family of hyperbolic knots which have not been addressed by the knot theorists as yet. Unlike the well known (p, n) torus knots, we do not have a closed-form expression for HOMFLY-PT and the colored HOMFLY-PT for W(p, n). In this paper, we confine to a hybrid generalization of W(3, n) which we denote as $$ {\hat{W}}_3 $$ W ̂ 3 (m, n) and obtain closed form expression for HOMFLY-PT using the Reshitikhin and Turaev method involving $$ \mathrm{\mathcal{R}} $$ ℛ -matrices. Further, we also compute [r]-colored HOMFLY-PT for W(3, n). Surprisingly, we observe that trace of the product of two dimensional $$ \hat{\mathrm{\mathcal{R}}} $$ ℛ ̂ -matrices can be written in terms of infinite family of Laurent polynomials $$ {\mathcal{V}}_{n,t}\left[q\right] $$ V n , t q whose absolute coefficients has interesting relation to the Fibonacci numbers $$ {\mathrm{\mathcal{F}}}_n $$ ℱ n . We also computed reformulated invariants and the BPS integers in the context of topological strings. From our analysis, we propose that certain refined BPS integers for weaving knot W(3, n) can be explicitly derived from the coefficients of Chebyshev polynomials of first kind.

Sign in / Sign up

Export Citation Format

Share Document