標(biāo)題: Titlebook: Computing the Continuous Discretely; Integer-Point Enumer Matthias Beck,Sinai Robins Textbook 2015Latest edition Matthias Beck and Sinai Ro [打印本頁] 作者: External-Otitis 時間: 2025-3-21 16:06
書目名稱Computing the Continuous Discretely影響因子(影響力)
書目名稱Computing the Continuous Discretely影響因子(影響力)學(xué)科排名
書目名稱Computing the Continuous Discretely網(wǎng)絡(luò)公開度
書目名稱Computing the Continuous Discretely網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computing the Continuous Discretely被引頻次
書目名稱Computing the Continuous Discretely被引頻次學(xué)科排名
書目名稱Computing the Continuous Discretely年度引用
書目名稱Computing the Continuous Discretely年度引用學(xué)科排名
書目名稱Computing the Continuous Discretely讀者反饋
書目名稱Computing the Continuous Discretely讀者反饋學(xué)科排名
作者: 聲音刺耳 時間: 2025-3-21 21:11
A Gallery of Discrete Volumeseger points . form a lattice in ., and we often call the integer points .. This chapter carries us through concrete examples of lattice-point enumeration in various infinite families of integral and rational polytopes, and we will realize that many well-known families of numbers and polynomials, suc作者: Palate 時間: 2025-3-22 01:42 作者: Eructation 時間: 2025-3-22 05:06
Finite Fourier Analysis the integers can be written as a polynomial in the .. root of unity .. Such a representation for .(.) is called a .. Here we develop finite Fourier theory using rational functions and their partial fraction decomposition. We then define the . and the . of finite Fourier series, and show how one can作者: ADAGE 時間: 2025-3-22 10:57 作者: 發(fā)出眩目光芒 時間: 2025-3-22 16:36
Zonotopesss of integral polytopes whose discrete volume is more tractable, and yet robust enough to be “closer” in complexity to generic integral polytopes. One initial class of more tractable polytopes is that of parallelepipeds, and as we will see, the Ehrhart polynomial of a .-dimensional half-open intege作者: 發(fā)出眩目光芒 時間: 2025-3-22 20:13
-Polynomials and ,,-Polynomialsoded in an Ehrhart polynomial is equivalent to the information encoded in its Ehrhart series. More precisely, when the Ehrhart series is written as a rational function, we introduced the name .. for its numerator: . Our goal in this chapter is to prove several decomposition formulas for . based on t作者: 去掉 時間: 2025-3-22 21:35 作者: 吵鬧 時間: 2025-3-23 03:56
Euler–Maclaurin Summation in ?don is the difference between the discrete integer-point transform and its continuous sibling: . where we have replaced the variable . that we have commonly used in generating functions by an exponential variable. Note that on setting .?=?0 in (12.2), we obtain the difference between the discrete and作者: 考古學(xué) 時間: 2025-3-23 08:43 作者: IRATE 時間: 2025-3-23 11:52 作者: Migratory 時間: 2025-3-23 16:45
https://doi.org/10.1007/978-94-017-3530-8ion .?≤?4. In this chapter, we focus on the computational-complexity issues that arise when we try to compute Dedekind sums explicitly. In many ways, the Dedekind sums extend the notion of the greatest common divisor of two integers.作者: INCH 時間: 2025-3-23 20:14
Dedekind Sums, the Building Blocks of Lattice-Point Enumerationion .?≤?4. In this chapter, we focus on the computational-complexity issues that arise when we try to compute Dedekind sums explicitly. In many ways, the Dedekind sums extend the notion of the greatest common divisor of two integers.作者: 漂亮才會豪華 時間: 2025-3-23 22:53 作者: pancreas 時間: 2025-3-24 04:17 作者: 作嘔 時間: 2025-3-24 06:40 作者: obligation 時間: 2025-3-24 13:21 作者: 修正案 時間: 2025-3-24 18:08 作者: acrophobia 時間: 2025-3-24 22:09
Akitaka Dohtani,Toshio Inaba,Hiroshi Osakarational function, we introduced the name .. for its numerator: . Our goal in this chapter is to prove several decomposition formulas for . based on triangulations of .. As we will see, these decompositions will involve both arithmetic data from the simplices of the triangulation and combinatorial data from the face structure of the triangulation.作者: 系列 時間: 2025-3-25 00:52
https://doi.org/10.1007/978-94-017-3536-0 transforms a continuous integral into a discrete sum of residues. Using the ..., we show here that Pick’s theorem is a discrete version of Green’s theorem in the plane. As a bonus, we also obtain an integral formula for the discrepancy between the area enclosed by a general curve . and the number of integer points contained in?..作者: 節(jié)省 時間: 2025-3-25 05:24
A Gallery of Discrete Volumesion in various infinite families of integral and rational polytopes, and we will realize that many well-known families of numbers and polynomials, such as Bernoulli and Stirling numbers, make an appearance as the lattice-point enumerators of some concrete families of polytopes.作者: milligram 時間: 2025-3-25 08:06 作者: 陳腐思想 時間: 2025-3-25 13:43
Finite Fourier Analysisheory using rational functions and their partial fraction decomposition. We then define the . and the . of finite Fourier series, and show how one can use these ideas to prove identities on trigonometric functions, as well as find connections to the classical ..作者: Truculent 時間: 2025-3-25 18:31 作者: Expostulate 時間: 2025-3-25 23:17 作者: 叫喊 時間: 2025-3-26 03:42 作者: 憤怒事實(shí) 時間: 2025-3-26 05:04 作者: 執(zhí) 時間: 2025-3-26 10:49
https://doi.org/10.1007/978-3-319-53725-2 the continuous volumes of .. Relations between the two quantities . and . are known as . formulas for polytopes. The “behind-the-scenes” operators that are responsible for affording us with such connections are the differential operators known as ., whose definition utilizes the Bernoulli numbers in a surprising way.作者: Conflagration 時間: 2025-3-26 14:07 作者: set598 時間: 2025-3-26 19:18
The Coin-Exchange Problem of Frobenius into the continuous world of functions. We introduce techniques for working with generating functions, and we use them to shed light on the .: Given relatively prime positive integers ., what is the largest integer that cannot be written as a nonnegative integral linear combination of .?作者: 是剝皮 時間: 2025-3-26 21:20 作者: Locale 時間: 2025-3-27 01:59
Euler–Maclaurin Summation in ?d the continuous volumes of .. Relations between the two quantities . and . are known as . formulas for polytopes. The “behind-the-scenes” operators that are responsible for affording us with such connections are the differential operators known as ., whose definition utilizes the Bernoulli numbers in a surprising way.作者: antenna 時間: 2025-3-27 06:45
Solid Angles cone with a sphere. There is a theory, which we will develop in this chapter and which goes back to I.G. Macdonald, that parallels the Ehrhart theory of Chapters . and ., with some genuinely new ideas.作者: 琺瑯 時間: 2025-3-27 09:36
https://doi.org/10.1007/978-1-349-20865-4 there a “good formula” for .. as a function of .? Are there identities involving various ..’s? Embedding this sequence into the . . allows us to retrieve answers to the questions above in a surprisingly quick and elegant way. We may think of .(.) as lifting our sequence .. from its discrete setting作者: obsession 時間: 2025-3-27 13:49
https://doi.org/10.1007/3-540-60941-5eger points . form a lattice in ., and we often call the integer points .. This chapter carries us through concrete examples of lattice-point enumeration in various infinite families of integral and rational polytopes, and we will realize that many well-known families of numbers and polynomials, suc作者: 潰爛 時間: 2025-3-27 20:10
Lecture Notes in Computer Scienceosely speaking, a magic square is an . × . array of integers (usually required to be positive, often restricted to the numbers ., usually required to have distinct entries) whose sum along every row, column, and main diagonal is the same number, called the .. Magic squares have turned up time and ag作者: 祖先 時間: 2025-3-27 22:30
Time Travel in World Literature and Cinema the integers can be written as a polynomial in the .. root of unity .. Such a representation for .(.) is called a .. Here we develop finite Fourier theory using rational functions and their partial fraction decomposition. We then define the . and the . of finite Fourier series, and show how one can作者: affluent 時間: 2025-3-28 03:54
https://doi.org/10.1007/978-94-017-3530-8y of the coin-exchange problem in Chapter?. They have one shortcoming, however (which we shall remove): the definition of .(.,?.) requires us to sum over . terms, which is rather slow when .?=?2., for example. Luckily, there is a magical . for the Dedekind sum .(.,?.) that allows us to compute it in作者: Flatus 時間: 2025-3-28 06:43 作者: 收到 時間: 2025-3-28 13:56
Akitaka Dohtani,Toshio Inaba,Hiroshi Osakaoded in an Ehrhart polynomial is equivalent to the information encoded in its Ehrhart series. More precisely, when the Ehrhart series is written as a rational function, we introduced the name .. for its numerator: . Our goal in this chapter is to prove several decomposition formulas for . based on t作者: 比目魚 時間: 2025-3-28 15:15
Maddie Breeze,Yvette Taylor,Cristina CostaMichel Brion. The power of .—the centerpiece of this chapter—has been applied to various domains, such as . in integer linear programming, and to higher-dimensional ., which we study in Chapter?. In a sense, Brion’s theorem is the natural extension of the familiar finite geometric series identity . 作者: 徹底檢查 時間: 2025-3-28 22:25
https://doi.org/10.1007/978-3-319-53725-2on is the difference between the discrete integer-point transform and its continuous sibling: . where we have replaced the variable . that we have commonly used in generating functions by an exponential variable. Note that on setting .?=?0 in (12.2), we obtain the difference between the discrete and作者: 許可 時間: 2025-3-29 02:25
https://doi.org/10.1007/978-94-017-3536-0rtion of space that the cone . occupies. In slightly different words, if we pick a point . “at random,” then the probability that . is precisely the solid angle at the apex of .. Yet another view of solid angles is that they are in fact volumes of spherical polytopes: the region of intersection of a作者: 非實(shí)體 時間: 2025-3-29 05:01 作者: 征兵 時間: 2025-3-29 08:43
Computing the Continuous Discretely978-1-4939-2969-6Series ISSN 0172-6056 Series E-ISSN 2197-5604 作者: deciduous 時間: 2025-3-29 13:23 作者: 感情脆弱 時間: 2025-3-29 16:36
Matthias Beck,Sinai RobinsNew edition extensively revised and updated.Places a strong emphasis on computational techniques.Contains more than 200 exercises, including hints to selected exercises.Includes supplementary material作者: 誘導(dǎo) 時間: 2025-3-29 21:55 作者: 排他 時間: 2025-3-30 03:38 作者: synovial-joint 時間: 2025-3-30 04:17 作者: Callus 時間: 2025-3-30 09:39
978-1-4939-3858-2Matthias Beck and Sinai Robins 2015
