Results 81 to 90 of about 37,501 (244)
Against All Odds?—A Surprisingly Not So Easy Dice Game
Teaching Statistics, EarlyView.ABSTRACT A game with 11 players, 2 dice, and simple rules. However, it turns out that the best strategy is not only absent from the literature, but that misconceptions about winning strategies also prevail among surveyed students. This makes it all the more surprising that it is not so easy to get to the bottom of the game mathematically.
Christoph Oberbucher +1 more
wiley +1 more source
An introduction to Smarandache multi-spaces and mathematical combinatorics [PDF]
, 2007 These Smarandache spaces are right theories for objectives by logic. However, the mathematical combinatorics is a combinatorial theory for branches in classical mathematics motivated by a combinatorial speculation.
Linfan Mao, Mao. Linfan
core +1 more source
Teaching of probability theory and combinatorics at secondary schools
Lietuvos Matematikos Rinkinys, 2004 The topics of probability theory and combinatorics were brought into curricula of Lithuanian secondary schools ten years ago. The problems of teaching and actual situation of apprehension of concepts of probability theory and combinatorics are analyzed.
Eugenijus Stankus
doaj +3 more sources
Statistics of Feynman amplitudes in ϕ 4-theory
Journal of High Energy Physics, 2023 The amplitude of subdivergence-free logarithmically divergent Feynman graphs in ϕ 4-theory in 4 spacetime dimensions is given by a single number, the Feynman period. We numerically compute the periods of 1.3 million completed graphs, this represents more
Paul-Hermann Balduf
doaj +1 more source
Basis Networks: Learning basis functions for free‐form triangulations
Computer Graphics Forum, EarlyView.Abstract We present a framework for learning compactly supported basis functions that define tangent continuous surfaces based on coarse irregular triangle meshes. The basis functions are represented as MLPs. Smoothness of the basis functions is achieved by using the values of Loop basis functions as the parameterization of the surface.
T. Djuren, M. Alexa
wiley +1 more source
DiskScissors: Cutting Arbitrary‐Topology Solids for Bijective Mapping
Computer Graphics Forum, EarlyView.Abstract An algorithm for cutting solid objects in a topology‐controlled manner is presented. Concretely, given a loop on the object boundary, a disk‐topology cut surface bounded by the loop is constructed in the interior. In contrast to various previous approaches, both disk topology and conformance to the prescribed loop are ensured by construction ...
S. Hinderink, M. Campen
wiley +1 more source
A simple recurrence formula for the number of rooted maps on surfaces by edges and genus [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. The formula is a consequence of the KP equation for the generating function of bipartite maps, coupled with a Tutte equation, and it was
Sean Carrell, Guillaume Chapuy
doaj +1 more source
A practical algorithm for weighted k‐hulls
Computer Graphics Forum, EarlyView.Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley +1 more source
, 2011 Combinatorics is a fundamental mathematical discipline which focuses on the study of discrete objects and their properties. The current workshop brought together researchers from diverse fields such as Extremal and Probabilistic Combinatorics, Discrete ...
core +2 more sources
Continuous dependence and differentiation of solutions of finite difference equations
International Journal of Mathematics and Mathematical Sciences, 1991 Conditions are given for the continuity and differentiability of solutions of initial value problems and boundary value problems for the nth order finite difference equation, u(m+n)=f(m,u(m),u(m+1),…,u(m+n−1)),m∈ℤ.
Johnny Henderson, Linda Lee
doaj +1 more source