Results 11 to 20 of about 3,314,720 (268)
Statistica Neerlandica, 2001 Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e.
Klaassen, Chris A. J. +1 more
core +7 more sources
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
Lagrange Dual Method for Sparsity Constrained Optimization
IEEE Access, 2018 In this paper, we investigate the l0 quasi-norm constrained optimization problem in the Lagrange dual framework and show that the strong duality property holds.
Wenxing Zhu +3 more
doaj +1 more source
Solving Linear Equations Using Matrix Splitting for Iterative Discrete-Time Methods in Neural Networks [PDF]
Kirkuk Journal of Science, 2007 The material presented in this paper is the foundation for neural network architectures that can perform (Solving linear equations using matrix splitting for iterative discrete-time methods in neural networks).As announced a neural network consists of ...
Essa I. Essa
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
Taylor series expansion in discrete Clifford analysis [PDF]
, 2013 Discrete Clifford analysis is a discrete higher-dimensional function theory which corresponds simultaneously to a refinement of discrete harmonic analysis and to a discrete counterpart of Euclidean Clifford analysis.
De Ridder, Hilde +2 more
core +2 more sources
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