Search

This book features selected papers from the 5th International Conference on Mathematics and Computing (ICMC 2019), organized by the School of Computer Engineering, Kalinga Institute of Industrial Technology Bhubaneswar, India, on February 6 – 9, 2019. Covering recent advances in the field of mathematics, statistics and scientific computing, the book presents innovative work by leading academics, researchers and experts from industry.

The two-volume set LNCS 8269 and 8270 constitutes the refereed proceedings of the 19th International Conference on the Theory and Application of Cryptology and Information, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The 54 revised full papers presented were carefully selected from 269 submissions. They are organized in topical sections named: zero-knowledge, algebraic cryptography, theoretical cryptography, protocols, symmetric key cryptanalysis, symmetric key cryptology: schemes and analysis, side-channel cryptanalysis, message authentication codes, signatures, cryptography based upon physical assumptions, multi-party computation, cryptographic primitives, analysis, cryptanalysis and passwords, leakage-resilient cryptography, two-party computation, hash functions.

The two-volume set LNCS 8269 and 8270 constitutes the refereed proceedings of the 19th International Conference on the Theory and Application of Cryptology and Information, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The 54 revised full papers presented were carefully selected from 269 submissions. They are organized in topical sections named: zero-knowledge, algebraic cryptography, theoretical cryptography, protocols, symmetric key cryptanalysis, symmetric key cryptology: schemes and analysis, side-channel cryptanalysis, message authentication codes, signatures, cryptography based upon physical assumptions, multi-party computation, cryptographic primitives, analysis, cryptanalysis and passwords, leakage-resilient cryptography, two-party computation, hash functions.

This book constitutes the refereed proceedings of the Second International Workshop on Experimental and Efficient Algorithms, WEA 2003, held in Ascona, Switzerland in May 2003. The 19 revised full papers presented together with 3 invited contributions were carefully reviewed and selected from 40 submissions. The focus of the volume is on applications of efficient algorithms for combinatorial problems.

This book is written in a style that uncovers the mathematical theories hidden in our daily lives, using examples of patterns that appear in nature, arts, traditional crafts, as well as mathematical mechanics in architectural techniques. The authors believe that through conversations between students and mathematicians, readers may learn about the methods used by the originators of these theories―their trials, errors, and triumphs―in reaching their various conclusions. The goal is to help readers refine their mathematical sense in terms of formulating valuable questions and pursuing them. In addition, the book aims to provide enjoyment in the application of mathematical principles to beautiful art and design by using examples that highlight the wonders and mysteries of these works found in our daily lives. To achieve these goals, the book tackles the latest exquisite results on polygons and polyhedra and the dynamic history of geometric research found around us. The term'intuitive geometry'was coined by Lászlo Fejes Tóth and refers to the kind of geometry which, in Hilbert's words, can be explained to and appeal to the'man on the street.'This book enables readers to enjoy intuitive geometry informally and instinctively. It does not require more than a high school level of knowledge but calls for a sense of wonder, intuition, and mathematical maturity. In this second edition, many new results, and elegant proofs on a variety of topics have been added, enhancing the book's rich content even further.

This book is devoted to the study of multivariate discrete q-distributions, which is greatly facilitated by existing multivariate q-sequences and q-functions. Classical multivariate discrete distributions are defined on a sequence of independent and identically distributed Bernoulli trials, with either being a success of a certain rank (level) or a failure. The author relaxes the assumption that the probability of success of a trial is constant by assuming that it varies geometrically with the number of trials and/or the number of successes. The latter is advantageous in the sense that it permits incorporating the experience gained from the previous trials and/or successes, which leads to multivariate discrete q-distributions. Furthermore, q-multinomial and negative q-multinomial formulae are obtained. Next, the book addresses q-multinomial and negative q-multinomial distributions of the first and second kind. The author also examines multiple q-Polya urn model, multivariate q-Polya and inverse q-Polya distributions. Presents definitions and theorems that highlight key concepts and worked examples to illustrate the various applicationsContains numerous exercises at varying levels of difficulty that consolidate the presented concepts and resultsIncludes hints and answers to all exercises via the appendix and is supplemented with an Instructor's Solution Manual

This book systematically establishes the almost periodic theory of dynamic equations and presents applications on time scales in fuzzy mathematics and uncertainty theory. The authors introduce a new division of fuzzy vectors depending on a determinant algorithm and develop a theory of almost periodic fuzzy multidimensional dynamic systems on time scales. Several applications are studied; in particular, a new type of fuzzy dynamic systems called fuzzy q-dynamic systems (i.e. fuzzy quantum dynamic systems) is presented. The results are not only effective on classical fuzzy dynamic systems, including their continuous and discrete situations, but are also valid for other fuzzy multidimensional dynamic systems on various hybrid domains. In an effort to achieve more accurate analysis in real world applications, the authors propose a number of uncertain factors in the theory. As such, fuzzy dynamical models, interval-valued functions, differential equations, fuzzy-valued differential equations, and their applications to dynamic equations on time scales are considered.

The book presents the proceedings of the 23rd International Conference on Difference Equations and Applications, ICDEA 2017, held at the West University of Timișoara, Romania, under the auspices of the International Society of Difference Equations (ISDE), July 24 - 28, 2017. It includes new and significant contributions in the field of difference equations, discrete dynamical systems and their applications in various sciences. Disseminating recent studies and related results and promoting advances, the book appeals to PhD students, researchers, educators and practitioners in the field.

This text is an introduction to harmonic analysis on symmetric spaces, focusing on advanced topics such as higher rank spaces, positive definite matrix space and generalizations. It is intended for beginning graduate students in mathematics or researchers in physics or engineering. As with the introductory book entitled'Harmonic Analysis on Symmetric Spaces - Euclidean Space, the Sphere, and the Poincaré Upper Half Plane, the style is informal with an emphasis on motivation, concrete examples, history, and applications. The symmetric spaces considered here are quotients X=G/K, where G is a non-compact real Lie group, such as the general linear group GL(n,P) of all n x n non-singular real matrices, and K=O(n), the maximal compact subgroup of orthogonal matrices. Other examples are Siegel's upper half'plane'and the quaternionic upper half'plane'. In the case of the general linear group, one can identify X with the space Pn of n x n positive definite symmetric matrices.Manycorrections and updates have been incorporated in this new edition. Updates include discussions of random matrix theory and quantum chaos, as well as recent research on modular forms and their corresponding L-functions in higher rank. Many applications have been added, such as the solution of the heat equation on Pn, the central limit theorem of Donald St. P. Richards for Pn, results on densest lattice packing of spheres in Euclidean space, and GL(n)-analogs of the Weyl law for eigenvalues of the Laplacian in plane domains. Topics featured throughout the text include inversion formulas for Fourier transforms, central limit theorems, fundamental domains in X for discrete groups Γ (such as the modular group GL(n,Z) of n x n matrices with integer entries and determinant ±1), connections with the problem of finding densest lattice packings of spheres in Euclidean space, automorphic forms, Hecke operators, L-functions, and the Selberg trace formula and its applications in spectral theory as well as number theory.

This is the first work on Discrepancy Theory to show the present variety of points of view and applications covering the areas Classical and Geometric Discrepancy Theory, Combinatorial Discrepancy Theory and Applications and Constructions. It consists of several chapters, written by experts in their respective fields and focusing on the different aspects of the theory.Discrepancy theory concerns the problem of replacing a continuous object with a discrete sampling and is currently located at the crossroads of number theory, combinatorics, Fourier analysis, algorithms and complexity, probability theory and numerical analysis. This book presents an invitation to researchers and students to explore the different methods and is meant to motivate interdisciplinary research.

When elementary courses in discrete and combinatorial mathematics first became popular, they usually covered a broad spectrumofpure and applied topics. Most of the students were in Mathematics and Computer Science, with a handful ofbrave souls from other disciplines. Those other students usually found the courses quite difficult. However, the applications were useful in a numberofareas. The teaching of discrete topics has evolved into two streams. The more math­ ematical parts are studied in courses called Discrete Mathematics, and more ad­ vanced, more rigorous courses called Combinatorics, or named for specific areas (Graph Theory, Combinatorial Designs, Cryptography, and so on). Introductions to those areas of applicable discrete mathematics used by students in business, management and the social sciences are usually called Finite Mathematics, and e1ementary courses on this material are now standard at many colleges and uni­ versities.These courses are typically offered at the freshman level although many students take them later in their careers.

{\it Elements of Operatory Theory} is aimed at graduate students as well as a new generation of mathematicians and scientists who need to apply operator theory to their field. Written in a user-friendly, motivating style, fundamental topics are presented in a systematic fashion, i.e., set theory, algebraic structures, topological structures, Banach spaces, Hilbert spaces, culminating with the Spectral Theorem, one of the landmarks in the theory of operators on Hilbert spaces. The exposition is concept-driven and as much as possible avoids the formula-computational approach. Key features of this largely self-contained work include: • required background material to each chapter • fully rigorous proofs, over 300 of them, are specially tailored to the presentation and some are new • more than 100 examples and, in several cases, interesting counterexamples that demonstrate the frontiers of an important theorem • over 300 problems, many with hints • both problems and examples underscore further auxiliary results and extensions of the main theory; in this non-traditional framework, the reader is challenged and has a chance to prove the principal theorems anew This work is an excellent text for the classroom as well as a self-study resource for researchers. Prerequisites include an introduction to analysis and to functions of a complex variable, which most first-year graduate students in mathematics, engineering, or another formal science have already acquired. Measure theory and integration theory are required only for the last section of the final chapter.

These are the proceedings of the conference'Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics'held at the Department of Mathematics, University of Florida, Gainesville, from November 11 to 13, 1999. The main emphasis of the conference was Com­ puter Algebra (i. e. symbolic computation) and how it related to the fields of Number Theory, Special Functions, Physics and Combinatorics. A subject that is common to all of these fields is q-series. We brought together those who do symbolic computation with q-series and those who need q-series in­ cluding workers in Physics and Combinatorics. The goal of the conference was to inform mathematicians and physicists who use q-series of the latest developments in the field of q-series and especially how symbolic computa­ tion has aided these developments. Over 60 people were invited to participate in the conference. We ended up having 45 participants at the conference, including six one hour plenary speakers and 28 half hour speakers. There were talks in all the areas we were hoping for. There were three software demonstrations.

The book aims at surveying results in the application of fuzzy sets and fuzzy logic to economics and engineering. New results include fuzzy non-linear regression, fully fuzzified linear programming, fuzzy multi-period control, fuzzy network analysis, each using an evolutionary algorithm; fuzzy queuing decision analysis using possibility theory; fuzzy differential equations; fuzzy difference equations; fuzzy partial differential equations; fuzzy eigenvalues based on an evolutionary algorithm; fuzzy hierarchical analysis using an evolutionary algorithm; fuzzy integral equations. Other important topics covered are fuzzy input-output analysis; fuzzy mathematics of finance; fuzzy PERT (project evaluation and review technique). No previous knowledge of fuzzy sets is needed. The mathematical background is assumed to be elementary calculus.

Magic labelings Magic squares are among the more popular mathematical recreations. Their origins are lost in antiquity; over the years, a number of generalizations have been proposed. In the early 1960s, Sedlacek asked whether'magic'ideas could be applied to graphs. Shortly afterward, Kotzig and Rosa formulated the study of graph label­ ings, or valuations as they were first called. A labeling is a mapping whose domain is some set of graph elements - the set of vertices, for example, or the set of all vertices and edges - whose range was a set of positive integers. Various restrictions can be placed on the mapping. The case that we shall find most interesting is where the domain is the set of all vertices and edges of the graph, and the range consists of positive integers from 1 up to the number of vertices and edges. No repetitions are allowed. In particular, one can ask whether the set of labels associated with any edge - the label on the edge itself, and those on its endpoints - always add up to the same sum. Kotzig and Rosa called such a labeling, and the graph possessing it, magic. To avoid confusion with the ideas of Sedlacek and the many possible variations, we would call it an edge-magic total labeling.

Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key role in a variety of research areas, such as combinatorial optimization, approximation algorithms, computational complexity, graph theory, geometry, real algebraic geometry and quantum computing. This book is an introduction to selected aspects of semidefinite programming and its use in approximation algorithms. It covers the basics but also a significant amount of recent and more advanced material. There are many computational problems, such as MAXCUT, for which one cannot reasonably expect to obtain an exact solution efficiently, and in such case, one has to settle for approximate solutions. For MAXCUT and its relatives, exciting recent results suggest that semidefinite programming is probably the ultimate tool. Indeed, assuming the Unique Games Conjecture, a plausible but as yet unproven hypothesis, it was shown that for these problems, known algorithms based on semidefinite programming deliver the best possible approximation ratios among all polynomial-time algorithms. This book follows the “semidefinite side” of these developments, presenting some of the main ideas behind approximation algorithms based on semidefinite programming. It develops the basic theory of semidefinite programming, presents one of the known efficient algorithms in detail, and describes the principles of some others. It also includes applications, focusing on approximation algorithms.

This second edition of A Beginner's Guide to Finite Mathematics: For Business, Management, and the Social Sciences takes a distinctly applied approach to finite mathematics at the freshman and sophomore level. Topics are presented sequentially: the book opens with a brief review of sets and numbers, followed by an introduction to data sets, histograms, means and medians. Counting techniques and the Binomial Theorem are covered, which provide the foundation for elementary probability theory; this, in turn, leads to basic statistics. This new edition includes chapters on game theory and financial mathematics.Requiring little mathematical background beyond high school algebra, the text will be especially useful for business and liberal arts majors for study in the classroom or for self-study. Its straightforward treatment of the essential concepts in finite mathematics will appeal to a wide audience of students and teachers.

One of the major concerns of theoretical computer science is the classifi­ cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.

This is the second volume in a series of innovative proceedings entirely devoted to the connections between mathematics and computer science. Here mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep and innovative mathematical approaches. The book serves as an outstanding tool and a main information source for a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. It provides an overview of the current questions in computer science and the related modern and powerful mathematical methods. The range of applications is very wide and reaches beyond computer science.

This IMA Volume in Mathematics and its Applications ALGORITHMS FOR PARALLEL PROCESSING is based on the proceedings of a workshop that was an integral part of the 1996-97 IMA program on'MATHEMATICS IN HIGH-PERFORMANCE COMPUTING.'The workshop brought together algorithm developers from theory, combinatorics, and scientific computing. The topics ranged over models, linear algebra, sorting, randomization, and graph algorithms and their analysis. We thank Michael T. Heath of University of lllinois at Urbana (Com­ puter Science), Abhiram Ranade of the Indian Institute of Technology (Computer Science and Engineering), and Robert S. Schreiber of Hewlett­ Packard Laboratories for their excellent work in organizing the workshop and editing the proceedings. We also take this opportunity to thank the National Science Founda­ tion (NSF) and the Army Research Office (ARO), whose financial support made the workshop possible. A vner Friedman Robert Gulliver v PREFACE The Workshop on Algorithms for Parallel Processing was held at the IMA September 16 - 20, 1996; it was the first workshop of the IMA year dedicated to the mathematics of high performance computing. The work­ shop organizers were Abhiram Ranade of The Indian Institute of Tech­ nology, Bombay, Michael Heath of the University of Illinois, and Robert Schreiber of Hewlett Packard Laboratories. Our idea was to bring together researchers who do innovative, exciting, parallel algorithms research on a wide range of topics, and by sharing insights, problems, tools, and methods to learn something of value from one another.

Selected Areas in Cryptography brings together in one place important contributions and up-to-date research results in this fast moving area. Selected Areas in Cryptography serves as an excellent reference, providing insight into some of the most challenging research issues in the field.

Sequential Dynamical Systems (SDS) are a class of discrete dynamical systems which significantly generalize many aspects of systems such as cellular automata, and provide a framework for studying dynamical processes over graphs. This text is the first to provide a comprehensive introduction to SDS. Driven by numerous examples and thought-provoking problems, the presentation offers good foundational material on finite discrete dynamical systems which leads systematically to an introduction of SDS. Techniques from combinatorics, algebra and graph theory are used to study a broad range of topics, including reversibility, the structure of fixed points and periodic orbits, equivalence, morphisms and reduction. Unlike other books that concentrate on determining the structure of various networks, this book investigates the dynamics over these networks by focusing on how the underlying graph structure influences the properties of the associated dynamical system. This book is aimed at graduate students and researchers in discrete mathematics, dynamical systems theory, theoretical computer science, and systems engineering who are interested in analysis and modeling of network dynamics as well as their computer simulations. Prerequisites include knowledge of calculus and basic discrete mathematics. Some computer experience and familiarity with elementary differential equations and dynamical systems are helpful but not necessary.

This second volume of a comprehensive tour through mathematical core subjects for computer scientists completes the?rst volume in two - gards: Part III?rst adds topology, di?erential, and integral calculus to the t- ics of sets, graphs, algebra, formal logic, machines, and linear geometry, of volume 1. With this spectrum of fundamentals in mathematical e- cation, young professionals should be able to successfully attack more involved subjects, which may be relevant to the computational sciences. In a second regard, the end of part III and part IV add a selection of more advanced topics. In view of the overwhelming variety of mathematical approaches in the computational sciences, any selection, even the most empirical, requires a methodological justi?cation. Our primary criterion has been the search for harmonization and optimization of thematic - versity and logical coherence. This is why we have, for instance, bundled such seemingly distant subjects as recursive constructions, ordinary d- ferential equations, and fractals under the unifying perspective of c- traction theory.

At the Summer School Saint Petersburg 2001, the main lecture courses bore on recent progress in asymptotic representation theory: those written up for this volume deal with the theory of representations of infinite symmetric groups, and groups of infinite matrices over finite fields; Riemann-Hilbert problem techniques applied to the study of spectra of random matrices and asymptotics of Young diagrams with Plancherel measure; the corresponding central limit theorems; the combinatorics of modular curves and random trees with application to QFT; free probability and random matrices, and Hecke algebras.