Дискретная математика
Математика
  • формат djvu
  • размер 6.03 МБ
  • добавлен 04 октября 2011 г.
No J.-S., Song H.-E., Helleset T., Kumar P.V. (eds.) Mathematical Properties of Sequences and other Combinatorial Structures
Издательство Kluwer, 2003, -133 pp.
This proceedings is for the most part, a collection of papers presented in the three-day onference, held in Los Angeles, May 30 - June 1,2002, celebrating the 70th bIrthday of Professor Solomon W. Golomb. All contributions to the proceedings were peer-reviewed. Reflecting the interests of Professor Golomb, the major topics include sequences and combinatorial structures and range in treatment from pure theory" to application-oriented", from a short and concise presentation of results to a more comprehensive tutorial treatment. .
Introduction.
pairs of m-Sequences.
with a six-Valued crosscorrelation.
permutation polynomials tuscan-k Arrays and costas sequences.
periods of piecewise-Linear recurrences.
trace representation of hall'S sextic residue sequences of period p?7 (mod 8).
Array correlation and sequences with equal magnitude correlation.
singly periodic costas arrays are equivalent to.
polygonal path vatican squares.
survey on costas arrays and their generalizations.
on p-Ary bent functions defined on fin1te fields.
distribution of r-Pattes in the highest level of p-Adic.
expansion of some linear recursion sequences over galois rings.
on edit distance ati'Ack to alteating step generator.
polyomino number theory (ll).
Achievement games for polyominoes on archimedean tessellations.
what'S new in polyomino puzzles and their design.
euler sums revisited.
hardy-Littlewood constants.
on the parity of permutation.
on the connections between rsa cryptosystem and the fibonacci numbers.
removing autocorrelation sidelobes by overlaying.
orthogonal coding on any train of identical pulses.
irreducibles of tetranomial type.
a method of deterministically generating block substitution tables which meet a given standard of nonlinearity.
tilings with generalized lee spheres.
on the connections between rsa cryptosystem and the fibonacci numbers.
removing autocorrelation sidelobes by overlaying orthogonal coding on any train of identical pulses.
an analytic cache performance model.
pn signal acquisition and convolution via the characters of the additive group.
golomb' S reminiscences.
Похожие разделы
Смотрите также

Berge C. Principles of Combinatorics

  • формат pdf
  • размер 2 МБ
  • добавлен 23 июля 2011 г.
Acаdemic Prеss, 1971. - 176 pages. Most mathematicians of this day, confronted with an argument requiring combinatorial thinking, react with one of two stock phrases: (a) This is a purely combinatorial argument, (b) This is a difficult combinatorial argument. Hypnotic repetition of either of these slogans is likely to have the same balming effect on the speaker: freed from all scruples, he will pass the buck and unload the work onto someone else...

Bollob?s B. (ed.) Surveys in Combinatorics

  • формат pdf
  • размер 1.57 МБ
  • добавлен 04 октября 2011 г.
Издательство Cambridge University Press, 1979, -270 pp. Proceedings of the 7th British Combinatorial Conference. Since its inception at Oxford in 1969 the British Combinatorial Conference has become a regular feature of the international mathematical calendar. This year the seventh conference will be held in Cambridge from 13th to 17th August, under the auspices of the Department of Pure Mathematics and Mathematical Statistics. The participants...

Brualdi R.A. Introductory Combinatorics

  • формат djvu
  • размер 3.74 МБ
  • добавлен 22 марта 2011 г.
Prentice Hall, 2004. - 640 pages. This book emphasizes combinatorial ideas including the pigeon-hole principle, counting techniques, permutations and combinations, Polya counting, binomial coefficients, inclusion-exclusion principle, generating functions and recurrence relations, and combinatortial structures (matchings, designs, graphs). The volume provides a complete examination of combinatorial ideas and techniques. For individuals interested...

Grimaldi R.P. Discrete and Combinatorial Mathematics: An Applied Introduction

  • формат djvu
  • размер 15.28 МБ
  • добавлен 27 января 2011 г.
Addison-Wesley, 1994. - 1026 pages. Provides an introductory survey in both discrete & combinatorial mathematics. Intended for the beginning student designed to introduce a wide variety of applications & develop mathematical maturity of the student by studying an area that is so different form the traditional coverage in calculus & different equations. rn

Gyori E., Katona G.O., Lovasz L. (editors) More Sets, Graphs and Numbers: A Salute to Vera Sos and Andras Hajnal

  • формат pdf
  • размер 12.65 МБ
  • добавлен 05 февраля 2011 г.
Springer, 2006. - 405 pages. Bolyai Society Mathematical Studies 15. Discrete mathematics, including (combinatorial) number theory and set theory has always been a stronghold of Hungarian mathematics. The present volume honouring Vera Sos and Andras Hajnal contains survey articles (with classical theorems and state-of-the-art results) and cutting edge expository research papers with new theorems and proofs in the area of the classical Hungarian...

Malik D.S., Sen M.K. Discrete Mathematical Structures: Theory and Applications

  • формат djvu
  • размер 13.2 МБ
  • добавлен 20 марта 2011 г.
Course Technology Inc, 2004. - 906 pages. Discrete Mathematical Structures teaches students the mathematical foundations of computer science, including logic, Boolean algebra, basic graph theory, finite state machines, grammars, and algorithms. This required class for Computer Science students helps them understand mathematical reasoning for reading, comprehension, and construction of mathematical arguments.

Moon J.W. Counting Labelled Trees

  • формат djvu
  • размер 678.04 КБ
  • добавлен 28 октября 2011 г.
Canadian Mathematical Monographs, 1970, -121 pp. My object has been to gather together various combinatorial results on labelled trees. The basic definitions are given in the first chapter; enumerative results are presented in the next five chapters, classified according to the type of argument involved; some probabilistic problems on random trees are treated in the last chapter. Some familiarity with matrices and generating functions is presupp...

Rosen K.H. Discrete Mathematics and Its Applications

  • формат pdf
  • размер 34.36 МБ
  • добавлен 23 марта 2011 г.
China Machine Press, 1999. - 700 pages. A discrete mathematics course has more than one purpose. Students should learn a particular set of mathematical facts and how to apply them; more importantly, such a course should teach students how to think mathematically. To achieve these goals, this text stresses mathematical reasoning and the different ways problems and solved. Five important themes are interwoven in this text: mathematical reasoning,...

Rosen K.H., Michaels J.G. et al. Handbook of Discrete and Combinatorial Mathematics

  • формат djvu
  • размер 8.11 МБ
  • добавлен 31 января 2012 г.
Crc press, 2000. - 1183 pages. The Handbook of Discrete and Combinatorial Mathematics is the first book presenting a comprehensive collection of reference material for the essential areas of discrete mathematics as well as for important applications to computer science and engineering. Topics include logic and foundations, counting, number theory, abstract and linear algebra, probability, graph theory, networks and optimization, cryptography and...

Ryser H.J. Combinatorial Mathematics

  • формат djvu
  • размер 1.18 МБ
  • добавлен 04 октября 2011 г.
Издательство John Wiley, 1963, -162 pp. This monograph requires no prior knowledge of combinatorial mathematics. In Chapter 1 we deal with the elementary properties of sets and define permutation, combination, and binomial coefficient. Of course we treat these concepts from a mature point of view, and from the outset we assume an appreciation for the subtleties of mathematical reasoning. Combinatorial mathematics is best studied within the frame...