Fermilab Fermilab Core Computing Division

Library Home |  Ask a Librarian library@fnal.gov |  Book Catalog |  Library Journals |  Requests |  SPIRES |  Fermilab Documents |

Fermilab Library
SPIRES-BOOKS: FIND KEYWORD GRAPH THEORY *END*INIT* use /tmp/qspiwww.webspi1/24361.8 QRY 131.225.70.96 . find keyword graph theory ( in books using www Cover
Image
Call number:9789811035067:ONLINE Show nearby items on shelf
Title:Spectral Analysis of Growing Graphs A Quantum Probability Point of View
Author(s): Nobuaki Obata
Date:2017
Size:1 online resource (VIII, 138 p. 22 illus., 9 illus. in color p.)
Contents:1. Graphs and Matrices -- 2. Spectra of Finite Graphs -- 3. Spectral Distributions of Graphs -- 4. Orthogonal Polynomials and Fock Spaces -- 5. Analytic Theory of Moments -- 6. Method of Quantum Decomposition -- 7. Graph Products and
Asymptotics -- References -- Index
ISBN:9789811035067
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Mathematics , Probabilities , Graph theory , Mathematical physics , Mathematics , Mathematical Physics , Probability Theory and Stochastic Processes , Graph Theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:9783319542416:ONLINE Show nearby items on shelf
Title:Complex Networks VIII Proceedings of the 8th Conference on Complex Networks CompleNet 2017
Author(s):
Date:2017
Size:1 online resource (XIV, 262 p. 88 illus., 75 illus. in color p.)
Contents:Part I: Theory of Complex Networks -- Second-Order Assortative Mixing in Social Networks -- Network motifs detection using random networks with prescribed subgraph frequencies -- Network motifs detection using random networks with
prescribed subgraph frequencies -- Fuzzy Centrality Evaluation in Complex and Multiplex Networks -- Part II: Community Structure -- Enhancing Space-Aware Community Detection Using Degree Constrained Spatial Null Model -- Node-centric
community detection in multilayer networks with layer-coverage diversification bias -- Community Detection in Signed Networks Based on Extended Signed Modularity -- Characterising inter and intra-community interactions in link streams
using temporal motifs -- Part III: Dynamics of Networks -- Modeling the Impact of Privacy on Information Diffusion in Social Networks -- Evolution Similarity for Dynamic Link Prediction in Longitudinal Networks -- Stochastic Modeling
of the Decay Dynamics of Online Social Networks -- Part IV: Applications of Network Science -- Complex Reaction Network in Silane Plasma Chemistry -- Seeing Red: Locating People of Interest in Networks -- Understanding Subject-based
Emoji Usage using Network Science -- Characterization of Written Languages using Structural Features from Common Corpora -- Optimal Information Security Investment in Modern Social Networking -- Part V: Social Structure -- Emergence of
social balance in signed networks -- Community Detection in the Network of German Princes in 1225: a Case Study -- Comparative topological signatures of growing collaboration networks -- Part VI: Human Behavior -- Explaining changes in
physical activity through a computational model of social contagion -- Everyday the Same Picture: Popularity and Content Diversity -- Part VII: Biological Networks -- Investigating side effect modules in the interactome and their use
in drug adverse effect discovery -- Attractor Analysis of the Asynchronous Boolean Model of the Klotho Gene Regulatory Network
ISBN:9783319542416
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Physics , Artificial intelligence , Computational intelligence , Complexity, Computational , Physics , Applications of Graph Theory and Complex Networks , Computational Social Sciences , Computational Intelligence , Artificial Intelligence (incl. Robotics) , Complexity
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:9783319526577:ONLINE Show nearby items on shelf
Title:Graceful, Harmonious and Magic Type Labelings Relations and Techniques
Author(s): Susana C López
Date:2017
Size:1 online resource (XII, 134 p. 82 illus p.)
Contents:1. Notation and terminology -- 2. Graphs labelings -- 3. Super edge magic labelings: first type of relations -- 4. Harmonious labelings -- 5. Graceful labelings: the shifting technique -- 6. The ⊗-product of digraphs: second type of
relations -- 7. The polynomial method.
ISBN:9783319526577
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Mathematics , Algorithms , Combinatorics , Graph theory , Mathematics , Graph Theory , Algorithms , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:9783319477053:ONLINE Show nearby items on shelf
Title:Econophysics and Sociophysics: Recent Progress and Future Directions
Author(s):
Date:2017
Size:1 online resource (VIII, 256 p. 85 illus., 77 illus. in color p.)
Contents:Anindya S. Chakrabarti, Topology of the international trade network: size, asymmetry and volatility -- Attilio Stella, Optimal growth in the network of global economy -- Bikas K. Chakrabarti, Inequality in Societies, Academic
Institutions & Science Journals: Gini & k-indices -- Damien Challet, Market nanostructure insight into market stylized facts -- Deepak Dhar, Dynamical networks of agents with degree preference -- Diego Garlaschelli, Network
reconstruction, systemic risk, and early-warning signals -- Dipankar Gupta, Boundaries, Transgressions and Disciplinary Dynamics -- Emanuele Pugliese, New Metrics for Economic Complexity -- Fabrizio Lillo, Complex network methods for
systemic risk assessment -- Frédéric Abergel, Imperfections of financial markets: a limit order book perspective -- Harbir Lamba, Modelling momentum traders in a financial market using Prandtl-Ishlinskii operators -- Hideaki Aoyama,
Deflation and Money -- Irena Vodenska, Bi-partite network approach to predictability of financial markets and news sentiments -- János Kertész, Kinetics of Social Contagion -- Joshin Murai, A model of order signs under multiple order
splitting and public information -- Karmeshu, Stochastic Modelling of High Frequency Intra-day Stock Returns: Emergence of Cubic Power-Law -- Kimmo Kaski, Social Physics: Studies of in vivo / in situ human sociality -- Kousik
Guhathakurta, Comparing the complexity of emerging and developed stock markets using recurrence network analysis -- M.S. Santhanam, Records statistics and financial time series -- Marco Patriarca, The microscopic origin of the Pareto
law and other power-law distributions -- Matteo Marsili, Complexity driven collapse of economic equilibria -- Michele Caraglio, Bridging intraday and interday market behavior through scaling -- Parongama Sen, Segregation dynamics with
continuously varying utility factor -- Sandeep Juneja, Nearest neighbor based and other popular methods for pricing Bermudan options -- Sitabhra Sinha, Loss of structural balance in the network of cross-correlations characterizing a
financial market signals the onset of major economic crisis -- Stanislao Gualdi, A dynamic model of input-output production networks: general equilibrium stability and emergence of scale-free structures -- Taisei Kaizoji, Why does the
power law for share price hold? -- Takaaki Ohnishi, Real estate valuation using k-nearest neighbor regression -- Takayuki Mizuno, Statistically detecting stock bubbles before they burst -- Victor Yakovenko, Economic inequality from
statistical physics point of view -- Yoshi Fujiwara, Quantifying Financial Distress in a Nation-wide Production Network -- Yoshiyuki Arata, Macroeconomic Consequences of Lumpy Investment under Uncertainty -- Youngna Choi, Tracking
Financial Instability Contagion: modeling and data calibration -- Yuichi Ikeda, Community and Controllability of Global Production Network: Focusing on the Economic Crisis of 2008
ISBN:9783319477053
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Physics , Statistics , Physics , Data-driven Science, Modeling and Theory Building , Statistics for Engineering, Physics, Computer Science, Chemistry and Earth Scien , Applications of Graph Theory and Complex Networks
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:9783319475516:ONLINE Show nearby items on shelf
Title:A Combinatorial Perspective on Quantum Field Theory
Author(s): Karen Yeats
Date:2017
Size:1 online resource (IX, 120 p. 16 illus p.)
Contents:Part I Preliminaries -- Introduction -- Quantum field theory set up -- Combinatorial classes and rooted trees -- The Connes-Kreimer Hopf algebra -- Feynman graphs -- Part II Dyson-Schwinger equations -- Introduction to Dyson-Schwinger
equations -- Sub-Hopf algebras from Dyson-Schwinger equations -- Tree factorial and leading log toys -- Chord diagram expansions -- Differential equations and the (next-to)m leading log expansion -- Part III Feynman periods -- Feynman
integrals and Feynman periods -- Period preserving graph symmetries -- An invariant with these symmetries -- Weight -- The c2 invariant -- Combinatorial aspects of some integration algorithms -- Index
ISBN:9783319475516
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Physics , Discrete mathematics , Mathematical physics , Quantum field theory , String theory , Physics , Quantum Field Theories, String Theory , Mathematical Physics , Discrete Mathematics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:9783319441658:ONLINE Show nearby items on shelf
Title:New Horizons in Fundamental Physics
Author(s):
Date:2017
Size:1 online resource (IX, 389 p. 134 illus., 95 illus. in color p.)
Contents:Part I Nuclear Structure and Superheavy Elements: Intertwining of Greiner's Theoretical Works and our Experimental Studies (J.H. Hamilton et al.) -- Eighty years of research on super-heavy nuclei (S. Hofmann) -- Perspectives of heavy
and superheavy nuclei research (A.V. Karpov et al.) -- Superheavy Element Chemistry - New experimental results challenge theoretical understanding (R. Eichler) -- 25 Years of FRS Experiments and New Horizons (H. Geissel et al.) -- SHE
Research with Rare-Isotope Beams, Challenges and Perspectives, and the new Generation of SHE Factories (G. Münzenberg et al.) -- Multi-modal Collinear Ternary Fission (W. von Oertzen et al.) -- From the stable to the exotic: clustering
in light nuclei (C. Beck) -- Towards Laser Spectroscopy of Superheavy Elements (H. Backe) -- Part II Physics of Heavy-Ion Collisions: Chemical freeze-out conditions in hadron resonance gas (V. Vovchenko et al.) -- The QCD Phase Diagram
and Hadron Formation in Relativistic Nuclear Collisions (F. Becattini et al.) -- Degrees of Freedom of the Quark Gluon Plasma, tested by Heavy Mesons (H. Berrehrah et al.) -- Electromagnetic emissivity of hot and dense matter (E.L.
Bratkovskaya at al.) -- Heavy-Ion Collisions: Status of Chemical Equilibrium (J. Cleymans) -- Novel developments of HYDJET++ model for ultra-relativistic heavy-ion collisions (L. Bravina et al.) -- Jet tomography in heavy-ion
collisions-Challenges, Results, and Open Problems (B. Betz) -- Part III QED - Strong Fields and High Precision: Probing QED Vacuum with Heavy Ions (J. Rafelski et al.) -- Laser assisted Breit-Wheeler and Schwinger processes (T. Nousch
et al.) -- A method to measure vacuum birefringence at FCC-ee (U.I. Uggerhoj et al.) -- Unifying Quantum Electro-Dynamics and Many-Body Perturbation Theory (I. Lindgren et al.) -- Part IV Astrophysics: Simulations of accretion disks
around massive stars (M. Algalán et al.).-Neutron Stars-Possibilities and Limits for Exotic Phases (S. Schramm et al.) -- The Case for an Underground Neutrino Facility in South Africa (Z.Z. Vilakazia et al.) -- Part IV Special topics:
Covariant Hamiltonian representation of Noether's theorem and its application to SU(N) gauge theories (J. Struckmeier et al.) -- Infrastructure Estimates for a Highly Renewable Global Electricity Grid (M. Dahl et al.) -- Power flow
tracing in complex networks (M. Schäfer et al.) -- Patent protection of high-level research results (T. J. Bürvenich)
ISBN:9783319441658
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Physics , Astrophysics , Nuclear physics , Heavy ions , Hadrons , Atoms , Matter , Physics , Nuclear Physics, Heavy Ions, Hadrons , Atoms and Molecules in Strong Fields, Laser Matter Interaction , Applications of Graph Theory and Complex Networks , Astrophysics and Astroparticles
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:9783319434766:ONLINE Show nearby items on shelf
Title:Discrete Probability Models and Methods Probability on Graphs and Trees, Markov Chains and Random Fields, Entropy and Coding
Author(s): Pierre Brémaud
Date:2017
Size:1 online resource (XIV, 559 p. 92 illus p.)
Contents:Introduction -- 1.Events and probability -- 2.Random variables -- 3.Bounds and inequalities -- 4.Almost-sure convergence -- 5.Coupling and the variation distance -- 6.The probabilistic method -- 7.Codes and trees -- 8.Markov chains --
9.Branching trees -- 10.Markov fields on graphs -- 11.Random graphs -- 12.Recurrence of Markov chains -- 13.Random walks on graphs -- 14.Asymptotic behaviour of Markov chains -- 15.Monte Carlo sampling -- 16. Convergence rates --
Appendix -- Bibliography
ISBN:9783319434766
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Mathematics , Computer communication systems , Coding theory , Mathematical statistics , Probabilities , Graph theory , Mathematics , Probability Theory and Stochastic Processes , Probability and Statistics in Computer Science , Graph Theory , Coding and Information Theory , Computer Communication Networks
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:9783319394459:ONLINE Show nearby items on shelf
Title:Maths Meets Myths: Quantitative Approaches to Ancient Narratives
Author(s):
Date:2017
Size:1 online resource (X, 228 p. 64 illus., 47 illus. in color p.)
Contents:Preface -- Foreword -- Introduction -- Cognitive and Network Constraints in Real Life and Literature -- A Networks Approach to Mythological Epics -- Medieval Historical, Hagiographical and Biographical Networks -- Peopling of the New
World from data on distributions of folklore motifs -- Phylogenetics Meets Folklore: Bioinformatic Approaches to the Study of International Folktales -- Analyses of a VirtualWorld -- Ghostscope: Conceptual Mapping of Supernatural
Phenomena in a Large Folklore Corpus -- Complex Networks of Words in Fables -- Analysing and Restoring the Chronology of the Irish Annals -- Mapping Literate Networks in Early Medieval Ireland Quantitative Realities, Social
Mythologies? -- How quantitative methods can shed light on a problem of comparative mythology: The myth of the struggle for supremacy between two groups of deities reconsidered
ISBN:9783319394459
Series:eBooks
Series:Springer eBooks
Series:Springer 2017 package
Keywords: Physics , History , Medieval philosophy , Historical linguistics , Social sciences , Physics , Applications of Graph Theory and Complex Networks , History, general , Methodology of the Social Sciences , Historical Linguistics , Medieval Philosophy
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:1848216165:ONLINE Show nearby items on shelf
Title:Advanced Graph Theory and Combinatorics
Author(s): Rigo
Date:2016
Publisher:Wiley-ISTE
Size:1 online resource (291 p.)
ISBN:9781848216167
Series:eBooks
Series:Wiley Online Library
Series:Wiley 2016 package purchase
Keywords: Mathematics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:0471389250:ONLINE Show nearby items on shelf
Title:Graph Theory
Author(s): Merris
Date:2000
Publisher:Wiley-Interscience
Size:1 online resource (257 p.)
ISBN:9780471389255
Series:eBooks
Series:Wiley Online Library
Series:Wiley 2016 package purchase
Keywords: Mathematics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319392868:ONLINE Show nearby items on shelf
Title:Operator Algebras and Applications The Abel Symposium 2015
Author(s):
Date:2016
Size:1 online resource (2 p.)
Note:10.1007/978-3-319-39286-8
Contents:C*-tensor categories and subfactors for totally disconnected groups: Y. Arano and S. Vaes -- Decomposable approximations revisited: N.P. Brown, J.R. Carrión and S. White -- Exotic crossed products: A. Buss, S. Echterhoff, and R. Willett -- On Hong and Szymanski’s description of the primitive-ideal space of a graph algebra: T. M. Carlsen and A. Sims -- Commutator inequalities via Schur products: E. Christensen -- C*-algebras associated with algebraic actions: J. Cuntz -- A new look at C*-simplicit y and the unique trace property of a group: U. Haagerup -- Equilibrium states on graph algebras: A. an Huef and I. Raeburn -- Semigroup C_-algebras: X. Li -- Topological full groups of étale groupoids: H. Matui -- Towards a classification of compact quan tum groups of Lie type: S. Neshveyev and M. Yamashita -- A homology theory for Smale spaces: a summary: I.F. Putnam -- On the positive eigenvalues and eigenvectors of a non-negative matrix: K. Thomsen -- Classification of graph algebras: a
selective survey: M. Tomforde -- QDQ vs. UCT: W. Winter
ISBN:9783319392868
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Abel Symposia: 12
Keywords: Mathematics , K-theory , Dynamics , Ergodic theory , Functional analysis , Mathematical physics , Mathematics , Functional Analysis , Dynamical Systems and Ergodic Theory , K-Theory , Mathematical Physics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319338286:ONLINE Show nearby items on shelf
Title:Generalized Connectivity of Graphs
Author(s): Xueliang Li
Date:2016
Size:1 online resource (6 p.)
Note:10.1007/978-3-319-33828-6
Contents:1. Introduction -- 2. Results for some graph classes -- 3. Algorithm and complexity -- 4. Sharp bounds of the generalized (edge-) connectivity -- 5. Graphs with given generalized connectivity -- 6. Nordhaus-Gaddum-type results -- 7. Results for gra ph products -- 8. Maximum generalized local connectivity -- 9. Generalized connectivity for random graphs -- Bibliography.– Index.
ISBN:9783319338286
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Computer science , Operations research , Management science , Combinatorics , Graph theory , Mathematics , Graph Theory , Combinatorics , Discrete Mathematics in Computer Science , Operations Research, Management Science
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319319513:ONLINE Show nearby items on shelf
Title:Pancyclic and Bipancyclic Graphs
Author(s): John C George
Date:2016
Size:1 online resource (108 p.)
Note:10.1007/978-3-319-31951-3
Contents:1.Graphs -- 2. Degrees and Hamiltoneity -- 3. Pancyclicity -- 4. Minimal Pancyclicity -- 5. Uniquely Pancyclic Graphs -- 6. Bipancyclic Graphs -- 7. Uniquely Bipancyclic Graphs -- 8. Minimal Bipancyclicity -- References.
ISBN:9783319319513
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Numerical analysis , Combinatorics , Graph theory , Mathematics , Graph Theory , Combinatorics , Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319305189:ONLINE Show nearby items on shelf
Title:A Kaleidoscopic View of Graph Colorings
Author(s): Ping Zhang
Date:2016
Size:1 online resource (157 p.)
Note:10.1007/978-3-319-30518-9
Contents:1. Introduction -- 2. Binomial Edge Colorings -- 3. Kaleidoscopic Edge Colorings -- 4. Graceful Vertex Colorings -- 5.Harmonious Vertex Colorings -- 6. A Map Coloring Problem -- 7. Set Colorings -- 8. Multiset Colorings -- 9. Metric Colorings -- 10 . Sigma Colorings -- 11. Modular Colorings -- 12. A Banquet Seating Problem -- 13. Irregular Colorings -- 14. Recognizable Colorings -- References -- Index.
ISBN:9783319305189
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Applied mathematics , Engineering mathematics , Combinatorics , Graph theory , Mathematics , Graph Theory , Combinatorics , Applications of Mathematics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319304519:ONLINE Show nearby items on shelf
Title:Symmetries in Graphs, Maps, and Polytopes 5th SIGMAP Workshop, West Malvern, UK, July 2014
Author(s):
Date:2016
Edition:1st ed. 2016
Size:1 online resource (332 p.)
Note:10.1007/978-3-319-30451-9
ISBN:9783319304519
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Springer Proceedings in Mathematics & Statistics: 159
Keywords: Mathematics , Algebra , Field theory (Physics) , Topological groups , Lie groups , Graph theory , Mathematics , Graph Theory , Field Theory and Polynomials , Topological Groups, Lie Groups
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319281865:ONLINE Show nearby items on shelf
Title:Convexity and Discrete Geometry Including Graph Theory Mulhouse, France, September 2014
Author(s):
Date:2016
Size:1 online resource (39 p.)
Note:10.1007/978-3-319-28186-5
Contents:Introduction -- PART I Research Articles. Marcus: Tudor Zamfirescu: from convex to magic -- Yuan: Acute Triangulations of Rectangles, with Angles Bounded Below -- Skupien: Multi-compositions in exponential counting of hypohamiltonian snarks -- Shabb ir & T. Zamfirescu: Hamiltonicity in k-tree-Halin graphs -- Schneider: Reflections of planar convex bodies -- Rouyer: Steinhaus conditions for convex polyhedra -- Riviere: About the Hausdorff dimension of the set of endpoints of convex surfaces -- Prunesc u: About a surprising computer program of Matthias Müller -- Oliveros, Martinez & Montejano: Extremal results on intersection graphs of boxes in R^d -- Massé, Euler & Lemarchand: On the connected spanning cubic subgraph problem -- Kincses: On the Helly dimension of Hanner polytopes -- Itoh & Ohtsuka: Classification of normal 2-polyhedra of positive constant curvature -- Heppes & Jeronimo-Castro: T(4) families ofϕ-disjoint ovals -- Fruchard & Magazinov: Fair partitioning by straight lines --
Filip & Petrusel: Fixed point theorems for multivalued Zamfrescu operators in convex Kasahara spaces -- Et-Taoui: Complex conference matrices, complex Hadamard matrices and complex equiangular tight frames -- Chevallier, Fruchard & Vilcu: Envelopes of α-sections -- Bokowski & al.: Selected open and solved problems in computational synthetic geometry -- Bau: Reductions of 3-connected quadrangulations of the sphere -- Barany & Por: Paths on the sphere without small angles -- PART II Open Problem Note s. Zamfirescu T.: Two problems on cages for discs -- Zamfirescu Carol T.: Seven problems on hypohamiltonian and almost hypohamiltonian graphs -- Vilcu & Zamfirescu: Six problems on the length of the cut locus -- Simoes-Pereira: Existence Problems for Matr oidal Families -- Funar: Cubical Pachner moves -- Eckhoff: Problems in Discrete Geometry -- Chevallier & Fruchard: What is the minimal cardinal of a family which shatters all d-subsets of a finite set? -- Baskoro: Some open problems of Ramsey
minimal graphs.
ISBN:9783319281865
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Springer Proceedings in Mathematics & Statistics: 148
Keywords: Mathematics , Global analysis (Mathematics) , Manifolds (Mathematics) , Convex geometry , Discrete geometry , Combinatorics , Graph theory , Mathematics , Convex and Discrete Geometry , Graph Theory , Combinatorics , Global Analysis and Analysis on Manifolds
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319247113:ONLINE Show nearby items on shelf
Title:Dessins d'Enfants on Riemann Surfaces
Author(s): Gareth A Jones
Date:2016
Edition:1st ed. 2016
Size:1 online resource (259 p.)
Note:10.1007/978-3-319-24711-3
Contents:Historical and introductory background -- Graph embeddings -- Dessins and triangle groups -- Galois actions -- Quasiplatonic surfaces, and automorphisms -- Regular maps -- Regular embeddings of complete graphs -- Wilson operations -- Further exampl es -- Arithmetic aspects -- Beauville surfaces
ISBN:9783319247113
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Keywords: Mathematics , Algebraic geometry , Group theory , Functions of complex variables , Hyperbolic geometry , Mathematics , Algebraic Geometry , Group Theory and Generalizations , Functions of a Complex Variable , Several Complex Variables and Analytic Spaces , Hyperbolic Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319242989:ONLINE Show nearby items on shelf
Title:Recent Trends in Combinatorics
Author(s):
Date:2016
Size:1 online resource (14 p.)
Note:10.1007/978-3-319-24298-9
Contents:Section 1: Extremal and Probabilistic Combinatorics -- Problems Related to Graph Indices in Trees -- The edit distance in graphs: methods, results and generalizations -- Repetitions in graphs and sequences -- On Some Extremal Problems for Cycles in Graphs -- A survey of Turan problems for expansions -- Survey on matching, packing and Hamilton cycle problems on hypergraphs -- Rainbow Hamilton cycles in random graphs and hypergraphs -- Further applications of the Container Method -- Independent transv ersals and hypergraph matchings - an elementary approach -- Giant components in random graphs -- Infinite random graphs and properties of metrics -- Nordhaus-Gaddum Problems for Colin de Verdière Type Parameters, Variants of Tree-width, and Related Param eters -- Algebraic aspects of the normalized Laplacian -- Poset-free Families of Subsets.- Mathematics of causal sets -- Section 2: Additive and Analytic Combinatorics -- Lectures on Approximate groups and Hilbert's 5th Problem -- Character
sums and arithmetic combinatorics -- On sum-product problem -- Ajtai-Szemerédi Theorems over quasirandom groups -- Section 3: Enumerative and Geometric Combinatorics -- Moments of orthogonal polynomials and combinatorics -- The combinatorics of kno t invariants arising from the study of Macdonald polynomials -- Some algorithmic applications of partition functions in combinatorics -- Partition Analysis, Modular Functions, and Computer Algebra -- A survey of consecutive patterns in permutations -- Uni modality Problems in Ehrhart Theory -- Face enumeration on simplicial complexes -- Simplicial and Cellular Trees -- Parametric Polyhedra with at least k Lattice Points: Their Semigroup Structure and the k-Frobenius Problem.- Dynamical Algebraic Combinator ics and the Homomesy Phenomenon
ISBN:9783319242989
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:The IMA Volumes in Mathematics and its Applications: 159
Keywords: Mathematics , Dynamics , Ergodic theory , Functional analysis , Convex geometry , Discrete geometry , Combinatorics , Biomathematics , Mathematics , Combinatorics , Convex and Discrete Geometry , Dynamical Systems and Ergodic Theory , Functional Analysis , Genetics and Population Dynamics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2016-9783319161396:ONLINE Show nearby items on shelf
Title:Forging Connections between Computational Mathematics and Computational Geometry Papers from the 3rd International Conference on Computational Mathematics and Computational Geometry
Author(s):
Date:2016
Size:1 online resource (30 p.)
Note:10.1007/978-3-319-16139-6
Contents:Numerical Analysis of Reacting Flow in a Carbon Monoxide Boiler -- Some Efficient Schemes for Two-stage Gauss Method Ratnam Vigneswaran -- Effect of External Acceleration on the Flow Resistance in a Stenosed Catheterized Artery -- Matrix Induced by Change of Variables in a System of Polynomial Equations -- Varying Iteration Accuracy Using Inexact Conjugate Gradients in Control Problems Governed by Partial Differential Equations -- Dynamics of Hepatitis C Virus with Saturation Incidence Rate -- Some Groups with the Rapid Decay Property -- Köthe – Toeplitz Duals and Matrix Transformations of the Sequence Space bv(p) -- Quasi Class Q Operator -- Common Fixed Points of Two Finite Families of Quasicontractive Type Operators in Normed Spaces -- Simulta neous Test Procedures in Terms of p-value Copulae -- Determining the Long-run Equilibrium Price by the Mean Reversion Process and the Cobweb Model -- Application of Maximal Segmental Score in Genome-wide Association Studies When Raw Data is
Unavailable -- Comparison of the Generalized Least Squares F-Test for the Nested Error Regression Model -- Review of Asset Return Distribution and Its Application -- Sampling Moments of Resamples -- Designing Chain Sampling Plan (ChSP-1) under Lot Q uality Protection -- Minimum ATI ChSP – 4 (c1, c2) Plans -- On Compromise Mixed Allocation in Multivariate Stratified Sampling with Random Parameters -- Graphics Lipschitz-Killing Curvatures of the Excursion Sets of Skew Student-t Random Fields -- Optim ization of Power Transmission in Clustering Stochastic Networks As a Queuing System -- On the Total Closed Edge-Neighbourhood Graph of a Graph -- Combinatorial Cosmology? Time’s Arrow from a Graph Theorist’s Point of View
ISBN:9783319161396
Series:eBooks
Series:SpringerLink (Online service)
Series:Springer eBooks
Series:Springer Proceedings in Mathematics & Statistics: 124
Keywords: Statistics , Computer mathematics , Statistics , Statistical Theory and Methods , Statistics, general , Computational Mathematics and Numerical Analysis
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9783642405235:ONLINE Show nearby items on shelf
Title:An Introduction to Markov Processes [electronic resource]
Author(s): Daniel W Stroock
Date:2014
Edition:2nd ed. 2014
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:This book provides a rigorous but elementary introduction to the theory of Markov Processes on a countable state space. It should be accessible to students with a solid undergraduate background in mathematics, including studentsfrom engineering, econ omics, physics, and biology. Topics covered are: Doeblin's theory, general ergodic properties, and continuous time processes.Applications are dispersed throughout the book. In addition, a whole chapter isdevoted to reversible processes and the use of thei r associated Dirichlet forms to estimate the rate of convergence to equilibrium. These results are then applied to the analysis of the Metropolis (a.k.a simulated annealing) algorithm.The corrected and enlarged 2nd edition contains a new chapter in which the author develops computational methods for Markov chains on a finite state space. Most intriguing isthe section with a new technique for computing stationarymeasures, which is applied to derivations of Wilson's algorithm and Kirchoff's formula for span ning trees in a connected graph
Contents:Preface
Random Walks, a Good Place to Begin
Doeblin's Theory for Markov Chains
Stationary Probabilities
More about the Ergodic Theory of Markov Chains
Markov Processes in Continuous Time
Reversible Markov Processes
A minimal Introduction to Measure Theory
Notation
References
Index
ISBN:9783642405235
Series:eBooks
Series:SpringerLink
Series:Graduate Texts in Mathematics, 0072-5285 : v230
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Differentiable dynamical systems , Distribution (Probability theory)
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9783319079653:ONLINE Show nearby items on shelf
Title:Problems from the Discrete to the Continuous [electronic resource] : Probability, Number Theory, Graph Theory, and Combinatorics
Author(s): Ross G Pinsky
Date:2014
Publisher:Cham : Springer International Publishing : Imprint: Springer
Size:1 online resource
Note:The primary intent of the book is to introduce an array of beautiful problems in a variety of subjects quickly, pithily and completely rigorously to graduate students and advanced undergraduates. The book takes a number ofspecific problems and solves them, the needed tools developed along the way in the context of the particular problems. It treats a mlange of topics from combinatorial probability theory, number theory, random graph theory andcombinatorics. The problems in this book involve the asymp totic analysis of a discrete construct as some natural parameter of the system tends to infinity. Besides bridging discrete mathematics and mathematical analysis, the book makesa modest attempt at bridging disciplines. The problems were selected with an e ye toward accessibility to a wide audience, including advanced undergraduate students. The book could be used for a seminar course in which students presentthe lectures
Contents:Partitions With Restricted Summands or The Money Changing Problem
The Asymptotic Density of Relatively Prime Pairs and of Square
Free Numbers
A One
Dimensional Probabilistic Packing Problem
The Arcsine Laws for the One
Dimensional Simple Symmetric Random Walk
The Distribution of Cycles in Random Permutations
Chebyshev's Theorem on the Asymptotic Density of the Primes
Mertens' Theorems on the Asymptotic Behavior of the Primes
The Hardy
Ramanujan Theorem on the Number of Distinct Prime Divisors
The Largest Clique in a Random Graph and Applications to Tampering Detection
ISBN:9783319079653
Series:eBooks
Series:SpringerLink
Series:Universitext, 0172-5939
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Combinatorics , Number theory , Distribution (Probability theory)
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9783319054889:ONLINE Show nearby items on shelf
Title:Extended Abstracts Fall 2012 [electronic resource] : Automorphisms of Free Groups
Author(s): Juan Gonzlez-Meneses
Martin Lustig
Enric Ventura
Date:2014
Publisher:Cham : Springer International Publishing : Imprint: Birkhuser
Size:1 online resource
Note:This volume features seventeen extended conference abstracts corresponding to selected talks given by participants at the CRM research program Automorphisms of Free Groups: Algorithms, Geometry and Dynamics, which tookplace at the Centre de Recerca M atemtica in Barcelona in fall 2012. Most of them are short articles giving preliminary presentations of new results not yet published in regular research journals. The articles are the result from adirect collaboration among active researchers in the area after working in a dynamic and productive atmosphere. The book is intended for established researchers in the area of Group Theory, as well as for PhD and postdoc students whowish to learn more about the latest advances in this active area of research
Contents:Preface
Foreword
Yago Antoln: Tits alternatives for graph products
Goulnara Arzhantseva: Asymptotic approximations of finitely generated groups
Oleg Bogopolski and Olga Maslakova: An efficient algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group
Jos Burillo and Eric Lpez Platn: Metric properties and distortion in nilpotent groups
Jack Button, Maurice Chiodo, and Mariano Zeron
Medina Laris: Coset intersection graphs, and transversals as generating sets for finitely generated groups
Jordi Delgado: Whitehead problems for words i
ISBN:9783319054889
Series:eBooks
Series:SpringerLink
Series:Trends in Mathematics, 2297-0215 : v1
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Group theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9783319054469:ONLINE Show nearby items on shelf
Title:Perspectives in Computational Complexity [electronic resource] : The Somenath Biswas Anniversary Volume
Author(s): Manindra Agrawal
Vikraman Arvind
Date:2014
Publisher:Cham : Springer International Publishing : Imprint: Birkhuser
Size:1 online resource
Note:This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developmentsin this flourishing a rea of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphismconjecture, space-bounded computation, graph isomo rphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduatestudents and senior undergraduates in computer science and mathematics. It c an also be useful as a resource for teaching advanced level courses in computational complexity
Contents:Preface
1. Complexity Theory Basics: NP and NL (Vikraman Arvind)
2. Investigations Concerning the Structure of Complete Sets (Eric Allender)
3. Space Complexity of the Directed Reachability Problem Over Surface
embedded Graphs (N.V. Vinodchandran)
4. Algebraic Complexity Classes (Meena Mahajan)
5. A Selection of Lower Bound Results for Arithmetic Circuits (Neeraj Kayal and Ramprasad Saptharishi)
6. Explicit Tensors (Markus Blser)
7. Progress on Polynomial Identity Testing (Nitin Saxena)
8. Malod and the Pascaline (Bruno Poizat)
9. A Tutorial in Time and Space Bound
ISBN:9783319054469
Series:eBooks
Series:SpringerLink
Series:Progress in Computer Science and Applied Logic : v26
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science , Logic, Symbolic and mathematical
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9783319029498:ONLINE Show nearby items on shelf
Title:Mathematical Models and Numerical Simulation in Electromagnetism [electronic resource]
Author(s): Alfredo Bermdez
Dolores Gmez
Pilar Salgado
Date:2014
Publisher:Cham : Springer International Publishing : Imprint: Springer
Size:1 online resource
Note:The book represents a basic support for a master course in electromagnetism oriented to numerical simulation. The main goal of the book is that the reader knows the boundary-value problems of partial differential equations thatshould be solved in ord er to perform computer simulation of electromagnetic processes. Moreover it includes a part devoted to electric circuit theory based on ordinary differential equations. The book is mainly oriented to electricengineering applications, going from the genera l to the specific, namely, from the full Maxwells equations to the particular cases of electrostatics, direct current, magnetostatics and eddy currents models. Apart from standardexercises related to analytical calculus, the book includes some others orie nted to real-life applications solved with MaxFEM free simulation software
Contents:1 The harmonic oscillator
2 The Series RLC Circuit
3 Linear electrical circuits
4 Maxwells equations in free space
5 Some solutions of Maxwells equations in free space
6 Maxwells equations in material regions
7 Electrostatics
8 Direct current
9 Magnetostatics
10 The eddy currents model
11 An introduction to nonlinear magnetics. Hysteresis
12 Electrostatics with MaxFEM
13 Direct current with MaxFEM
14 Magnetostatics with MaxFEM
15 Eddy currents with MaxFEM
16 RLC circuits with MaxFEM
A Elements of graph theory
B Vector Calculus
C Fu
ISBN:9783319029498
Series:eBooks
Series:SpringerLink
Series:UNITEXT, 2038-5714 : v74
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science Mathematics , Magnetism , Computer engineering
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9783034808255:ONLINE Show nearby items on shelf
Title:Positional Games [electronic resource]
Author(s): Dan Hefetz
Michael Krivelevich
Milo Stojakovi
Tibor Szab
Date:2014
Publisher:Basel : Springer Basel : Imprint: Birkhuser
Size:1 online resource
Note:This textserves as a thorough introduction to the rapidly developing field of positional games. This area constitutes an important branch of combinatorics, whose aim it is to systematically develop an extensive mathematicalbasis for a variety of two- player perfect information games. These range from such popular games as Tic-Tac-Toe and Hex to purely abstract games played on graphs and hypergraphs. The subject of positional games is strongly related toseveral other branches of combinatorics such as R amsey theory, extremal graph and set theory, and the probabilistic method. These notes cover a variety of topics in positional games, including both classical results and recentimportant developments. They are presented in an accessible way and are accomp anied by exercises of varying difficulty, helping the reader to better understand the theory. The text will benefit both researchers and graduate students incombinatorics and adjacent fields
Contents:Preface
1 Introduction
2 Maker
Breaker Games
3 Biased Games
4 Avoider
Enforcer Games
5 The Connectivity Game
6 The Hamiltonicity Game
7 Fast and Strong
8 Random Boards
9 The Neighborhood Conjecture
Bibliography
ISBN:9783034808255
Series:eBooks
Series:SpringerLink
Series:Oberwolfach Seminars, 1661-237X : v44
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9781493909834:ONLINE Show nearby items on shelf
Title:Statistical Analysis of Network Data with R [electronic resource]
Author(s): Eric D Kolaczyk
Gbor Csrdi
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Networks have permeated everyday life through everyday realities like the Internet, social networks, and viral marketing. As such, network analysis is an important growth area in the quantitative sciences, with roots in socialnetwork analysis going b ack to the 1930s and graph theory going back centuries. Measurement and analysis are integral components of network research. As a result, statistical methods play a critical role in network analysis. This bookis the first of its kind in network research. It can be used as a stand-alone resource in which multiple R packages are used to illustrate how to conduct a wide range of network analyses, from basic manipulation and visualization, tosummary and characterization, to modeling of network data. The cent ral package is igraph, which provides extensive capabilities for studying network graphs in R. This text builds on Eric D. Kolaczyks book Statistical Analysis ofNetwork Data (Springer, 2009)
ISBN:9781493909834
Series:eBooks
Series:SpringerLink
Series:Use R!, 2197-5736 : v65
Series:Mathematics and Statistics (Springer-11649)
Keywords: Statistics , Mathematical statistics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9781493909254:ONLINE Show nearby items on shelf
Title:Commutative Algebra [electronic resource] : Recent Advances in Commutative Rings, Integer-Valued Polynomials, and Polynomial Functions
Author(s): Marco Fontana
Sophie Frisch
Sarah Glaz
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:This volume presents a multi-dimensional collection of articles highlighting recent developments in commutative algebra. It also includes an extensive bibliography and lists a substantial number of open problems that point tofuture directions of rese arch in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics andresearch methods include Noetherian and non- Noetheri an ring theory as well as integer-valued polynomials and functions. Specific topics include: Homological dimensions of Prfer-like rings Quasi complete rings Total graphs of rings Properties of prime ideals over various rings Bases for integer-valued p olynomials Boolean subrings The portable property of domains Probabilistic topics inIntn(D) Closure operations in Zariski-Riemann spaces of valuation domains Stability of domains Non-Noetherian grade Homotopy in integer-valued polynomials Localiza tions of global propertiesof rings Topics in integral closure Monoids and submonoids of domains The book includes twenty articles written by many of the most prominent researchers in the field. Most contributions are authored by attendees ofthe conferen ce in commutative algebra held at the Graz University of Technology in December 2012. There is also a small collection of invited articles authored by those who did not attend the conference. Following the model of the Grazconference, the volume contains a number of comprehensive survey articles along with related research articles featuring recent results that have not yet been published elsewhere
Contents:Preface
Weak global dimension of Prfer
like rings (K. Adarbeh, S
E. Kabbaj)
Quasi
complete semilocal rings and modules (D.D. Anderson)
On the total graph of a ring and its related graphs: A survey (A. Badawi)
Prime ideals in polynomials and power series rings over Noetherian domains
Integer
valued polynomials: Looking for regular bases (J
L. Chabert)
On Boolean subrings of rings (I. Chajda, G. Eigenthaler)
On a new class of integral domains with the portable property (D.E. Dobbs, G. Picavet, M. Picavet
L'Hermitte)
The probability that Intn(D) is free (J. Elliott
ISBN:9781493909254
Series:eBooks
Series:SpringerLink
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Algebra , Algebraic topology
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9781493907489:ONLINE Show nearby items on shelf
Title:The Compressed Word Problem for Groups [electronic resource]
Author(s): Markus Lohrey
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:The Compressed Word Problem for Groups provides a detailed exposition of known results on the compressed word problem, emphasizing efficient algorithms for the compressed word problem in various groups.The authorpresents thenecessary background along with the most recent results on the compressed word problem to create a cohesive self-contained book accessible to computer scientists as well as mathematicians. Readers will quickly reach the frontierofcurrent research which makes the book especially ap pealing for students looking for a currently active research topic at theintersection of group theory and computer science. The word problem introduced in 1910 by Max Dehnisone of the most important decision problems in group theory. For many groups, high ly efficient algorithms for the word problem exist. In recent years, a new technique based on data compression for providing more efficient algorithmsfor word problems, has been developed, by representing long words over group generators in a compressed f orm using a straight-line program. Algorithmic techniques used for manipulating compressed words has shown that the compressedword problem can be solved in polynomial time for a large class of groups such as free groups, graph groups and nilpotent groups. These results have important implications for algorithmic questions related to automorphism groups
Contents:1. Preliminaries from Theoretical Computer Science
2. Preliminaries from Combinatorial Group Theory
3. Algorithms on Compressed Words
4. The Compressed Word Problem
5. The Compressed Word Problem in Graph Products
6. The Compressed Word Problem in HNN
Extensions
7.Outlook
References
Index
ISBN:9781493907489
Series:eBooks
Series:SpringerLink
Series:SpringerBriefs in Mathematics, 2191-8198
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Group theory , Topological Groups , Global analysis (Mathematics)
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9781493907427:ONLINE Show nearby items on shelf
Title:Clusters, Orders, and Trees: Methods and Applications [electronic resource] : In Honor of Boris Mirkin's 70th Birthday
Author(s): Fuad Aleskerov
Boris Goldengorin
Panos M Pardalos
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkins ground breaking contributions in various fields of decision making anddata analysis have marke d the fourth quarter of the 20th century and beyond.Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hiddenstructuresfirst of all, clusters, orderings, and hier archiesin multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted inMirkin's fundamental contribution to thestate-of-the-art in group choice, ordering, clustering, data mining, and knowledge disc overy. Researchers, students, and software engineers will benefit from new knowledge discovery techniques and application directions
Contents:Three and One Questions to Dr. B. Mirkin about Complexity Statistics (I. Mandel)
Section 1
A Polynomial Algorithm for a Class of 0
1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering (P. Hansen, C. Meyer)
Experiments with a Non
Convex Variance
Based Clustering Criterion (R.F. Toso, E.V. Bauman, C.A. Kulikowski, I.B. Muchnik)
Strategy
Proof Location Functions on Finite Graphs (F.R. McMorris, H.M. Mulder, F.S. Roberts)
A Pseudo
Boolean Approach to the Market Graph Analysis by Means of the p
Median Model (B. Goldengorin, A. Ko
ISBN:9781493907427
Series:eBooks
Series:SpringerLink
Series:Springer Optimization and Its Applications, 1931-6828 : v92
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computational complexity , Electronic data processing
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9781493903054:ONLINE Show nearby items on shelf
Title:Covering Walks in Graphs [electronic resource]
Author(s): Futaba Fujie
Ping Zhang
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:CoveringWalks in Graphs is aimed at researchers and graduate students in the graph theory community and provides a comprehensive treatment on measures of two well studied graphical properties, namely Hamiltonicity andtraversability in graphs. This te xt looks into the famous Knigsberg Bridge Problem, the Chinese Postman Problem, the Icosian Game and the Traveling Salesman Problem as well as well-known mathematicians who were involved in theseproblems. The concepts of different spanning walks with exam ples and present classical results on Hamiltonian numbers and upper Hamiltonian numbers of graphs are described in some cases, the authorsprovide proofs of these results toillustrate the beauty and complexity of this area of research. Two new concepts of traceable numbers of graphs and traceable numbers of vertices of a graph which were inspired by and closely related to Hamiltonian numbers areintroduced. Results are illustrated on these two concepts and the relationship between traceable concepts and Ham iltonian concepts are examined. Describes several variations of traceable numbers, which provide new frame works forseveral well-known Hamiltonian concepts and produce interesting new results
Contents:1. Eulerian Walks
2. Hamiltonian Walks
3. Traceable Walks
References
Index.
ISBN:9781493903054
Series:eBooks
Series:SpringerLink
Series:SpringerBriefs in Mathematics, 2191-8198
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2014-9781461489573:ONLINE Show nearby items on shelf
Title:Topics in Matroid Theory [electronic resource]
Author(s): Leonidas S Pitsoulis
Date:2014
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Topics in Matroid Theory provides a brief introduction to matroid theory with an emphasis on algorithmic consequences.Matroid theory is at the heart of combinatorial optimization and has attracted various pioneers such as Edmonds,Tutte, Cunningham an d Lawler among others. Matroid theory encompasses matrices, graphs and other combinatorial entities under a common, solid algebraicframework, thereby providing the analytical tools to solve related difficultalgorithmic problems. The monograph contains a r igorousaxiomatic definition of matroids along with other necessary concepts such as duality, minors, connectivity and representability asdemonstrated in matrices, graphs andtransversals. The author also presents a deep decomposition result in matroid theo ry that providesa structural characterization of graphic matroids, and show how this can be extended to signed-graphic matroids, as well as theimmediatealgorithmic consequences.
Contents:1.Introduction
2.Graph Theory, Vector Spaces and Transversals
3.Definition of Matroids
4.Representability, Duality, Minors, and Connectivity
5. Decomposition of Graphic Matroids
6.Signed
Graphic Matroids
List of Symbols
Index
ISBN:9781461489573
Series:eBooks
Series:SpringerLink
Series:SpringerBriefs in Optimization, 2190-8354
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Algorithms , Combinatorics , Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9788132210535:ONLINE Show nearby items on shelf
Title:Combinatorial Matrix Theory and Generalized Inverses of Matrices [electronic resource]
Author(s): Ravindra B Bapat
Steve J Kirkland
K. Manjunatha Prasad
Simo Puntanen
Date:2013
Publisher:India : Springer India : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book consists of eighteen articles in the area of `Combinatorial Matrix Theory' and `Generalized Inverses of Matrices'. Original research and expository articles presented in this publication are written by leadingMathematicians and Statistician s working in these areas. The articles contained herein are on the following general topics: `matrices in graph theory', `generalized inverses of matrices', `matrix methods in statistics' and `magicsquares'. In the area of matrices and graphs, speci_c top ics addressed in this volume include energy of graphs, q-analog, immanants of matrices and graph realization of product of adjacency matrices. Topics in the book from `MatrixMethods in Statistics' are, for example, the analysis of BLUE via eigenvalues of covariance matrix, copulas, error orthogonal model, and orthogonal projectors in the linear regression models. Moore-Penrose inverse of perturbedoperators, reverse order law in the case of inde_nite inner product space, approximation numbers, condition nu mbers, idempotent matrices, semiring of nonnegative matrices, regular matrices over incline and partial order of matrices arethe topics addressed under the area of theory of generalized inverses. In addition to the above traditional topics and a report on CMTGIM 2012 as an appendix, we have an article on old magic squares from India
Note:Springer eBooks
Contents:Skew Spectrum of the Cartesian Product of an Oriented Graph with an Oriented Hypercube
Notes on Explicit Block Diagonalization
The Third Immanant of q
Laplacian Matrices of Trees and Laplacians of Regular Graphs
Matrix Product of Graphs
Determinant of the Laplacian Matrix of Weighted Directed Graphs
From Multivariate Skewed Distributions to Copulas
Revisiting the BLUE in a Linear Model via Proper Eigenvectors
Inference in Error Orthogonal Models
On the Entries of Orthogonal Projection Matrices
Moore
Penrose Inverse of Perturbed Operators on Hilbert Spaces
The Rev
ISBN:9788132210535
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Matrix theory , Mathematical statistics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9783642381898:ONLINE Show nearby items on shelf
Title:Facets of Combinatorial Optimization [electronic resource] : Festschrift for Martin Grtschel
Author(s): Michael Jnger
Gerhard Reinelt
Date:2013
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Martin Grtschel is one of the most influential mathematicians of our time. He has received numerous honors and holds a number of key positions in the international mathematical community. He celebrated his 65th birthday onSeptember 10, 2013. Martin G rtschels doctoral descendant tree 19832012, i.e., the first 30 years, features 39 children, 74 grandchildren, 24 great-grandchildren, and 2 great-great-grandchildren, a total of 139 doctoraldescendants. This book starts with a personal tribute to Martin G rtschel by the editors (Part I), a contribution by his very special predecessor Manfred Padberg on Facets and Rank of Integer Polyhedra (Part II), and thedoctoral descendant tree 19832012 (Part III). The core of this book (Part IV) contains 16 contributio ns, each of which is coauthored by at least one doctoral descendant. The sequence of the articles starts with contributions tothe theory of mathematical optimization, including polyhedral combinatorics, extended formulations, mixed-integer convex optimiza tion, superclasses of perfect graphs, efficient algorithms for subtree-telecenters, junctions in acyclicgraphs, and preemptive restricted strip covering, as well as efficient approximation of non-preemptive restricted strip covering. Combinations of new t heoretical insights with algorithms and experiments deal with network designproblems, combinatorial optimization problems with submodular objective functions, and more general mixed-integer nonlinear optimization problems. Applications include VLSI layout design, systems biology, wireless network design,mean-risk optimization, and gas network optimization. Computational studies include a semidefinite branch and cut approach for the max k-cut problem, mixed-integer nonlinear optimal control, and mixed-inte ger linear optimization forscheduling and routing of fly-in safari planes. The two closing articles are devoted to computational advances in general mixed-integer li
Note:Springer eBooks
Contents:Martin Grtschel
a tribute: M.Jnger and G.Reinelt
Facets and rank of integer polyhedra:M.Padberg
Constructing extended formulations from reflection relations:V.Kaibel and K.Pashkovich
Exact algorithms for combinatorial optimization problems with submodular objective functions: F.Baumann, S.Berckey, and C.Buchheim
Solving k
way graph partitioning problems to optimality: The impact of semidefinite relaxations and the bundle method: M.F. Anjos, B.Ghaddar, L.Hupp, F.Liers and A.Wiegele
Mirror
descent methods in mixed
integer convex optimization: M.Baes, T.Oertel, Ch.Wagner
ISBN:9783642381898
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computational complexity , Algorithms , Mathematical optimization
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9783642365867:ONLINE Show nearby items on shelf
Title:Complex and Adaptive Dynamical Systems [electronic resource] : A Primer
Author(s): Claudius Gros
Date:2013
Edition:3rd ed. 2013
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Complex system theory is rapidly developing and gaining importance, providing tools and concepts central to our modern understanding of emergent phenomena. This primer offers an introduction to this area together with detailedcoverage of the mathemat ics involved. All calculations are presented step by step and are straightforward to follow. This new third edition comes with new material, figures and exercises. Network theory, dynamical systems andinformation theory, the core of modern complex system sciences, are developed in the first three chapters, covering basic concepts and phenomena like small-world networks, bifurcation theory and information entropy. Further chaptersuse a modular approach to address the most important concepts in complex syst em sciences, with the emergence and self-organization playing a central role. Prominent examples are self-organized criticality in adaptive systems, life atthe edge of chaos, hypercycles and coevolutionary avalanches, synchronization phenomena, absorbing phase transitions and the cognitive system approach to the brain. Technical course prerequisites are the standard mathematical tools foran advanced undergraduate course in the natural sciences or engineering. Each chapter comes with exercises and suggesti ons for further reading - solutions to the exercises are provided in the last chapter. From the reviews of previouseditions: This is a very interesting introductory book written for a broad audience of graduate students in natural sciences and engineering . It can be equally well used both for teaching and self-education. Very well structured andevery topic is illustrated by simple and motivating examples. This is a true guidebook to the world of complex nonlinear phenomena. (Ilya Pavlyukevich, Zentralblat t MATH, Vol. 1146, 2008) Claudius Gros's Complex and AdaptiveDynamical Systems: A Primer is a welcome addition to the literature. . A particular strength of the book is its emphasis on analytical techn
Note:Springer eBooks
Contents:About this book
Graph Theory and Small
World Networks
Chaos, Bifurcations and Diffusion
Random Boolean Networks
Cellular Automata and Self
Organized Criticality
Statistical Modeling of Darwinian Evolution
Synchronization Phenomena
Elements of Cognitive System Theory
Solutions
Index
ISBN:9783642365867
Series:e-books
Series:SpringerLink (Online service)
Series:Physics and Astronomy (Springer-11651)
Keywords: Engineering
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9783642344534:ONLINE Show nearby items on shelf
Title:Diagram Geometry [electronic resource] : Related to Classical Groups and Buildings
Author(s): Francis Buekenhout
Arjeh M Cohen
Date:2013
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book provides a self-contained introduction to diagram geometry. Tight connections with group theory are shown. It treats thin geometries (related to Coxeter groups) and thick buildings from a diagrammatic perspective.Projective and affine geome try are main examples. Polar geometry is motivated by polarities on diagram geometries and the complete classification of those polar geometries whose projective planes are Desarguesian is given. It differsfrom Tits' comprehensive treatment in that it use s Veldkamp's embeddings. The book intends to be a basic reference for those who study diagram geometry. Group theorists will find examples of the use of diagram geometry. Light onmatroid theory is shed from the point of view of geometry with linear diagra ms. Those interested in Coxeter groups and those interested in buildings will find brief but self-contained introductions into these topics from thediagrammatic perspective. Graph theorists will find many highly regular graphs. The text is written so grad uate students will be able to follow the arguments without needing recourse to further literature. A strong point of the bookis the density of examples.
Note:Springer eBooks
Contents:1. Geometries
2. Diagrams
3. Chamber Systems
4. Thin Geometries
5. Linear Geometries
6. Projective and Affine Spaces
7. Polar Spaces
8. Projective Embeddings of Polar Spaces
9. Embedding Polar Spaces in Absolutes
10. Classical Polar Spaces
11. Buildings
Bibliography
Index
ISBN:9783642344534
Series:e-books
Series:SpringerLink (Online service)
Series:Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics, 0071-1136 : v57
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9783642322785:ONLINE Show nearby items on shelf
Title:Graphs, Networks and Algorithms [electronic resource]
Author(s): Dieter Jungnickel
Date:2013
Edition:4th ed. 2013
Publisher:Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:From the reviews of the previous editions .... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, andresearchers in this area. The aut hor finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does notremain helpless solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ... K.Engel, Mathematical Reviews 2002 The substantial developmenteffort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation,comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate orlow-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to ex ercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons,Zentralblatt fr Mathematik2005 Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-comp leteness (especially on dominating sets), a section on the Gallai-Edmondsstructure theory for matchings, and about a dozen additional exercises as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the moregeneral Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added
Note:Springer eBooks
Contents:Prefaces
Basic Graph Theory
Algorithms and Complexity
Shortest Paths
Spanning Trees
The Greedy Algorithm
Flows
Combinatorial Applications
Connectivity and Depth First Search
Colorings
Circulations
The Network Simplex Algorithm
Synthesis of Networks
Matchings
Weighted Matchings
A Hard Problem: The TSP
Appendix A: Some NP
Complete Problems
Appendix B: Solutions
Appendix C: List of Symbols
References
Index
ISBN:9783642322785
Series:e-books
Series:SpringerLink (Online service)
Series:Algorithms and Computation in Mathematics, 1431-1550 : v5
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer science , Combinatorics , Mathematical optimization
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9783034805971:ONLINE Show nearby items on shelf
Title:Problem-Solving Methods in Combinatorics [electronic resource] : An Approach to Olympiad Problems
Author(s): Pablo Sobern
Date:2013
Publisher:Basel : Springer Basel : Imprint: Birkhuser
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Every year there is at least one combinatorics problem in each of the major international mathematical olympiads. These problems can only be solvedwith a very high level of wit and creativity. This book explains all theproblem-solving techniques nece ssary to tacklethese problems, with clear examples from recent contests.It also includesa large problem section for each topic, including hints and full solutions so that the reader can practice thematerial covered in the book. The material will be useful not only to participants in the olympiads and their coaches but also in university courses on combinatorics
Note:Springer eBooks
Contents:Introduction
1 First concepts
2 The pigeonhole principle
3 Invariants
4 Graph theory
5 Functions
6 Generating Functions
7 Partitions
8 Hints for the problems
9 Solutions to the problems
Notation
Further reading
Index
ISBN:9783034805971
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9783034804783:ONLINE Show nearby items on shelf
Title:Functional Analysis in Asymmetric Normed Spaces [electronic resource]
Author(s): tefan Cobza
Date:2013
Publisher:Basel : Springer Basel : Imprint: Birkhuser
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:An asymmetric norm is a positive definite sublinear functional p on a real vector space X. The topology generated by the asymmetric norm p is translation invariant so that the addition is continuous, but the asymmetry of the normimplies that the mult iplication by scalars is continuous only when restricted to non-negative entries in the first argument. The asymmetric dual of X, meaning the set of all real-valued upper semi-continuous linear functionals on X, ismerely a convex cone in the vector space of all linear functionals on X. In spite of these differences, many results from classical functional analysis have their counterparts in the asymmetric case, by taking care of the interplaybetween the asymmetric norm p and its conjugate. Among the positi ve results one can mention: HahnBanach type theorems and separation results for convex sets, KreinMilman type theorems, analogs of the fundamental principles open mapping, closed graph and uniform boundedness theorems an analog of the Schauders theorem o n the compactness of the conjugate mapping. Applications are given to best approximation problems and, as relevant examples, oneconsiders normed lattices equipped with asymmetric norms and spaces of semi-Lipschitz functions on quasi-metric spaces. Since t he basic topological tools come from quasi-metric spaces and quasi-uniform spaces, the first chapter of thebook contains a detailed presentation of some basic results from the theory of these spaces. The focus is on results which are most used in function al analysis completeness, compactness and Baire category which drasticallydiffer from those in metric or uniform spaces. The book is fairly self-contained, the prerequisites being the acquaintance with the basic results in topology and functional analys is, so it may be used for an introduction to thesubject.Since new results, in the focus of current research, are also included, researchers in the area can use it as a reference
Note:Springer eBooks
Contents:Introduction
1. Quasi
metric and Quasi
uniform Spaces. 1.1. Topological properties of quasi
metric and quasi
uniform spaces
1.2. Completeness and compactness in quasi
metric and quasi
uniform spaces
2. Asymmetric Functional Analysis
2.1. Continuous linear operators between asymmetric normed spaces
2.2. Hahn
Banach type theorems and the separation of convex sets
2.3. The fundamental principles
2.4. Weak topologies
2.5. Applications to best approximation
2.6. Spaces of semi
Lipschitz functions
Bibliography
Index
ISBN:9783034804783
Series:e-books
Series:SpringerLink (Online service)
Series:Frontiers in Mathematics, 1660-8046
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Functional analysis , Operator theory , Topology
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461486992:ONLINE Show nearby items on shelf
Title:Geodesic Convexity in Graphs [electronic resource]
Author(s): Ignacio M Pelayo
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Geodesic Convexity in Graphsis devoted to the study of the geodesic convexity on finite, simple, connected graphs. The first chapter includes the main definitions and results on graph theory, metric graph theory and graph pathconvexities. The followi ng chapters focus exclusively on the geodesic convexity, including motivation and background, specific definitions, discussion and examples, results, proofs, exercises and open problems. The main and most studied parameters involving geodesic convexity in graphs are both the geodetic and the hull number which are defined as the cardinality of minimum geodetic and hull set, respectively. This text reviews various results, obtained duringthe last one and a half decade, relating these two invariants and some others such as convexity number, Steiner number, geodetic iteration number, Helly number, and Caratheodory number to a wide range a contexts, including products,boundary-type vertex sets, and perfect graph families. This monograph can serve as a suppleme nt to a half-semester graduatecourse in geodesic convexitybut is primarilya guide for postgraduates and researchers interested in topicsrelated to metric graph theory and graph convexity theory.
Note:Springer eBooks
ISBN:9781461486992
Series:e-books
Series:SpringerLink (Online service)
Series:SpringerBriefs in Mathematics, 2191-8198
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Differential equations, partial , Global differential geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461485292:ONLINE Show nearby items on shelf
Title:Mathematics in the Real World [electronic resource]
Author(s): W.D Wallis
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Birkhuser
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Mathematics in the Real World is a self-contained, accessible introduction to the world of mathematics for non-technical majors. With a focus on everyday applications and context, the topics in this textbook build in difficultyand are presented seque ntially, starting with a brief review of sets and numbers followed by an introduction to elementary statistics, models, and graph theory. Data and identification numbers are then covered, providing the pathwayto voting and finance. Each subject is covered in a concise and clear fashion through the use of real-world applications and the introduction of relevant terminology. Many sample problems both writing exercises and multiple-choicequestions are included to help develop students level of understandin g and to offer a variety of options to instructors. Covering six major units and outlining a one-semester course, Mathematics in the Real World is aimed atundergraduate liberal art students fulfilling the mathematics requirement in their degree program. T his introductory text will be an excellent resource for such courses, and will show students where mathematics arises in their everydaylives
Note:Springer eBooks
Contents:Preface
Part IIntroduction
Math is Everywhere
Numbers and Sets
Counting
Part IIStatistical Ideas
Collecting Data
Measuring Data
Normal
Sampling, Predicting
Multivariate Situations
Probability
Part IIIGraph Models
Euler
Hamilton
Trees
Scheduling, Critical Paths
Coloring, Handshakes
Part IVData
Identification Numbers
Data Transmission
Encryption The Hat Game
Part V Voting
Voting Systems
Messing with Systems
Electing a President
Part VI The Exponential World
Finance
Populations and Radioactivity.
ISBN:9781461485292
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461472544:ONLINE Show nearby items on shelf
Title:The Mathematics of Paul Erds II [electronic resource]
Author(s): Ronald L Graham
Jaroslav Neetil
Steve Butler
Date:2013
Edition:2nd ed. 2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This is the most comprehensive survey of the mathematical life of the legendary Paul Erds (1913-1996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erds'research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles aswell as key articles that survey some of the cornerst ones of Erds' work, each written by a leading world specialist in the field. A special chapter Early Days, rare photographs, and art related to Erds complement this strikingcollection. A unique contribution is the bibliography on Erds' publications: the m ost comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erds' birth, contains updates on many of the articlesfrom the two volumes of the first edition, several new articles from prominent mathematicians, a new introd uction, and more biographical information about Paul Erds with an updated list of publications. The second volume containschapters on graph theory and combinatorics, extremal and Ramsey theory, and a section on infinity that covers Erds' research on set t heory. All of these chapters are essentially updated, particularly the extremal theory chapter thatcontains a survey of flag algebras, a new technique for solving extremal problems
Note:Springer eBooks
Contents:VOLUME II
Part I Combinatorics and Graph Theory
Introduction
Reconstruction Problems for Digraphs
Neighborly Families of Boxes and Bipartite Coverings
On the Isolation of a Common Secret
Properties of Graded Posets Preserved by Some Operations
The Dimension of Random Graph Orders
Hereditary and Monotone Properties of Graphs
Cycles and Paths in Triangle
Free Graphs
Problems in Graph Theory from Memphis
Some Remarks on the Cycle Plus Triangles Problem
Intersection Representations of the Complete Bipartite Graph
Reflections on a Problem of Erds and Hajnal
ISBN:9781461472544
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Combinatorics , Logic, Symbolic and mathematical
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461469988:ONLINE Show nearby items on shelf
Title:Algebraic Combinatorics [electronic resource] : Walks, Trees, Tableaux, and More
Author(s): Richard P Stanley
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the authors extensiveknowledge of combinatori cs and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfoundknowledge to mathematical, engineering, and bus iness models. The text is primarily intended for use in a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory.Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and rudiments of group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints toselected exercises. Key topics include walks on graphs, cubes and the Radon transform, the MatrixTree Th eorem, de Bruijn sequences, the Erds-Moser conjecture, electrical networks, and the Sperner property. There are also threeappendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and t he enumeration of labeled trees. Richard Stanley is currently professor of Applied Mathematics atthe Massachusetts Institute of Technology. Stanley has received several awards including the George Plya Prize in applied combinatorics, the Guggenheim Fello wship, and the Leroy P. Steele Prize for mathematical exposition. Also bythe author: Combinatorics and Commutative Algebra, Second Edition, Birkhuser
Note:Springer eBooks
Contents:Preface
Notation
1. Walks in graphs
2. Cubes and the Radon transform
3. Random walks
4. The Sperner property
5. Group actions on boolean algebras
6. Young diagrams and q
binomial coefficients
7. Enumeration under group action
8. A glimpse of Young tableaux
Appendix. The RSK algorithm
Appendix. Plane partitions
9. The MatrixTree Theorem
Appendix. Three elegant combinatorial proofs
10. Eulerian diagraphs and oriented trees
11. Cycles, bonds, and electrical networks
12. Miscellaneous gems of algebraic combinatorics
Hints
References
ISBN:9781461469988
Series:e-books
Series:SpringerLink (Online service)
Series:Undergraduate Texts in Mathematics, 0172-6056
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Combinatorics
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461469711:ONLINE Show nearby items on shelf
Title:Graphs on Surfaces [electronic resource] : Dualities, Polynomials, and Knots
Author(s): Joanna A Ellis-Monaghan
Iain Moffatt
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Graphs on Surfaces: Dualities, Polynomials, and Knots offers an accessible and comprehensive treatment of recent developments on generalized duals of graphs on surfaces, and their applications. The authors illustrate theinterdependency between dualit y, medial graphs and knots how this interdependency is reflected in algebraic invariants of graphs and knots and how it can be exploited to solve problems in graph and knot theory. Taking aconstructive approach, the authors emphasize how generalized duals and related ideas arise by localizing classical constructions, such as geometric duals and Tait graphs, and then removing artificial restrictions in these constructionsto obtain full extensions of them to embedded graphs. The authors demonstrate the bene fits of these generalizations to embedded graphs in chapters describing their applications to graph polynomials and knots. Graphs on Surfaces:Dualities, Polynomials, and Knots also provides a self-contained introduction to graphs on surfaces, generalized duals, topological graph polynomials, and knot polynomials that is accessible both to graph theorists and to knottheorists. Directed at those with some familiarity with basic graph theory and knot theory, this book is appropriate for graduate students an d researchers in either area. Because the area is advancing so rapidly, the authors give acomprehensive overview of the topic and include a robust bibliography, aiming to provide the reader with the necessary foundations to stay abreast of the field. The reader will come away from the text convinced of advantages ofconsidering these higher genus analogues of constructions of plane and abstract graphs, and with a good understanding of how they arise
Note:Springer eBooks
Contents:1. Embedded Graphs
2. Generalised Dualities
3. Twisted duality, cycle family graphs, and embedded graph equivalence
4. Interactions with Graph Polynomials
5. Applications to Knot Theory
References
Index
ISBN:9781461469711
Series:e-books
Series:SpringerLink (Online service)
Series:SpringerBriefs in Mathematics, 2191-8198
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Topology , Algebraic topology
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461465256:ONLINE Show nearby items on shelf
Title:Total Domination in Graphs [electronic resource]
Author(s): Michael A Henning
Anders Yeo
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Total Domination in Graphs gives a clear understanding of this topic to any interested reader who has a modest background in graph theory. This book provides and explores the fundamentals of total domination in graphs. Some ofthe topics featured incl ude the interplay between total domination in graphs and transversals in hypergraphs, and the association with total domination in graphs and diameter-2-critical graphs. Several proofs are included in this textwhich enables readers to acquaint themselves with a toolbox of proof techniques and ideas with which to attack open problems in the field. This work is an excellent resource for students interested in beginning their research in thisfield. Additionally, established researchers will find the book val uable to have as it contains the latest developments and open problems
Note:Springer eBooks
Contents:1. Introduction
2. Properties of Total Dominating Sets and General Bounds
3. Complexity and Algorithmic Results
4.Total Domination in Trees
5.Total Domination and Minimum Degree
6. Total Domination in Planar Graphs
7. Total Domination and Forbidden Cycles
8. Relating the Size and Total Domination Number
9. Total Domination in Claw
Free Graphs
10. Total Domination Number versus Matching Number
11. Total Domination Critical Graphs
12. Total Domination and Graph Products
13. Graphs with Disjoint Total Dominating Sets
14. Total Domination in Graphs with Diame
ISBN:9781461465256
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Monographs in Mathematics, 1439-7382
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Global analysis (Mathematics) , Number theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461464068:ONLINE Show nearby items on shelf
Title:Asymptotic Geometric Analysis [electronic resource] : Proceedings of the Fall 2010 Fields Institute Thematic Program
Author(s): Monika Ludwig
Vitali D Milman
Vladimir Pestov
Nicole Tomczak-Jaegermann
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Asymptotic Geometric Analysis is concerned with the geometric and linear properties of finite dimensional objects, normed spaces, and convex bodies, especially with the asymptotics of their various quantitative parameters as thedimension tends to inf inity. The deep geometric, probabilistic, and combinatorial methods developed here are used outside the field in many areas of mathematics and mathematical sciences. The Fields Institute Thematic Program in theFall of 2010 continued an established traditi on of previous large-scale programs devoted to the same general research direction. The main directions of the program included: * Asymptotic theory of convexity and normed spaces *Concentration of measure and isoperimetric inequalities, optimal transport ation approach * Applications of the concept of concentration * Connections with transformation groups and Ramsey theory * Geometrization of probability * Randommatrices * Connection with asymptotic combinatorics and complexity theory These directions are represented in this volume and reflect the present state of this important area of research. It will be of benefit to researchers working ina wide range of mathematical sciencesin particular functional analysis, combinatorics, convex geometry, dynamical systems, operator algebras, and computer science
Note:Springer eBooks
Contents:Preface
The Variance Conjecture on Some Polytopes (D. Alonso Gutirrez, J. Bastero)
More Universal Minimal Flows of Groups of Automorphisms of Uncountable Structures (D. Bartosova)
On the Lyapounov Exponents of Schrodinger Operators Associated with the Standard Map (J. Bourgain)
Overgroups of the Automorphism Group of the Rado Graph (P. Cameron, C. Laflamme, M. Pouzet, S. Tarzi, R. Woodrow)
On a Stability Property of the Generalized Spherical Radon Transform (D. Faifman)
Banach Representations and Affine Compactification of Dynamical Systems (E. Glasner, M. Megrelishvili)
F
ISBN:9781461464068
Series:e-books
Series:SpringerLink (Online service)
Series:Fields Institute Communications, 1069-5265 : v68
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Topological Groups , Functional analysis , Operator theory , Discrete groups , Distribution (Probability theory)
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461463368:ONLINE Show nearby items on shelf
Title:Quantum Walks and Search Algorithms [electronic resource]
Author(s): Renato Portugal
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classicalrandom walks. It is known that quantum computers have great power for searching unsorted databases. This power extends to many kinds of searches, particularly to the problem of finding a specific location in a spatial layout, which canbe modeled by a graph. The goal is to fi nd a specific node knowing that the particle uses the edges to jump from one node to the next. This book is self-contained with main topics that include: Grover's algorithm, describing itsgeometrical interpretation and evolution by means of the spectral d ecomposition of the evolution operater Analytical solutions of quantum walks on important graphs like line, cycles, two-dimensional lattices, and hypercubes usingFourier transforms Quantum walks on generic graphs, describing methods to calculate the limit ing distribution and mixing time Spatial search algorithms, with emphasis on the abstract search algorithm (the two-dimensional lattice isused as an example) Szedgedy's quantum-walk model and a natural definition of quantum hitting time (the complete grap h is used as an example) The reader will benefit from the pedagogical aspects of the book, learning faster and withmore ease than would be possible from the primary research literature. Exercises and references further deepen the reader's understanding, a nd guidelines for the use of computer programs to simulate the evolution of quantum walks arealso provided
Note:Springer eBooks
Contents:Introduction
The Postulates of Quantum Mechanics
Introduction to Quantum Walks
Grover's Algorithm and its Generalization
Quantum Walks on Infinite Graphs
Quantum Walks on Finite Graphs
Limiting Distribution and Mixing Time
Spatial Algorithms
Hitting Time
Appendix: Linear Algebra for Quantum Computation
ISBN:9781461463368
Series:e-books
Series:SpringerLink (Online service)
Series:Quantum Science and Technology
Series:Physics and Astronomy (Springer-11651)
Keywords: Information theory , Quantum theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461452423:ONLINE Show nearby items on shelf
Title:Connected Dominating Set: Theory and Applications [electronic resource]
Author(s): Ding-Zhu Du
Peng-Jun Wan
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:The connected dominating set (CDS)has been a classic subject studied in graph theory since 1975. It has been discovered inrecent years thatCDS has important applications in communication networks especially in wirelessnetworks as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. Thiswork isa valuable reference for researchers in computer s cience and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, industrial engineering, anddiscrete mathematics. The book may also be used as a text in a graduate seminar fo r PhD students. Readers should have a basic knowledge of computational complexity and combinatorial optimization. In this book, the authors present thestate-of-the-art in the study of connected dominating sets. Each chapter is devoted to one problem, and consists of three parts: motivation and overview, problem complexity analysis, and approximation algorithm designs. The text isdesigned togive the reader a clear understanding of thebackground, formulation, existing important research results, and open pr oblems. Topics include minimum CDS, routing-cost constrained CDS, weighted CDS, directed CDS, SCDS(strongly connected dominating set), WCDS (weakly connected dominating set), CDS-partition, virtual backbone in wireless networks, convertor placement in opt ical networks, coverage in wireless sensor networks, and more
Note:Springer eBooks
ISBN:9781461452423
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Optimization and Its Applications, 1931-6828 : v77
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Computer Communication Networks , Computer software , Combinatorics , Mathematical optimization
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461451280:ONLINE Show nearby items on shelf
Title:Distance Geometry [electronic resource] : Theory, Methods, and Applications
Author(s): Antonio Mucherino
Carlile Lavor
Leo Liberti
Nelson Maculan
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Distance Geometry:Theory, Methods, and Applications is the first collection of research surveys dedicated to distance geometry and its applications. The first part of the book discusses theoretical aspects of the DistanceGeometry Problem (DGP), where the relation between DGP and other related subjects are also presented. Covered topics include distance matrix theory, Euclidean distance matrix completion, multispherical structure of distance matrices,geometric algebra, algebraic distance geometry theo ry, visualization of K-dimensional structures in the plane, graph rigidity, and theory of discretizable DGP. The second part of this volume presents mathematical and computationalproperties of methods developed to the problems discussed in the first porti on, including continuous methods (based on Gaussian and hyperbolic smoothing, difference of convex functions, semidefinite programming, branch-and-bound),discrete methods (based on branch-and-prune, geometric build-up, graph rigidity), and also heuristics methods (based on simulated annealing, genetic algorithms, tabu search, variable neighborhood search). Applications comprise thethird part of the book, which is mainly devoted to the application of DGP to NMR structure calculation. This is an important a nd strongly multidisciplinary application in biology and biomedicine
Note:Springer eBooks
Contents:Preface
1. Universal Rigidity of Bar Frameworks in General Position (A. Alfakih)
2. Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs (I. Emiris, E. Tsigaridas, A. Varvitsiotis)
3. (The discretizable molecular distance Geometry Problem Seems Easier on Proteins (L. Liberti, C. Lavor, A. Mucherino)
4. Spheres Unions and Intersections and Some of Their Applications in Molecular Modeling (M. Petitjean)
5. Is the Distance Geometry Problem in NP? (N. Beeker, S. Gaubert, C. Glusa, L. Liberti)
6. Solving Spatial Constraints with Generaliz
ISBN:9781461451280
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Visualization , Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461445654:ONLINE Show nearby items on shelf
Title:Recent Advances in Harmonic Analysis and Applications [electronic resource] : In Honor of Konstantin Oskolkov
Author(s): Dmitriy Bilyk
Laura De Carli
Alexander Petukhov
Alexander M Stokolos
Brett D Wick
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:Recent Advances in Harmonic Analysis and Applications is dedicated to the 65th birthday ofKonstantin Oskolkov and features contributions from analysts around the world. The volume contains expository articles by leadingexperts in their fields, as we ll asselected high quality research papers that explorenew results and trends in classical and computational harmonic analysis, approximation theory, combinatorics, convex analysis, differentialequations, functional analysis, Fourier analysis, graph theor y, orthogonal polynomials, special functions, and trigonometric series. Numerous articles in the volume emphasize remarkable connections between harmonic analysis andother seemingly unrelated areas of mathematics, such as the interaction between abstract problems in additive number theory, Fourier analysis, and experimentally discovered optical phenomena in physics. Survey and research articlesprovide an up-to-date account of various vital directions of modern analysis and will in particularbeof interest to young researchers who are just starting their career. This book will also be useful to experts in analysis,discrete mathematics, physics, signal processing, and other areas of science
Note:Springer eBooks
ISBN:9781461445654
Series:e-books
Series:SpringerLink (Online service)
Series:Springer Proceedings in Mathematics & Statistics, 2194-1009 : v25
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Global analysis (Mathematics) , Harmonic analysis , Differential equations, partial , Algorithms , Number theory
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Cover
Image
Call number:SPRINGER-2013-9781461401100:ONLINE Show nearby items on shelf
Title:Thirty Essays on Geometric Graph Theory [electronic resource]
Author(s): Jnos Pach
Date:2013
Publisher:New York, NY : Springer New York : Imprint: Springer
Size:1 online resource
Note:Springer e-book platform
Note:Springer 2013 e-book collections
Note:In many applications of graph theory, graphs are regarded as geometric objects drawn in the plane or in some other surface. The traditional methods of abstract graph theory are often incapable of providing satisfactoryanswers to questions arising in such applications. In the past couple of decades, many powerful new combinatorial and topological techniques have been developed to tackle these problems. Today geometric graph theory is a burgeoningfield with many striking results and appealing open ques tions. This contributed volume contains thirty original survey and research papers on important recent developments in geometric graph theory. The contributions were thoroughlyreviewed and written by excellent researchers in this field
Note:Springer eBooks
Contents:Introduction
1) B. brego
S. Fernndez
Merchant
G. Salazar: The rectilinear crossing number of K_n: closing in (or are we?)
2) E. Ackerman: The maximum number of tangencies among convex regions with a triangle
free intersection graph
3) G. Aloupis
B. Ballinger
S. Collette
S. Langerman
A. Pr
D.R.Wood: Blocking coloured point sets
4) M. Al
Jubeh
G. Barequet
M. Ishaque
D. Souvaine
Cs. D. Tth
A. Winslow: Constrained tri
connected planar straight line graphs
5) S. Buzaglo
R. Pinchasi
G. Rote: Topological hypergraphs
6) J. Cano Vila
L. F. Barba
ISBN:9781461401100
Series:e-books
Series:SpringerLink (Online service)
Series:Mathematics and Statistics (Springer-11649)
Keywords: Mathematics , Combinatorics , Geometry
Availability:Click here to see Library holdings or inquire at Circ Desk (x3401)
Click to reserve this book Be sure to include your ID please.
More info:Amazon.com
More info: Barnes and Noble
Full Text:Click here
Location: ONLINE

Return to the Fermilab Library catalog