Knowledge (XXG)

User:Bethnim

Source 📝

21:"The most prominent of these runs between Pure and Applied Mathematics. The controversy around Bourbaki focuses on Abstract vs. Concrete. The distinction between Structural Mathematics (whose main results are theorems and proofs) and Algorithmic Mathematics (whose results are algorithms and their analysis) can be traced back to ancient times. There is a deep division (or at least so it appears) between Continuous and Discrete Mathematics.", 315:
for more examples. So analysis shouldn't be contrasted with discrete. Analysis isn't just about limits or continuity in the traditional sense of real numbers, it is a collection of concepts and methods about functions - be they discrete or continuous, and the spaces that the functions act on, and the
348:
and can be used to approximate the latter or studied in its own right. Every question and method about differential equations has a discrete equivalent for difference equations. For instance where there are integral transforms in
267: 290: 123: 419:, Shujun Li, Chengqing Li, Kwok-Tung Lo, Guanrong Chen, IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS—I: REGULAR PAPERS, VOL. 55, NO. 4, PAGES 1055-1063, APRIL 2008 407:, Franc Novak Bojan Hvala, Sandi Klavžar, "Proceedings of the conference on Design, automation and test in Europe", 1999, ISBN:1-58113-121-6 186:
Number theory isn't concerned solely discrete objects: Transcendental numbers, Diophantine approximation, p-adic analysis, function fields
225: 489: 474: 459: 444:
parallelisms, spreads, partial spreads, spreadsets, quasifields, collineations, automorphisms, autotopisms, translation planes, nets
439: 271: 215: 43:
Computer science considers both discrete and continuous computational processes, and both discrete and continuous input/output:
149: 404: 392: 353:
for studing continuous functions or analog signals, there are discrete transforms for discrete functions or digital signals.
283: 275: 74: 68: 286:. If a discrete object doesn't have a continuous version it is just because noone has gotten round to continuifying it yet. 243: 336:. A discrete function could be defined explicitly by a list, or by a formula for f(n) or it could be given implicitly by a 55: 163: 78: 35:, Proceedings of the Sixth International Conference on Difference Equations, Aulbach, et al, ed., CRC Press, 2004. 452:
Discrete Variational Derivative Method: A Structure-Preserving Numerical Method for Partial Differential Equations
333: 82: 374: 203: 115: 181: 362: 321: 198: 135: 22: 345: 156: 365:. Solutions to difference and functional equations can also be continuous functions. As well as the 358: 312: 131: 127: 395:, Brian Chen and Gregory W. Wornell, IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 46, NO. 7, JULY 1998 370: 354: 341: 337: 50: 235: 220: 119: 259: 485: 470: 455: 435: 350: 332:). A sequence could be a finite sequence from some data source or an infinite sequence from a 302: 279: 251: 32: 366: 174:
What is the most pure mathematics subject ? The queen of mathematics, number theory.
99: 95: 484:, Wassim M. Haddad, Vijaysekhar Chellaboina, Qing Hui, Princeton University Press, 2010, 307:
Many concepts in analysis have discrete versions giving rise to discrete analysis. e.g.
329: 317: 107: 451: 431: 481: 416: 67:
Complexity theory of continuous time computation using dynamical systems or other
466: 142: 28: 276:
Novel architectures for P2P applications: the continuous-discrete approach
325: 297:
Calculus of finite differences, discrete calculus or discrete analysis
417:
Cryptanalyzing an Encryption Scheme Based on Blind Source Separation
111: 17:
Discrete and Continuous Mathematics, Pure and Applied Mathematics
393:
Analog Error-Correcting Codes Based on Chaotic Dynamical Systems
190:
Other topics often categorized as part of discrete mathematics
25:, "One Mathematics", The Berliner Intelligencer, Berlin, 1998 320:
that the functions themselves are members of. A discrete
29:"Real analysis" is a degenerate case of discrete analysis 344:. A difference equation is the discrete equivalent of a 177:
What is the most applied ? Mathematical physics.
467:Substitution Dynamical Systems - Spectral Analysis 226:"metric graph theory" OR "geometric graph theory" 482:Nonnegative and Compartmental Dynamical Systems 289:Likewise, almost any continuous object can be 284:infinite proof trees with continuous branching 8: 244:continuous processes in operations research 69:continuous models of continuous computation 150:"analog Automata" OR "continuous Automata" 106:Information is encoded analogously in the 432:Combinatorics of Spreads and Parallelisms 385: 75:Complexity theory of numerical analysis 469:, Martine Queffélec, Springer, 2010, 454:, Daisuke Furihata, CRC Press, 2010, 7: 434:, Norman Johnson, CRC Press, 2010, 369:there are more general discrete or 164:"continuous-time" "process algebra" 357:is a unification of the theory of 266:Almost any discrete object can be 14: 47:Continuous computability theory: 180:Here are the Google results for 309:Discrete Calculus of Variations 77:(various approaches including 64:Continuous complexity theory: 1: 56:Algorithmic complexity theory 405:On Analog Signature Analysis 79:Information-based complexity 182:"Number theory and physics" 83:algebraic complexity theory 506: 300: 375:finite topological spaces 334:discrete dynamical system 324:f(n) is usually called a 204:infinitary combinatorics 116:analog signal processing 157:"Continuous Petri nets" 132:analog data compression 128:analog error correction 91:Including P!=NP over R 363:differential equations 199:analytic combinatorics 346:differential equation 242:Operations research: 371:finite metric spaces 359:difference equations 313:discrete mathematics 355:Time scale calculus 342:difference equation 338:recurrence relation 236:continuous lattices 51:Computable analysis 260:"continuous logic" 221:Analysis on graphs 120:analog electronics 351:harmonic analysis 303:finite difference 272:continuous graphs 252:Differential game 216:continuous graphs 136:analog encryption 497: 420: 414: 408: 402: 396: 390: 280:continuous proof 39:Computer science 33:Doron Zeilberger 505: 504: 500: 499: 498: 496: 495: 494: 428: 423: 415: 411: 403: 399: 391: 387: 383: 367:discrete metric 318:function spaces 305: 299: 192: 172: 108:neural networks 100:Hybrid computer 96:Analog computer 41: 19: 12: 11: 5: 503: 501: 493: 492: 478: 477: 463: 462: 448: 447: 446: 445: 427: 424: 422: 421: 409: 397: 384: 382: 379: 330:sequence space 301:Main article: 298: 295: 264: 263: 255: 254: 247: 246: 239: 238: 231: 230: 229: 228: 223: 218: 209: 208: 207: 206: 201: 195:Combinatorics 191: 188: 171: 168: 167: 166: 160: 159: 153: 152: 146: 145: 139: 138: 103: 102: 89: 88: 87: 86: 72: 61: 60: 59: 58: 53: 40: 37: 18: 15: 13: 10: 9: 6: 4: 3: 2: 502: 491: 490:9780691144115 487: 483: 480: 479: 476: 475:9783642112119 472: 468: 465: 464: 461: 460:9781420094459 457: 453: 450: 449: 443: 442: 441: 440:9781439819463 437: 433: 430: 429: 425: 418: 413: 410: 406: 401: 398: 394: 389: 386: 380: 378: 376: 372: 368: 364: 361:with that of 360: 356: 352: 347: 343: 339: 335: 331: 327: 323: 319: 314: 310: 304: 296: 294: 292: 287: 285: 281: 277: 273: 269: 262:(fuzzy logic) 261: 257: 256: 253: 250:Game theory: 249: 248: 245: 241: 240: 237: 233: 232: 227: 224: 222: 219: 217: 214: 213: 212:Graph theory 211: 210: 205: 202: 200: 197: 196: 194: 193: 189: 187: 184: 183: 178: 175: 170:Number theory 169: 165: 162: 161: 158: 155: 154: 151: 148: 147: 144: 141: 140: 137: 133: 129: 125: 124:analog coding 122:. Aspects of 121: 117: 113: 109: 105: 104: 101: 97: 94: 93: 92: 84: 80: 76: 73: 70: 66: 65: 63: 62: 57: 54: 52: 49: 48: 46: 45: 44: 38: 36: 34: 30: 26: 24: 23:László Lovász 16: 412: 400: 388: 308: 306: 288: 265: 185: 179: 176: 173: 90: 42: 27: 20: 291:discretized 268:continuized 143:analog vlsi 381:References 328:a(n) (see 234:Lattices: 326:sequence 322:function 278:). Even 126:include 258:Logic: 488:  473:  458:  438:  311:. See 118:, and 112:brains 426:Links 270:e.g. 114:, in 486:ISBN 471:ISBN 456:ISBN 436:ISBN 373:and 340:or 110:of 377:. 293:. 282:, 134:. 130:, 98:, 81:, 31:, 274:( 85:) 71:.

Index

László Lovász
"Real analysis" is a degenerate case of discrete analysis
Doron Zeilberger
Computable analysis
Algorithmic complexity theory
continuous models of continuous computation
Complexity theory of numerical analysis
Information-based complexity
algebraic complexity theory
Analog computer
Hybrid computer
neural networks
brains
analog signal processing
analog electronics
analog coding
analog error correction
analog data compression
analog encryption
analog vlsi
"analog Automata" OR "continuous Automata"
"Continuous Petri nets"
"continuous-time" "process algebra"
"Number theory and physics"
analytic combinatorics
infinitary combinatorics
continuous graphs
Analysis on graphs
"metric graph theory" OR "geometric graph theory"
continuous lattices

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.