DOCSLIB.ORG

Gap-Published.Pdf

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Gap-Published.Pdf This list contains citations of the GAP system in scientific works. It has been obtained from author’s notices and searches in scientific citation databases including MathSciNet, for which we acknowledge the American Mathematical Society. Published work which cites GAP [1] M. Abas and T. Vetr´ık. Metric dimension of Cayley digraphs of split metacyclic groups. Theoret. Comput. Sci., 809:61–72, 2020. [2] A. Abbas, A. Assi, and P. A. Garc´ıa-S´anchez. Canonical bases of modules over one di- mensional K-algebras. Rev. R. Acad. Cienc. Exactas F´ıs. Nat. Ser. A Mat. RACSAM, 113(2):1121–1139, 2019. [3] I. Abdeljaouad. Calculation of primitive invariants of finite groups. RAIRO-INF THEOR APPL, 33(1):59–77, 1999. [4] A. Abdolghafourian and M. A. Iranmanesh. Divisibility graph for symmetric and alternating groups. Comm. Algebra, 43(7):2852–2862, 2015. [5] A. Abdolghafourian, M. A. Iranmanesh, and A. C. Niemeyer. The divisibility graph of finite groups of Lie type. J. Pure Appl. Algebra, 221(10):2482–2493, 2017. [6] A. Abdollahi. Some Engel conditions on finite subsets of certain groups. Houston J. Math., 27(3):511–522, 2001. [7] A. Abdollahi. Engel graph associated with a group. J. Algebra, 318(2):680–691, 2007. [8] A. Abdollahi. Commuting graphs of full matrix rings over finite fields. Linear Algebra Appl., 428(11-12):2947–2954, 2008. [9] A. Abdollahi. Cohomologically trivial modules over finite groups of prime power order. J. Algebra, 342:154–160, 2011. [10] A. Abdollahi. Non-solvable groups generated by involutions in which every involution is left 2-Engel. J. Group Theory, 18(1):111–114, 2015. [11] A. Abdollahi, M. Ahmadi, and S. M. Ghoraishi. Finite p-groups with the least number of outer p-automorphisms. J. Algebra Appl., 16(6):1750111, 12, 2017. [12] A. Abdollahi, F. Ashraf, and S. M. Shaker. The symmetric group of degree six can be covered by 13 and no fewer proper subgroups. Bull. Malays. Math. Sci. Soc. (2), 30(1):57–58, 2007. [13] A. Abdollahi, M. J. Ataei, and A. M. Hassanabadi. Minimal blocking sets in PG(n, 2) and covering groups by subgroups. Comm. Algebra, 36(2):365–380, 2008. [14] A. Abdollahi, M. J. Ataei, S. M. Jafarian Amiri, and A. M. Hassanabadi. Groups with a maximal irredundant 6-cover. Comm. Algebra, 33(9):3225–3238, 2005. 1 [15] A. Abdollahi, A. Azad, A. Mohammadi Hassanabadi, and M. Zarrin. On the clique numbers of non-commuting graphs of certain groups. Algebra Colloq., 17(4):611–620, 2010. [16] A. Abdollahi, R. Brandl, and A. Tortora. Groups generated by a finite Engel set. J. Algebra, 347:53–59, 2011. [17] A. Abdollahi, B. Daoud, M. Farrokhi D. G., and Y. Guerboussa. Groups of prime generalized exponent. Internat. J. Algebra Comput., 27(7):849–862, 2017. [18] A. Abdollahi, A. Faghihi, and A. M. Hassanabadi. Minimal number of generators and minimum order of a non-abelian group whose elements commute with their endomorphic images. Comm. Algebra, 36(5):1976–1987, 2008. [19] A. Abdollahi, A. Faghihi, S. A. Linton, and E. A. O’Brien. Finite 3-groups of class 3 whose elements commute with their automorphic images. Arch. Math. (Basel), 95(1):1–7, 2010. [20] A. Abdollahi, A. Faghihi, and A. Mohammadi Hassanabadi. 3-generator groups who- se elements commute with their endomorphic images are abelian. Comm. Algebra, 36(10):3783–3791, 2008. [21] A. Abdollahi, M. Guedri, and Y. Guerboussa. Non-triviality of Tate cohomology for certain classes of finite p-groups. Comm. Algebra, 45(12):5188–5192, 2017. [22] A. Abdollahi and A. M. Hassanabadi. 3-rewritable nilpotent 2-groups of class 2. Comm. Algebra, 33(5):1417–1425, 2005. [23] A. Abdollahi and A. M. Hassanabadi. Non-cyclic graph associated with a group. J. Algebra Appl., 8(2):243–257, 2009. [24] A. Abdollahi and F. Jafari. Zero divisor and unit elements with supports of size 4 in group algebras of torsion-free groups. Comm. Algebra, 47(1):424–449, 2019. [25] A. Abdollahi and F. Jafari. Cardinality of product sets in torsion-free groups and applications in group algebras. J. Algebra Appl., 19(4):2050079, 24, 2020. [26] A. Abdollahi and S. M. Jafarian Amiri. On groups with an irredundant 7-cover. J. Pure Appl. Algebra, 209(2):291–300, 2007. [27] A. Abdollahi, S. M. Jafarian Amiri, and A. M. Hassanabadi. Groups with specific number of centralizers. Houston J. Math., 33(1):43–57, 2007. [28] A. Abdollahi, S. Janbaz, and M. Jazaeri. Groups all of whose undirected Cayley graphs are determined by their spectra. J. Algebra Appl., 15(9):1650175, 15, 2016. [29] A. Abdollahi and M. Jazaeri. Groups all of whose undirected Cayley graphs are integral. European J. Combin., 38:102–109, 2014. [30] A. Abdollahi and H. Khosravi. On the right and left 4-Engel elements. Comm. Algebra, 38(3):933–943, 2010. [31] A. Abdollahi and H. Khosravi. Right 4-Engel elements of a group. J. Algebra Appl., 9(5):763–769, 2010. 2 [32] A. Abdollahi and N. Rahmani. Automorphism groups of 2-groups of coclass at most 3. Bull. Malays. Math. Sci. Soc., 43(3):2313–2320, 2020. [33] A. Abdollahi and Z. Taheri. Zero divisors and units with small supports in group algebras of torsion-free groups. Comm. Algebra, 46(2):887–925, 2018. [34] A. Abdollahi, E. R. van Dam, and M. Jazaeri. Distance-regular Cayley graphs with least eigenvalue −2. Des. Codes Cryptogr., 84(1-2):73–85, 2017. [35] A. Abdollahi and E. Vatandoost. Which Cayley graphs are integral? Electron. J. Combin., 16(1):Research Paper 122, 17, 2009. [36] A. Abdollahi and M. Zallaghi. Character sums for Cayley graphs. Comm. Algebra, 43(12):5159–5167, 2015. [37] A. Abdollahi and M. Zallaghi. Non-abelian finite groups whose character sums are invariant but are not Cayley isomorphism. J. Algebra Appl., 18(1):1950013, 15, 2019. [38] A. Abdollahi and M. Zarrin. Non-nilpotent graph of a group. Comm. Algebra, 38(12):4390–4403, 2010. [39] H. Abdolzadeh and B. Eick. On efficient presentations for infinite sequences of 2-groups with fixed coclass. Algebra Colloq., 20(4):561–572, 2013. [40] A. A. Abduh. On the representations of subgroups of the Janko sporadic simple group J1. Far East J. Math. Sci. (FJMS), 2(6):963–971, 2000. [41] R. J. R. Abel, D. Combe, A. M. Nelson, and W. D. Palmer. GBRDs over supersolvable groups and solvable groups of order prime to 3. Des. Codes Cryptogr., 69(2):189–201, 2013. [42] R. J. R. Abel, D. Combe, A. M. Nelson, and W. D. Palmer. Block designs signed over groups of order 2n3m. Discrete Math., 340(12):2925–2940, 2017. [43] M. Aboras and P. Vojtˇechovsk´y.Automorphisms of dihedral-like automorphic loops. Comm. Algebra, 44(2):613–627, 2016. [44] N. H. Abu-Ghazalh. Finiteness conditions for unions of semigroups. PhD thesis, University of St Andrews, 2013. [45] O. A. AbuGhneim. On nonabelian McFarland difference sets. In Proceedings of the Thirty- Fifth Southeastern International Conference on Combinatorics, Graph Theory and Compu- ting, volume 168, page 159–175, 2004. [46] O. A. Abughneim. Nonabelian McFarland and Menon-Hadamard difference sets. ProQuest LLC, Ann Arbor, MI, 2005. Thesis (Ph.D.)–Central Michigan University. [47] O. A. AbuGhneim. All (64, 28, 12) difference sets and related structures. Ars Combin., 125:271–285, 2016. [48] N. Adamenko and I. Velichko. The investigation of some topologies on finite sets. Appl. Sci., 8(1):8–12, 2006. 3 [49] E. Adan-Bante and J. M. Harris. On similar matrices and their products. Bol. Soc. Mat. Mexicana (3), 17(2):117–126, 2011. [50] S. R. Adhami and A. Iranmanesh. On sharp characters of type {−1, 3} or {−3, 1}. J. Algebra Appl., 16(1):1750004, 10, 2017. [51] K. A. Adiprasito, B. Benedetti, and F. H. Lutz. Extremal examples of collapsible complexes and random discrete Morse theory. Discrete Comput. Geom., 57(4):824–853, 2017. [52] A. Adler. The Mathieu group M11 and the modular curve X(11). Proc. London Math. Soc. (3), 74(1):1–28, 1997. [53] N. Adrianov. Primitive monodromy groups of rational functions with one multiple pole. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI), 446(Kombinatorika i Teoriya Grafov. V):12–30, 2016. [54] M. Afkhami, M. Farrokhi D. G., and K. Khashyarmanesh. Planar, toroidal, and projective commuting and noncommuting graphs. Comm. Algebra, 43(7):2964–2970, 2015. [55] A. Aguglia and A. Bonisoli. On the non-existence of a projective plane of order 15 with an A4-invariant oval. Discrete Math., 288(1-3):1–7, 2004. [56] A. Aguglia and L. Giuzzi. Orthogonal arrays from Hermitian varieties. Innov. Incidence Geom., 5:129–144, 2007. [57] A. Aguglia and L. Giuzzi. An algorithm for constructing some maximal arcs in PG(2, q2). Results Math., 52(1-2):17–33, 2008. [58] A. Aguglia and L. Giuzzi. Construction of a 3-dimensional MDS-code. Contrib. Discrete Math., 3(1):39–46, 2008. [59] F. Aguiló-Gost and P. A. Garc´ıa-S´anchez. Factoring in embedding dimension three numerical semigroups. Electron. J. Combin., 17(1):Research Paper 138, 21, 2010. [60] F. Aguiló-Gost, P. A. Garc´ıa-S´anchez, and D. Llena. On the number of L-shapes in embed- ding dimension four numerical semigroups. Discrete Math., 338(12):2168–2178, 2015. [61] F. Aguiló-Gost and D. Llena. Computing denumerants in numerical 3-semigroups. Quaest. Math., 41(8):1083–1116, 2018. [62] D. Aguirre-Guerrero, G. Ducoffe, L. F`abrega, P. Vil`a,and D. Coudert. Low time complexity algorithms for path computation in Cayley graphs.
Load more

Recommended publications
  • Arxiv:1711.06300V1
    EXPLICIT BLOCK-STRUCTURES FOR BLOCK-SYMMETRIC FIEDLER-LIKE PENCILS∗ M. I. BUENO†, M. MARTIN ‡, J. PEREZ´ §, A. SONG ¶, AND I. VIVIANO k Abstract. In the last decade, there has been a continued effort to produce families of strong linearizations of a matrix polynomial P (λ), regular and singular, with good properties, such as, being companion forms, allowing the recovery of eigen- vectors of a regular P (λ) in an easy way, allowing the computation of the minimal indices of a singular P (λ) in an easy way, etc. As a consequence of this research, families such as the family of Fiedler pencils, the family of generalized Fiedler pencils (GFP), the family of Fiedler pencils with repetition, and the family of generalized Fiedler pencils with repetition (GFPR) were con- structed. In particular, one of the goals was to find in these families structured linearizations of structured matrix polynomials. For example, if a matrix polynomial P (λ) is symmetric (Hermitian), it is convenient to use linearizations of P (λ) that are also symmetric (Hermitian). Both the family of GFP and the family of GFPR contain block-symmetric linearizations of P (λ), which are symmetric (Hermitian) when P (λ) is. Now the objective is to determine which of those structured linearizations have the best numerical properties. The main obstacle for this study is the fact that these pencils are defined implicitly as products of so-called elementary matrices. Recent papers in the literature had as a goal to provide an explicit block-structure for the pencils belonging to the family of Fiedler pencils and any of its further generalizations to solve this problem.
    [Show full text]
  • Academic Report 2009–10
    Academic Report 2009–10 Harish-Chandra Research Institute Chhatnag Road, Jhunsi, Allahabad 211019 Contents About the Institute 2 Director’s Report 4 Governing Council 8 Academic Staff 10 Administrative Staff 14 Academic Report: Mathematics 16 Academic Report: Physics 47 Workshops and Conferences 150 Recent Graduates 151 Publications 152 Preprints 163 About the Computer Section 173 Library 174 Construction Work 176 1 About the Institute Early Years The Harish-Chandra Research Institute is one of the premier research institute in the country. It is an autonomous institute fully funded by the Department of Atomic Energy, Government of India. Till October 10, 2000 the Institute was known as Mehta Research Institute of Mathematics and Mathematical Physics (MRI) after which it was renamed as Harish-Chandra Research Institute (HRI) after the internationally acclaimed mathematician, late Prof Harish-Chandra. The Institute started with efforts of Dr. B. N. Prasad, a mathematician at the University of Allahabad with initial support from the B. S. Mehta Trust, Kolkata. Dr. Prasad was succeeded in January 1966 by Dr. S. R. Sinha, also of Allahabad University. He was followed by Prof. P. L. Bhatnagar as the first formal Director. After an interim period in January 1983, Prof. S. S. Shrikhande joined as the next Director of the Institute. During his tenure the dialogue with the Department of Atomic Energy (DAE) entered into decisive stage and a review committee was constituted by the DAE to examine the Institutes fu- ture. In 1985 N. D. Tiwari, the then Chief Minister of Uttar Pradesh, agreed to provide sufficient land for the Institute and the DAE promised financial sup- port for meeting both the recurring and non-recurring expenditure.
    [Show full text]
  • "Distance Measures for Graph Theory"
    Distance measures for graph theory : Comparisons and analyzes of different methods Dissertation presented by Maxime DUYCK for obtaining the Master’s degree in Mathematical Engineering Supervisor(s) Marco SAERENS Reader(s) Guillaume GUEX, Bertrand LEBICHOT Academic year 2016-2017 Acknowledgments First, I would like to thank my supervisor Pr. Marco Saerens for his presence, his advice and his precious help throughout the realization of this thesis. Second, I would also like to thank Bertrand Lebichot and Guillaume Guex for agreeing to read this work. Next, I would like to thank my parents, all my family and my friends to have accompanied and encouraged me during all my studies. Finally, I would thank Malian De Ron for creating this template [65] and making it available to me. This helped me a lot during “le jour et la nuit”. Contents 1. Introduction 1 1.1. Context presentation .................................. 1 1.2. Contents .......................................... 2 2. Theoretical part 3 2.1. Preliminaries ....................................... 4 2.1.1. Networks and graphs .............................. 4 2.1.2. Useful matrices and tools ........................... 4 2.2. Distances and kernels on a graph ........................... 7 2.2.1. Notion of (dis)similarity measures ...................... 7 2.2.2. Kernel on a graph ................................ 8 2.2.3. The shortest-path distance .......................... 9 2.3. Kernels from distances ................................. 9 2.3.1. Multidimensional scaling ............................ 9 2.3.2. Gaussian mapping ............................... 9 2.4. Similarity measures between nodes .......................... 9 2.4.1. Katz index and its Leicht’s extension .................... 10 2.4.2. Commute-time distance and Euclidean commute-time distance .... 10 2.4.3. SimRank similarity measure .........................
    [Show full text]
  • Chapter 4 Introduction to Spectral Graph Theory
    Chapter 4 Introduction to Spectral Graph Theory Spectral graph theory is the study of a graph through the properties of the eigenvalues and eigenvectors of its associated Laplacian matrix. In the following, we use G = (V; E) to represent an undirected n-vertex graph with no self-loops, and write V = f1; : : : ; ng, with the degree of vertex i denoted di. For undirected graphs our convention will be that if there P is an edge then both (i; j) 2 E and (j; i) 2 E. Thus (i;j)2E 1 = 2jEj. If we wish to sum P over edges only once, we will write fi; jg 2 E for the unordered pair. Thus fi;jg2E 1 = jEj. 4.1 Matrices associated to a graph Given an undirected graph G, the most natural matrix associated to it is its adjacency matrix: Definition 4.1 (Adjacency matrix). The adjacency matrix A 2 f0; 1gn×n is defined as ( 1 if fi; jg 2 E; Aij = 0 otherwise. Note that A is always a symmetric matrix with exactly di ones in the i-th row and the i-th column. While A is a natural representation of G when we think of a matrix as a table of numbers used to store information, it is less natural if we think of a matrix as an operator, a linear transformation which acts on vectors. The most natural operator associated with a graph is the diffusion operator, which spreads a quantity supported on any vertex equally onto its neighbors. To introduce the diffusion operator, first consider the degree matrix: Definition 4.2 (Degree matrix).
    [Show full text]
  • MINIMUM DEGREE ENERGY of GRAPHS Dedicated to the Platinum
    Electronic Journal of Mathematical Analysis and Applications Vol. 7(2) July 2019, pp. 230-243. ISSN: 2090-729X(online) http://math-frac.org/Journals/EJMAA/ |||||||||||||||||||||||||||||||| MINIMUM DEGREE ENERGY OF GRAPHS B. BASAVANAGOUD AND PRAVEEN JAKKANNAVAR Dedicated to the Platinum Jubilee year of Dr. V. R. Kulli Abstract. Let G be a graph of order n. Then an n × n symmetric matrix is called the minimum degree matrix MD(G) of a graph G, if its (i; j)th entry is minfdi; dj g whenever i 6= j, and zero otherwise, where di and dj are the degrees of ith and jth vertices of G, respectively. In the present work, we obtain the characteristic polynomial of the minimum degree matrix of graphs obtained by some graph operations. In addition, bounds for the largest minimum degree eigenvalue and minimum degree energy of graphs are obtained. 1. Introduction Throughout this paper by a graph G = (V; E) we mean a finite undirected graph without loops and multiple edges of order n and size m. Let V = V (G) and E = E(G) be the vertex set and edge set of G, respectively. The degree dG(v) of a vertex v 2 V (G) is the number of edges incident to it in G. The graph G is r-regular if and only if the degree of each vertex in G is r. Let fv1; v2; :::; vng be the vertices of G and let di = dG(vi). Basic notations and terminologies can be found in [8, 12, 14]. In literature, there are several graph polynomials defined on different graph matrices such as adjacency matrix [8, 12, 14], Laplacian matrix [15], signless Laplacian matrix [9, 18], seidel matrix [5], degree sum matrix [13, 19], distance matrix [1] etc.
    [Show full text]
  • Integral Free-Form Sudoku Graphs
    Integral Free-Form Sudoku graphs Omar Alomari 1 Basic Sciences German Jordanian University Amman, Jordan Mohammad Abudayah 2 Basic Sciences German Jordanian University Amman, Jordan Torsten Sander 3 Fakulta¨t fu¨r Informatik Ostfalia Hochschule fu¨r angewandte Wissenschaften Wolfenbu¨ttel, Germany Abstract A free-form Sudoku puzzle is a square arrangement of m × m cells such that the cells are partitioned into m subsets (called blocks) of equal cardinality. The goal of the puzzle is to place integers 1; : : : m in the cells such that the numbers in every row, column and block are distinct. Represent each cell by a vertex and add edges between two vertices exactly when the corresponding cells, according to the rules, must contain different numbers. This yields the associated free-form Sudoku graph. It was shown that all Sudoku graphs are integral graphs, in this paper we present many free-form Sudoku graphs that are still integral graphs. Keywords: Sudoku, spectrum, eigenvectors. 1 Preliminaries The r−regular slice n−sudoku puzzle is the free-form sudoku puzzle obtained from the n−sudoku puzzle by shifting the block cells in the (in + d)th row (d − 1)rn cells to the right, where 1 ≤ d ≤ n. In Figure 1 (B), the cells are partitioned into 9 blocks denoted by Bi . To study the eigenvalues of r−regular slice n−sudoku, let us start from the n2 ×n rectangular template slice where its cells partitioned into n2 blocks and for i = 0; 1; : : : ; n − 1, rows in + 1; in + 2;::: (i + 1)n contains only the n block numbers in + 1; in + 2;::: (i + 1)n, with the additional restriction that the block numbers used in different i−collection of rows are distinct, see fig1 (A).
    [Show full text]
  • Varieties of Groups and Isologisms
    J. Austral. Math. Soc. (Series A) 46 (1989), 22-60 VARIETIES OF GROUPS AND ISOLOGISMS N. S. HEKSTER (Received 2 February 1987) Communicated by H. Lausch Abstract In order to classify solvable groups Philip Hall introduced in 1939 the concept of isoclinism. Subsequently he defined a more general notion called isologism. This is so to speak isoclinism with respect to a certain variety of groups. The equivalence relation isologism partitions the class of all groups into families. The present paper is concerned with the internal structure of these families. 1980 Mathematics subject classification (Amer. Math. Soc.) (1985 Revision): 20 E 10, 20 E 99, 20 F 14. Keywords and phrases: variety of groups, isologism. 1. Introduction, preliminaries and notational conventions It is a well-known fact that solvable groups are difficult to classify because of the abundance of normal subgroups. In a certain sense the class of groups of prime- power order is the simplest case to handle. But already here the classification is far from being complete. Up to now there are only a few classes of such prime- power order groups which have been adequately analysed. The first to create some order in the plethora of groups of prime-power order was Philip Hall. He observed that the notion of isomorphism of groups is really too strong to give rise to a satisfactory classification and that it had to be replaced by a weaker equivalence relation. Subsequently he discovered a suitable equivalence relation and called it isoclinism of groups (see [6]). It is this classification principle that 1989 Australian Mathematical Society 0263-6115/89 SA2.00 + 0.00 22 Downloaded from https://www.cambridge.org/core.
    [Show full text]
  • MATH7502 Topic 6 - Graphs and Networks
    MATH7502 Topic 6 - Graphs and Networks October 18, 2019 Group ID fbb0bfdc-79d6-44ad-8100-05067b9a0cf9 Chris Lam 41735613 Anthony North 46139896 Stuart Norvill 42938019 Lee Phillips 43908587 Minh Tram Julien Tran 44536389 Tutor Chris Raymond (P03 Tuesday 4pm) 1 [ ]: using Pkg; Pkg.add(["LightGraphs", "GraphPlot", "Laplacians","Colors"]); using LinearAlgebra; using LightGraphs, GraphPlot, Laplacians,Colors; 0.1 Graphs and Networks Take for example, a sample directed graph: [2]: # creating the above directed graph let edges = [(1, 2), (1, 3), (2,4), (3, 2), (3, 5), (4, 5), (4, 6), (5, 2), (5, 6)] global graph = DiGraph(Edge.(edges)) end [2]: {6, 9} directed simple Int64 graph 2 0.2 Incidence matrix • shows the relationship between nodes (columns) via edges (rows) • edges are connected by exactly two nodes (duh), with direction indicated by the sign of each row in the edge column – a value of 1 at A12 indicates that edge 1 is directed towards node 1, or node 2 is the destination node for edge 1 • edge rows sum to 0 and constant column vectors c(1, ... , 1) are in the nullspace • cannot represent self-loops (nodes connected to themselves) Using Strang’s definition in the LALFD book, a graph consists of nodes defined as columns n and edges m as rows between the nodes. An Incidence Matrix A is m × n. For the above sample directed graph, we can generate its incidence matrix. [3]: # create an incidence matrix from a directed graph function create_incidence(graph::DiGraph) M = zeros(Int, ne(graph), nv(graph)) # each edge maps to a row in the incidence
    [Show full text]
  • Two One-Parameter Special Geometries
    Two One-Parameter Special Geometries Volker Braun1, Philip Candelas2 and Xenia de la Ossa2 1Elsenstrasse 35 12435 Berlin Germany 2Mathematical Institute University of Oxford Radcliffe Observatory Quarter Woodstock Road Oxford OX2 6GG, UK arXiv:1512.08367v1 [hep-th] 28 Dec 2015 Abstract The special geometries of two recently discovered Calabi-Yau threefolds with h11 = 1 are analyzed in detail. These correspond to the 'minimal three-generation' manifolds with h21 = 4 and the `24-cell' threefolds with h21 = 1. It turns out that the one- dimensional complex structure moduli spaces for these manifolds are both very similar and surprisingly complicated. Both have 6 hyperconifold points and, in addition, there are singularities of the Picard-Fuchs equation where the threefold is smooth but the Yukawa coupling vanishes. Their fundamental periods are the generating functions of lattice walks, and we use this fact to explain why the singularities are all at real values of the complex structure. Contents 1 Introduction 1 2 The Special Geometry of the (4,1)-Manifold 6 2.1 Fundamental Period . .6 2.2 Picard-Fuchs Differential Equation . .8 2.3 Integral Homology Basis and the Prepotential . 11 2.4 The Yukawa coupling . 16 3 The Special Geometry of the (1,1)-Manifold(s) 17 3.1 The Picard-Fuchs Operator . 17 3.2 Monodromy . 19 3.3 Prepotential . 22 3.4 Integral Homology Basis . 23 3.5 Instanton Numbers . 24 3.6 Cross Ratios . 25 4 Lattice Walks 27 4.1 Spectral Considerations . 27 4.2 Square Lattice . 28 1. Introduction Detailed descriptions of special geometries are known only in relatively few cases.
    [Show full text]
  • Spectral Graph Theory – from Practice to Theory
    Spectral Graph Theory – From Practice to Theory Alexander Farrugia [email protected] Abstract Graph theory is the area of mathematics that studies networks, or graphs. It arose from the need to analyse many diverse network-like structures like road networks, molecules, the Internet, social networks and electrical networks. In spectral graph theory, which is a branch of graph theory, matrices are constructed from such graphs and analysed from the point of view of their so-called eigenvalues and eigenvectors. The first practical need for studying graph eigenvalues was in quantum chemistry in the thirties, forties and fifties, specifically to describe the Hückel molecular orbital theory for unsaturated conjugated hydrocarbons. This study led to the field which nowadays is called chemical graph theory. A few years later, during the late fifties and sixties, graph eigenvalues also proved to be important in physics, particularly in the solution of the membrane vibration problem via the discrete approximation of the membrane as a graph. This paper delves into the journey of how the practical needs of quantum chemistry and vibrating membranes compelled the creation of the more abstract spectral graph theory. Important, yet basic, mathematical results stemming from spectral graph theory shall be mentioned in this paper. Later, areas of study that make full use of these mathematical results, thus benefitting greatly from spectral graph theory, shall be described. These fields of study include the P versus NP problem in the field of computational complexity, Internet search, network centrality measures and control theory. Keywords: spectral graph theory, eigenvalue, eigenvector, graph. Introduction: Spectral Graph Theory Graph theory is the area of mathematics that deals with networks.
    [Show full text]
  • Seidel Signless Laplacian Energy of Graphs 1. Introduction
    Mathematics Interdisciplinary Research 2 (2017) 181 − 191 Seidel Signless Laplacian Energy of Graphs Harishchandra S. Ramane?, Ivan Gutman, Jayashri B. Patil and Raju B. Jummannaver Abstract Let S(G) be the Seidel matrix of a graph G of order n and let DS (G) = diag(n − 1 − 2d1; n − 1 − 2d2; : : : ; n − 1 − 2dn) be the diagonal matrix with di denoting the degree of a vertex vi in G. The Seidel Laplacian matrix of G is defined as SL(G) = DS (G) − S(G) and the Seidel signless Laplacian + matrix as SL (G) = DS (G) + S(G). The Seidel signless Laplacian energy ESL+ (G) is defined as the sum of the absolute deviations of the eigenvalues of SL+(G) from their mean. In this paper, we establish the main properties + of the eigenvalues of SL (G) and of ESL+ (G). Keywords: Seidel Laplacian eigenvalues, Seidel Laplacian energy, Seidel sign- less Laplacian matrix, Seidel signless Laplacian eigenvalues, Seidel signless Laplacian energy. 2010 Mathematics Subject Classification: 05C50. 1. Introduction Let G be a simple, undirected graph with n vertices and m edges. We say that G is an (n; m)-graph. Let v1; v2; : : : ; vn be the vertices of G. The degree of a vertex vi is the number of edges incident to it and is denoted by di. If di = r for all i = 1; 2; : : : ; n, then G is said to be an r-regular graph. By G will be denoted the complement of the graph G. The adjacency matrix of a graph G is the square matrix A(G) = (aij) , in which aij = 1 if vi is adjacent to vj and aij = 0 otherwise.
    [Show full text]
  • Italian Journal of Pure and Applied Mathematics ISSN 2239-0227
    N° 28 – July 2011 Italian Journal of Pure and Applied Mathematics ISSN 2239-0227 EDITOR-IN-CHIEF Piergiulio Corsini Editorial Board Saeid Abbasbandy Antonino Giambruno Ivo Rosenberg Reza Ameri Furio Honsell Paolo Salmon Luisa Arlotti James Jantosciak Maria Scafati Tallini Krassimir Atanassov Tomas Kepka Kar Ping Shum Malvina Baica David Kinderlehrer Alessandro Silva Federico Bartolozzi Andrzej Lasota Sergio Spagnolo Rajabali Borzooei Violeta Leoreanu Hari M. Srivastava Carlo Cecchini Mario Marchi Marzio Strassoldo Gui-Yun Chen Donatella Marini Yves Sureau Domenico Nico Chillemi Angelo Marzollo Carlo Tasso Stephen Comer Antonio Maturo Ioan Tofan Irina Cristea Jean Mittas Aldo Ventre Mohammad Reza Darafsheh M. Reza Moghadam Thomas Vougiouklis Bal Kishan Dass Petr Nemec Hans Weber Bijan Davvaz Vasile Oproiu Yunqiang Yin Alberto Felice De Toni Livio C. Piccinini Mohammad Mehdi Zahedi Franco Eugeni Goffredo Pieroni Fabio Zanolin Giovanni Falcone Flavio Pressacco Paolo Zellini Yuming Feng Vito Roberto Jianming Zhan F O R U M EDITOR-IN-CHIEF Franco Eugeni Vito Roberto Dipartimento di Metodi Quantitativi per l'Economia del Territorio Dipartimento di Matematica e Informatica Piergiulio Corsini Università di Teramo, Italy Via delle Scienze 206 - 33100 Udine, Italy [email protected] [email protected] Department of Civil Engineering and Architecture Via delle Scienze 206 - 33100 Udine, Italy Giovanni Falcone Ivo Rosenberg [email protected] Dipartimento di Metodi e Modelli Matematici Departement de Mathematique et de Statistique viale delle Scienze Ed. 8 Université de Montreal 90128 Palermo, Italy C.P. 6128 Succursale Centre-Ville VICE-CHIEF [email protected] Montreal, Quebec H3C 3J7 - Canada [email protected] Yuming Feng Violeta Leoreanu College of Math.
    [Show full text]