Results 11 to 20 of about 32,280 (249)
Discrete Hamiltonians of discrete Painlevé equations [PDF]
Annales de la Faculté des sciences de Toulouse : Mathématiques, 2021 We express discrete Painlevé equations as discrete Hamiltonian systems. The discrete Hamiltonian systems here mean the canonical transformations defined by generating functions. Our construction relies on the classification of the discrete Painlevé equations based on the surface-type. The discrete Hamiltonians we obtain are written in the logarithm and
Mase, Takafumi +2 more
openaire +2 more sources
Physics Reports, 1998 62 pages, LaTeX, 14 ps figures. Physics Reports, to be published; see also at http://www.mpipks-dresden.mpg.de/~flach/html/preprints ...
Flach, S., Willis, C.
openaire +3 more sources
Journal of High Energy Physics, 2021 Abstract We assume that the points in volumes smaller than an elementary volume (which may have a Planck size) are indistinguishable in any physical experiment. This naturally leads to a picture of a discrete space with a finite number of degrees of freedom per elementary volume.
Ali H. Chamseddine, Viatcheslav Mukhanov
openaire +3 more sources
Journal of Algebraic Combinatorics, 2002 The discrete polymatroid is a multiset analogue of the matroid. This paper studies the combinatorics and the algebra on discrete polymatroids. An algebraic aspect of this paper is to study Ehrhart rings and base rings together with toric ideals of discrete polymatroids. One result on toric ideals of discrete polymatroids given in this paper is Theorem.
Herzog, Jürgen, Hibi, Takayuki
openaire +1 more source
Rough-Set-Theory-Based Classification with Optimized k-Means Discretization
Technologies, 2022 The discretization of continuous attributes in a dataset is an essential step before the Rough-Set-Theory (RST)-based classification process is applied. There are many methods for discretization, but not many of them have linked the RST instruments from ...
Teguh Handjojo Dwiputranto +2 more
doaj +1 more source
Two discrete–non-discrete results
Discrete Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
DULIO, PAOLO, SCAPELLATO, RAFFAELE
openaire +3 more sources
A Discretization Algorithm Based on Forest Optimization Network and Variable Precision Rough Set
Xibei Gongye Daxue Xuebao, 2020 Discretization of multidimensional attributes can improve the training speed and accuracy of machine learning algorithm. At present, the discretization algorithms perform at a lower level, and most of them are single attribute discretization algorithm ...
doaj +1 more source
Finance and Economics Discussion Series, 1999 This paper investigates the desirability of adopting a rule in favor of discretionary monetary policy in a model exhibiting Kydland and Prescott's dynamic inconsistency problem. We deviate from earlier work by adopting assumptions regarding policymaker preferences and inflation dynamics that are compatible with empirically motivated models used for ...
Lengwiler, Yvan, Orphanides, Athanasios
openaire +1 more source
Discretization Based on Entropy and Multiple Scanning
Entropy, 2013 In this paper we present entropy driven methodology for discretization. Recently, the original entropy based discretization was enhanced by including two options of selecting the best numerical attribute.
Jerzy W. Grzymala-Busse
doaj +1 more source
Mathematics, 2023 This study introduces a unique flexible family of discrete probability distributions for modeling extreme count and zero-inflated count data with different failure rates.
Walid Emam +5 more
doaj +1 more source