Results 21 to 30 of about 54,181 (174)
Graßmannian integrals in Minkowski signature, amplitudes, and integrability
Journal of High Energy Physics, 2019 We attempt to systematically derive tree-level scattering amplitudes in fourdimensional, planar, maximally supersymmetric Yang-Mills theory from integrability.
Nils Kanning, Matthias Staudacher
doaj +1 more source
A 1D continuum model for beams with pantographic microstructure: asymptotic micro-macro identification and numerical results [PDF]
, 2018 In the standard asymptotic micro-macro identification theory, starting from a De Saint-Venant cylinder, it is possible to prove that, in the asymptotic limit, only flexible, inextensible, beams can be obtained at the macro-level.
Barchiesi, Emilio +4 more
core +1 more source
Descendants and ascendants in binary trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 There are three classical algorithms to visit all the nodes of a binary tree - preorder, inorder and postorder traversal. From this one gets a natural labelling of the n internal nodes of a binary tree by the numbers 1, 2, ..., n, indicating the sequence
Alois Panholzer, Helmut Prodinger
doaj +1 more source
On death processes and urn models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use death processes and embeddings into continuous time in order to analyze several urn models with a diminishing content. In particular we discuss generalizations of the pill's problem, originally introduced by Knuth and McCarthy, and generalizations
Markus Kuba, Alois Panholzer
doaj +1 more source
Non-Asymptotic Confidence Sets for Circular Means
Entropy, 2016 The mean of data on the unit circle is defined as the minimizer of the average squared Euclidean distance to the data. Based on Hoeffding’s mass concentration inequalities, non-asymptotic confidence sets for circular means are constructed which are ...
Thomas Hotz +2 more
doaj +1 more source
The Width of Galton-Watson Trees Conditioned by the Size [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 It is proved that the moments of the width of Galton-Watson trees of size n and with offspring variance σ ^2 are asymptotically given by (σ √n)^pm_p where m_p are the moments of the maximum of the local time of a standard scaled Brownian excursion.
Michael Drmota, Bernhard Gittenberger
doaj +1 more source
Das Portfolio zwischen formativer und summativer Bewertung
Beiträge zur Lehrerinnen- und Lehrerbildung, 1997 Der vorliegende Artikel versteht sich als Diskussionsbeitrag zum Einsatz des Portfolios in der Grund- und Weiterbildung der Lehrkräfte an Berufsschulen.
Matthis Behrens
doaj +1 more source
Some results for monotonically labelled simply generated trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We consider simply generated trees, where the nodes are equipped with weakly monotone labellings with elements of $\{1, 2, \ldots, r\}$, for $r$ fixed.
Bernhard Gittenberger, Alois Panholzer
doaj +1 more source
Good reduction of algebraic groups and flag varieties [PDF]
, 2015 In 1983, Faltings proved that there are only finitely many abelian varieties over a number field of fixed dimension and with good reduction outside a given set of places.
Javanpeykar, Ariyan, Loughran, Daniel
core +2 more sources
Entwicklung von Testverfahren für die Bildungsstandards Mathematik. Rahmenkonzeption, Aufgabenentwicklung, Feld- und Haupttest [PDF]
, 2006 Thema des Beitrags ist die Entwicklung und Überprüfung von Testverfahren, um das Erreichen von Bildungsstandards in Mathematik überprüfen zu können. Um die schulische Bildung in Deutschland zu verbessern, hat die Ständige Konferenz der Kultusminister der
Blum, Werner +3 more
core +1 more source