- 5 Ergebnisse
Kleinster Preis: € 67,40, größter Preis: € 186,48, Mittelwert: € 102,09
1
Combinatorics Advances - Charles J. Colbourn; Ebdollah Sayed Mahmoodian
Bestellen
bei Springer.com
€ 67,40
Versand: € 0,001
Bestellengesponserter Link
Charles J. Colbourn; Ebdollah Sayed Mahmoodian:

Combinatorics Advances - neues Buch

ISBN: 9781461335542

On March 28~31, 1994 (Farvardin 8~11, 1373 by Iranian calendar), the Twenty­ fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Is… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten. (EUR 0.00)
2
Combinatorics Advances - 50-99.99
Bestellen
bei ebooks.com
€ 89,00
Bestellengesponserter Link

50-99.99:

Combinatorics Advances - neues Buch

ISBN: 9781461335542

On March 28~31, 1994 (Farvardin 8~11, 1373 by Iranian calendar), the Twenty­ fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Is… Mehr…

new in stock. Versandkosten:zzgl. Versandkosten.
3
Combinatorics Advances
Bestellen
bei Springer.com
€ 85,59
Versand: € 0,001
Bestellengesponserter Link
Combinatorics Advances - neues Buch

ISBN: 9781461335542

On March 28~31, 1994 (Farvardin 8~11, 1373 by Iranian calendar), the Twenty­ fifth Annual Iranian Mathematics Conference (AIMC25) was held at Sharif University of Technology in Tehran, Is… Mehr…

Nr. 978-1-4613-3554-2. Versandkosten:Worldwide free shipping, , DE. (EUR 0.00)
4
Combinatorics Advances - Kim Scipes
Bestellen
bei hive.co.uk
£ 167,88
(ca. € 186,48)
Bestellengesponserter Link
Kim Scipes:
Combinatorics Advances - neues Buch

ISBN: 9781461335542

; EPUB; Scientific, Technical and Medical > Mathematics > Combinatorics & graph theory, Lexington Books

No. 9781461335542. Versandkosten:Instock, Despatched same working day before 3pm, zzgl. Versandkosten.
5
Combinatorics Advances - Charles J. Colbourn; Ebdollah Sayed Mahmoodian
Bestellen
bei lehmanns.de
€ 81,99
Versand: € 0,001
Bestellengesponserter Link
Charles J. Colbourn; Ebdollah Sayed Mahmoodian:
Combinatorics Advances - neues Buch

2013, ISBN: 9781461335542

eBooks, eBook Download (PDF), [PU: Springer US], Springer US, 2013

Versandkosten:Download sofort lieferbar. (EUR 0.00)

1Da einige Plattformen keine Versandkonditionen übermitteln und diese vom Lieferland, dem Einkaufspreis, dem Gewicht und der Größe des Artikels, einer möglichen Mitgliedschaft der Plattform, einer direkten Lieferung durch die Plattform oder über einen Drittanbieter (Marketplace), etc. abhängig sein können, ist es möglich, dass die von eurobuch angegebenen Versandkosten nicht mit denen der anbietenden Plattform übereinstimmen.

Bibliographische Daten des bestpassenden Buches

Details zum Buch

Detailangaben zum Buch - Combinatorics Advances


EAN (ISBN-13): 9781461335542
Erscheinungsjahr: 2013
Herausgeber: Springer US

Buch in der Datenbank seit 2016-11-18T10:58:59+01:00 (Berlin)
Detailseite zuletzt geändert am 2023-11-23T17:34:28+01:00 (Berlin)
ISBN/EAN: 9781461335542

ISBN - alternative Schreibweisen:
978-1-4613-3554-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: colbourn
Titel des Buches: combinatorics first course


Daten vom Verlag:

Autor/in: Charles J. Colbourn; Ebdollah Sayed Mahmoodian
Titel: Mathematics and Its Applications; Combinatorics Advances
Verlag: Springer; Springer US
328 Seiten
Erscheinungsjahr: 2013-12-01
New York; NY; US
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XVI, 328 p.

EA; E107; eBook; Nonbooks, PBS / Mathematik/Sonstiges; Diskrete Mathematik; Verstehen; algorithms; bioinformatics; combinatorics; discrete mathematics; geometry; graph theory; latin square; Matching; Matchings; Mathematica; mathematics; polynomial; programming; C; Discrete Mathematics; Discrete Mathematics in Computer Science; Number Theory; Mathematics and Statistics; Mathematik für Informatiker; Zahlentheorie; BC

1 On a Conjecture of A. Hartman.- 1 Notations and Preliminaries.- 2 The Structure of Trades.- 3 Block Size 3 and Strength 2.- 4 A Possible Approach to the Problem.- 5 The Case of Strength 2.- 6 Some Examples.- 7 Concluding Remarks.- 2 Some Problems in Total Graph Theory.- 1 Introduction and Preliminaries.- 2 Total Ramsey Numbers.- 3 Vertex Reconstructibility of Total Graphs.- 4 Edge Reconstructibility of Total Graphs.- 5 The Spectrum of Total Graphs.- 6 Groups, and Polynomials of Graphs.- 7 Relationships Between some Parameters of G and those of T(G).- 8 Some Generalizations and Applications.- 9 Upper Bounds for x? (G).- 10 Remarks.- 3 Construction Techniques for Mutually Orthogonal Latin Squares.- 1 Background.- 2 History and Small Orders.- 3 Pairwise balanced designs and Greig’s line-flip.- 4 Difference matrices: some direct constructions.- 5 A variant of Wilson’s theorem.- 6 Concluding remarks.- 4 The Spectrum of R-Orthogonal Latin Squares.- 1 Latin squares and r-orthogonality.- 2 Some basic constructions.- 3 Small sides.- 4 A GDD construction.- 5 Intermediate sides.- 5 General Theory of Translation Invariant Systems.- 1 Introduction.- 2 The Model.- 3 A Residuated Semigroup.- 4 Some Basic Questions.- 6 Some Mathematical Problems Arising in Molecular Bioinformatics: The Concept of Bioinformatics.- 1 Introduction.- 2 The concept of sequence space.- 3 The geometry of sequence space.- 4 Cluster analysis.- 5 Split decomposition.- 6 Concluding remark.- 7 An Algorithmic Approach to Tilings.- 8 A New Connection Between Convex Geometry and Threshold Logic.- 1 Introduction.- 2 Algorithmic Enumeration of Nonisomorphic Cut-Complexes and a Generation of Convex Polytopes.- 3 Geometric Properties.- 9 The Unity of Combinatorics.- 1 Introduction.- 2 Langford’s Problem.- 3Skolem’s Problem.- 4 Beatty Sequences.- 5 Penrose Pieces.- 6 Wythoff’s Game.- 7 Triples satisfying x + y = z.- 8 Triples satisfying x + y = 2z.- 9 Coil diagrams.- 10 Squaring the square.- 11 Packing or covering the complete graph.- 12 Hanani’s cyclic Steiner systems.- 13 Perfect difference sets.- 14 Projective planes.- 15 Affine geometries.- 16 Magic squares.- 17 Kirkman’s schoolgirls problem.- 18 Heawood’s map on the torus.- 19 The toroidal thickness of the complete graph.- 20 Nim addition.- 21 Incidence matrices.- 22 Zarankiewicz’s problem.- 23 Error-correcting codes.- 24 Hadamard matrices.- 25 Cyclic Hadamard matrices.- 26 Factoring with quadratic forms.- 27 Projective geometries.- 28 Sphere packing.- 29 Mock Turtles.- 10 Unsolved Problems in Combinatorial Games.- 11 (F, 2)—Rotational Steiner Triple Systems.- 1 Introduction.- 2 Skolem Sequences.- 3 Constructions.- 4 Main Results.- 12 A Simple Polynomial Time Algorithm for a Convex Hull Problem Equivalent to Linear Programming.- 1 Introduction.- 2 The Algorithm.- 13 A Linear—Time Algorithm for Minimum Cost Flow on Undirected One—Trees.- 1 Introduction.- 2 The Algorithm.- 14 An Asymptotic Existence Result for Orthogonal Designs.- 1 Introduction.- 2 Basic Results.- 3 Main Results.- 15 Decomposition of Complete Tripartite Graphs Into 5-Cycles.- 1 Introduction.- 2 Necessary Conditions.- 3 An Application.- 4 Sufficiency of Conditions.- 5 Searching for a decomposition in other cases.- 16 The Nsm of a Graph.- 1 The New Stability Measure of a Graph (NSM).- 2 NSM and Operations on Graphs.- 3 Hamilton Properties of NSM.- 17 Zero-Knowledge Proofs For Independent Set and Dominating Set Problems.- 1 Introduction.- 2 A Zero-Knowledge Proof for Independent set problem.- 3 A Zero-Knowledge Proof for Dominating setproblem.- 18 Exploring the Spectrum of Values of Permanents by Simulated Annealing.- 1 The Permanent.- 2 Upper Bounds and Lower Bounds for the Permanent.- 3 Simulated Annealing.- 4 The Metropolis Algorithm.- 5 Results and Conclusions.- 19 Vector—Weighted Matchings.- 1 Introduction.- 2 Preliminaries.- 3 Preference Matchings.- 4 Preference Poly topes.- 5 The Set of Efficient Solutions.- 20 Directed Quadruple Designs.- 1 Introduction.- 2 Existence of 3-(v, 4, l)DDs.- 3 On the Existence of 3-(v, 4, 2)DDs.- 4 Some Small Cases (for ? = 2).- 21 Bounding Two-Terminal Network Reliability Via Surface Duality.- 1 Introduction.- 2 Definitions.- 3 Results.- 4 Implementation.- 5 Examples.- 22 Defining Sets for Block Designs: An Update.- 1 Introduction.- 2 Some Theoretical Results.- 3 Finding Smallest Defining Sets in Small Designs.- 4 Defining Sets in Some Infinite Classes of Designs.- 23 Open Problems at the Combinatorics Workshop of Aimc25 (Tehran, 1994).

Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:

Neuestes ähnliches Buch:
9781461335566 Combinatorics Advances (Mathematics and Its Applications (329), Band 329) (Ebadollah S. Mahmoodian, Charles J. Colbourn)


< zum Archiv...