TY - JOUR A1 - Tarkhanov, Nikolai Nikolaevich T1 - Deformation quantization and boundary value problems JF - International journal of geometric methods in modern physics : differential geometery, algebraic geometery, global analysis & topology N2 - We describe a natural construction of deformation quantization on a compact symplectic manifold with boundary. On the algebra of quantum observables a trace functional is defined which as usual annihilates the commutators. This gives rise to an index as the trace of the unity element. We formulate the index theorem as a conjecture and examine it by the classical harmonic oscillator. KW - Symplectic manifold KW - star product KW - trace KW - index Y1 - 2016 U6 - https://doi.org/10.1142/S0219887816500079 SN - 0219-8878 SN - 1793-6977 VL - 13 SP - 176 EP - 195 PB - World Scientific CY - Singapore ER - TY - INPR A1 - Tarkhanov, Nikolai Nikolaevich T1 - On the root functions of general elliptic boundary value problems N2 - We consider a boundary value problem for an elliptic differential operator of order 2m in a domain D ⊂ n. The boundary of D is smooth outside a finite number of conical points, and the Lopatinskii condition is fulfilled on the smooth part of δD. The corresponding spaces are weighted Sobolev spaces H(up s,Υ)(D), and this allows one to define ellipticity of weight Υ for the problem. The resolvent of the problem is assumed to possess rays of minimal growth. The main result says that if there are rays of minimal growth with angles between neighbouring rays not exceeding π(Υ + 2m)/n, then the root functions of the problem are complete in L²(D). In the case of second order elliptic equations the results remain true for all domains with Lipschitz boundary. T3 - Preprint - (2005) 07a Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-29822 ER - TY - INPR A1 - Tarkhanov, Nikolai Nikolaevich T1 - Unitary solutions of partial differential equations N2 - We give an explicit construction of a fundamental solution for an arbitrary non-degenerate partial differential equation with smooth coefficients. T3 - Preprint - (2005) 09 KW - fundamental solution KW - geometric optics approximation Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-29852 ER - TY - INPR A1 - Tarkhanov, Nikolai Nikolaevich T1 - A fixed point formula in one complex variable N2 - We show a Lefschetz fixed point formula for holomorphic functions in a bounded domain D with smooth boundary in the complex plane. To introduce the Lefschetz number for a holomorphic map of D, we make use of the Bergman kernal of this domain. The Lefschetz number is proved to be the sum of usual contributions of fixed points of the map in D and contributions of boundary fixed points, these latter being different for attracting and repulsing fixed points. T3 - Preprint - (2003) 01 Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-26495 ER - TY - BOOK A1 - Tarkhanov, Nikolai Nikolaevich A1 - Vasilevski, Nikolai T1 - Microlocal analysis of the Bochner-Martinelli Integral T3 - Preprint / Universität Potsdam, Institut für Mathematik, Arbeitsgruppe Partiell Y1 - 2005 SN - 1437-739X PB - Univ. CY - Potsdam ER - TY - INPR A1 - Tarkhanov, Nikolai Nikolaevich A1 - Vasilevski, Nikolai T1 - Microlocal analysis of the Bochner-Martinelli integral N2 - In order to characterise the C*-algebra generated by the singular Bochner-Martinelli integral over a smooth closed hypersurfaces in Cn, we compute its principal symbol. We show then that the Szegö projection belongs to the strong closure of the algebra generated by the singular Bochner-Martinelli integral. T3 - Preprint - (2005) 25 Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-30012 ER - TY - INPR A1 - Tarkhanov, Nikolai Nikolaevich A1 - Wallenta, Daniel T1 - The Lefschetz number of sequences of trace class curvature N2 - For a sequence of Hilbert spaces and continuous linear operators the curvature is defined to be the composition of any two consecutive operators. This is modeled on the de Rham resolution of a connection on a module over an algebra. Of particular interest are those sequences for which the curvature is "small" at each step, e.g., belongs to a fixed operator ideal. In this context we elaborate the theory of Fredholm sequences and show how to introduce the Lefschetz number. T3 - Preprints des Instituts für Mathematik der Universität Potsdam - 1 (2012) 3 KW - Perturbed complexes KW - curvature KW - Lefschetz number Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-56969 ER - TY - INPR A1 - Tepoyan, Liparit T1 - Degenerated operator equations of higher order N2 - Content: 1 Introduction 2 The one-dimensional case 2.1 The space Wm sub (α) 2.2 Self-adjoint Equation 2.3 Non-selfadjoint Equation 3 Operator Equation T3 - Preprint - (2000) 23 Y1 - 2000 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-25888 ER - TY - INPR A1 - Tepoyan, Liparit T1 - The mixed problem for a degenerate operator equation N2 - We consider a mixed problem for a degenerate differentialoperator equation of higher order. We establish some embedding theorems in weighted Sobolev spaces and show existence and uniqueness of the generalized solution of this problem. We also give a description of the spectrum for the corresponding operator. T3 - Preprint - (2008) 06 Y1 - 2008 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-30334 ER - TY - JOUR A1 - Thiem, Wolfgang T1 - Didaktik der Erziehungswissenschaft (Pädagogik) - ein weites Feld? Y1 - 1996 ER - TY - JOUR A1 - Tillmann, Alexander A1 - Krömker, Detlef A1 - Horn, Florian A1 - Gattinger, Thorsten T1 - Analysing & Predicting Students Performance in an Introductory Computer Science Course JF - Commentarii informaticae didacticae N2 - Students of computer science studies enter university education with very different competencies, experience and knowledge. 145 datasets collected of freshmen computer science students by learning management systems in relation to exam outcomes and learning dispositions data (e. g. student dispositions, previous experiences and attitudes measured through self-reported surveys) has been exploited to identify indicators as predictors of academic success and hence make effective interventions to deal with an extremely heterogeneous group of students. KW - Blended learning KW - heterogeneity KW - Learning analytics KW - Learning dispositions KW - Dispositional learning analytics KW - Formative assessment Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-416307 IS - 12 SP - 29 EP - 45 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - THES A1 - Tinpun, Kittisak T1 - Relative rank of infinite full transformation semigroups with restricted range Y1 - 2019 ER - TY - JOUR A1 - Tinpun, Kittisak A1 - Koppitz, Jörg T1 - Generating sets of infinite full transformation semigroups with restricted range JF - Acta scientiarum mathematicarum N2 - In the present paper, we consider minimal generating sets of infinite full transformation semigroups with restricted range modulo specific subsets. In particular, we determine relative ranks. KW - generating sets KW - transformation semigroups KW - restricted range KW - relative ranks Y1 - 2016 U6 - https://doi.org/10.14232/actasm-015-502-4 SN - 0001-6969 VL - 82 SP - 55 EP - 63 PB - Institutum Bolyaianum Universitatis Szegediensis CY - Szeged ER - TY - THES A1 - Trappmann, Henryk T1 - Arborescent numbers : higher arithmetic operations and division trees T1 - Baumartige Zahlen : höhere arithmetische Operationen und Divisionsbäume N2 - The overall program "arborescent numbers" is to similarly perform the constructions from the natural numbers (N) to the positive fractional numbers (Q+) to positive real numbers (R+) beginning with (specific) binary trees instead of natural numbers. N can be regarded as the associative binary trees. The binary trees B and the left-commutative binary trees P allow the hassle-free definition of arbitrary high arithmetic operations (hyper ... hyperpowers). To construct the division trees the algebraic structure "coppice" is introduced which is a group with an addition over which the multiplication is right-distributive. Q+ is the initial associative coppice. The present work accomplishes one step in the program "arborescent numbers". That is the construction of the arborescent equivalent(s) of the positive fractional numbers. These equivalents are the "division binary trees" and the "fractional trees". A representation with decidable word problem for each of them is given. The set of functions f:R1->R1 generated from identity by taking powers is isomorphic to P and can be embedded into a coppice by taking inverses. N2 - Baumartige Zahlen und höhere arithmetische Operationen Von Schülern und Laienmathematikern wird oft die Frage gestellt, warum nach den Operationen Addition (1. Stufe), Multiplikation (2. Stufe), Potenzieren (3. Stufe) keine Operationen der 4. oder höheren Stufen betrachtet werden. Jede Operation der nächsthöheren Stufe ist die Wiederholung der vorhergehenden Operation, z.B. n * x = x + x + ... + x x^n = x * x * ... * x Das offensichtliche Problem mit der Wiederholung des Potenzierens besteht darin, dass das Potenzieren nicht assoziativ ist und es somit mehrere Klammerungsmöglichkeiten für die Wiederholung dieser Operation gibt. Wählt man eine spezifische Klammerungsmöglichkeit aus, z.B. x^^n = (x^(x^(x^(......)))), gibt es jedoch wieder verschiedene Möglichkeiten, diese Operation auf rationale oder reelle n fortzusetzen. In der Tat kann man im Internet verschiedene solcher Fortsetzungen beschrieben finden und keine scheint besonders ausgezeichnet zu sein. Das ganze Dilemma der verschiedenen Klammerungen kann man jedoch überwinden, in dem man den Zahlenbereich abstrakter macht. So dass statt nur der Anzahl auch eine Klammerungsstruktur in einer Zahl kodiert wird. Die ganz natürliche Verallgemeinerung der natürlichen Zahlen in dieser Hinsicht sind die Binärbäume. Und in der Tat lassen sich die 4. und höhere Operationen in einer eindeutigen Weise auf den Binärbäumen erklären. Vielmehr stellt sich sogar heraus, dass die Binärbäume zu viel Information mit sich tragen, wenn es nur darum geht, die höheren Operationen zu definieren. Es gibt eine Spezialisierung der Binärbäume, die aber allgemeiner als die natürlichen Zahlen (die die assoziative Spezialisierung der Binärbäume sind) ist, und die die passende Informationsmenge zur Definition der höheren Operationen kodiert. Dies sind die so genannten linkskommutativen Binärbäume. Es stellt sich heraus, dass die (linkskommutativen) Binärbäume viele Eigenschaften der natürlichen Zahlen teilen, so z.B. die Assoziativität der Multiplikation (die Operation der 2. Stufe) und eine eindeutige Primzahlzerlegung. Dies motiviert die Frage, ob man die Erweiterungskonstruktionen der Zahlen: „natürliche Zahlen zu gebrochenen Zahlen“ (macht die Multiplikation umkehrbar) „gebrochene Zahlen zu positiven reellen Zahlen“ (macht das Potenzieren umkehrbar und erlaubt Grenzwertbildung) auch ausgehend von (linkskommutativen) Binärbäumen vornehmen kann. In der vorliegenden Arbeit wird (neben unzähligen anderen Resultaten) gezeigt, dass die Zahlenbereichserweiterung „natürliche Zahlen zu gebrochenen Zahlen“ auch analog für (linkskommutative) Binärbäume möglich ist. Das Ergebnis dieser Konstruktion sind die Divisionsbinärbäume (bzw. die gebrochenen Bäume). Letztere lassen sich unerwartet in der Form von Brüchen darstellen, sind jedoch als Verallgemeinerung der gebrochenen Zahlen sehr viel komplexer als dieser. (Das kann man live nachprüfen mit dem dafür erstellten Online-Rechner für gebrochene Bäume (auf englisch): http://math.eretrandre.org/cgi-bin/ftc/ftc.pl ) Damit wird ein Programm „baumartige Zahlen“ gestartet, indem es darum geht, auch die Erweiterung „gebrochene Zahlen zu positiven reellen Zahlen“ für die Divisionsbinärbäume (bzw. die gebrochenen Bäume) durchzuführen, wobei die höheren Operationen auf dieser Erweiterung definiert werden könnten und umkehrbar sein müssten. Ob dies wirklich möglich ist, ist derzeit unklar (neben diversen anderen direkt aus der Dissertation sich ergebenden Fragen) und eröffnet damit ein enorm umfangreiches Feld für weitere Forschungen. KW - Tetration KW - höhere Operationen KW - strukturierte Zahlen KW - Divisionsbäume KW - tetration KW - higher operations KW - structured numbers KW - division trees Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-15247 ER - TY - THES A1 - Trump, Stephanie Sonja T1 - Mathematik in der Physik der Sekundarstufe II!? BT - Eine Benennung notwendiger mathematischer Fertigkeiten für einen flexiblen Umgang mit Mathematik beim Lösen physikalisch-mathematischer Probleme im Rahmen der Schul- und Hochschulbildung sowie eine systematische Analyse zur notwendigen Mathematik in der Physik der Sekundarstufe II Y1 - 2015 ER - TY - THES A1 - Tschisgale, Paul T1 - Introduction to the Glauber dynamics for the Curie-Weiss Potts model N2 - This thesis aims at presenting in an organized fashion the required basics to understand the Glauber dynamics as a way of simulating configurations according to the Gibbs distribution of the Curie-Weiss Potts model. Therefore, essential aspects of discrete-time Markov chains on a finite state space are examined, especially their convergence behavior and related mixing times. Furthermore, special emphasis is placed on a consistent and comprehensive presentation of the Curie-Weiss Potts model and its analysis. Finally, the Glauber dynamics is studied in general and applied afterwards in an exemplary way to the Curie-Weiss model as well as the Curie-Weiss Potts model. The associated considerations are supplemented with two computer simulations aiming to show the cutoff phenomenon and the temperature dependence of the convergence behavior. N2 - Die vorliegende Arbeit verfolgt das Ziel, die erforderlichen Grundlagen für das Verständnis der Glauber Dynamik auf organisierte Art und Weise darzustellen. Die Glauber Dynamik stellt eine Möglichkeit der Simulation von Konfigurationen der Gibbs Verteilung des Curie-Weiss Potts Modells dar. Es werden zunächst die zum Verständnis notwendigen Grundlagen von endlichen Markov-Ketten in diskreter Zeit beleuchtet, insbesondere ihr Konvergenzverhalten und die damit verbundene Mischzeit. Darüber hinaus legt diese Arbeit einen Schwerpunkt auf eine konsistente sowie verständliche Darbietung und Analyse des Curie-Weiss Potts Modells. Schließlich wird explizit die Glauber Dynamik betrachtet und anschließend exemplarisch auf das Curie-Weiss Modell und auf das Curie-Weiss Potts Modell angewandt. Die dazugehörigen Betrachtungen werden durch zwei Computersimulationen ergänzt, welche darauf abzielen, das Cutoff-Phänomen sowie die Temperaturabhängigkeit des Konvergenzverhaltens darzustellen bzw. zu verdeutlichen. T2 - Einführung in die Glauber Dynamik des Curie-Weiss Potts Modells KW - Glauber Dynamics KW - Curie-Weiss Potts Model KW - Mixing Times KW - MCMC KW - Glauber Dynamik KW - Curie-Weiss Potts Modell KW - Mischzeiten KW - MCMC-Verfahren Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-486769 ER - TY - JOUR A1 - Ty, Alexander J. A. A1 - Fang, Zheng A1 - Gonzalez, Rivver A. A1 - Rozdeba, Paul J. A1 - Abarbanel, Henry D. T1 - Machine learning of time series using time-delay embedding and precision annealing JF - Neural Computation N2 - Tasking machine learning to predict segments of a time series requires estimating the parameters of a ML model with input/output pairs from the time series. We borrow two techniques used in statistical data assimilation in order to accomplish this task: time-delay embedding to prepare our input data and precision annealing as a training method. The precision annealing approach identifies the global minimum of the action (-log[P]). In this way, we are able to identify the number of training pairs required to produce good generalizations (predictions) for the time series. We proceed from a scalar time series s(tn);tn=t0+n Delta t and, using methods of nonlinear time series analysis, show how to produce a DE>1-dimensional time-delay embedding space in which the time series has no false neighbors as does the observed s(tn) time series. In that DE-dimensional space, we explore the use of feedforward multilayer perceptrons as network models operating on DE-dimensional input and producing DE-dimensional outputs. Y1 - 2019 U6 - https://doi.org/10.1162/neco_a_01224 SN - 0899-7667 SN - 1530-888X VL - 31 IS - 10 SP - 2004 EP - 2024 PB - MIT Press CY - Cambridge ER - TY - CHAP A1 - Valleriani, Angelo A1 - Roelly, Sylvie A1 - Kulik, Alexei Michajlovič ED - Roelly, Sylvie ED - Högele, Michael ED - Rafler, Mathias T1 - Stochastic processes with applications in the natural sciences BT - international workshop at Universidad de los Andes, Bogotá, Colombia T2 - Lectures in pure and applied mathematics N2 - The interdisciplinary workshop STOCHASTIC PROCESSES WITH APPLICATIONS IN THE NATURAL SCIENCES was held in Bogotá, at Universidad de los Andes from December 5 to December 9, 2016. It brought together researchers from Colombia, Germany, France, Italy, Ukraine, who communicated recent progress in the mathematical research related to stochastic processes with application in biophysics. The present volume collects three of the four courses held at this meeting by Angelo Valleriani, Sylvie Rœlly and Alexei Kulik. A particular aim of this collection is to inspire young scientists in setting up research goals within the wide scope of fields represented in this volume. Angelo Valleriani, PhD in high energy physics, is group leader of the team "Stochastic processes in complex and biological systems" from the Max-Planck-Institute of Colloids and Interfaces, Potsdam. Sylvie Rœlly, Docteur en Mathématiques, is the head of the chair of Probability at the University of Potsdam. Alexei Kulik, Doctor of Sciences, is a Leading researcher at the Institute of Mathematics of Ukrainian National Academy of Sciences. T3 - Lectures in pure and applied mathematics - 4 KW - macromolecular decay KW - Markov processes KW - branching processes KW - long-time behaviour KW - makromolekularer Zerfall KW - Markovprozesse KW - Verzweigungsprozesse KW - Langzeitverhalten Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-401802 SN - 978-3-86956-414-2 SN - 2199-4951 SN - 2199-496X IS - 4 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - BOOK A1 - Van Leeuwen, Peter Jan A1 - Cheng, Yuan A1 - Reich, Sebastian T1 - Nonlinear data assimilation T3 - Frontiers in applied dynamical systems: reviews and tutorials ; 2 N2 - This book contains two review articles on nonlinear data assimilation that deal with closely related topics but were written and can be read independently. Both contributions focus on so-called particle filters. The first contribution by Jan van Leeuwen focuses on the potential of proposal densities. It discusses the issues with present-day particle filters and explorers new ideas for proposal densities to solve them, converging to particle filters that work well in systems of any dimension, closing the contribution with a high-dimensional example. The second contribution by Cheng and Reich discusses a unified framework for ensemble-transform particle filters. This allows one to bridge successful ensemble Kalman filters with fully nonlinear particle filters, and allows a proper introduction of localization in particle filters, which has been lacking up to now. Y1 - 2015 SN - 978-3-319-18346-6 SN - 978-3-319-18347-3 U6 - https://doi.org/10.1007/978-3-319-18347-3 PB - Springer CY - Cham ER - TY - JOUR A1 - van Leeuwen, Peter Jan A1 - Kunsch, Hans R. A1 - Nerger, Lars A1 - Potthast, Roland A1 - Reich, Sebastian T1 - Particle filters for high-dimensional geoscience applications: A review JF - Quarterly journal of the Royal Meteorological Society N2 - Particle filters contain the promise of fully nonlinear data assimilation. They have been applied in numerous science areas, including the geosciences, but their application to high-dimensional geoscience systems has been limited due to their inefficiency in high-dimensional systems in standard settings. However, huge progress has been made, and this limitation is disappearing fast due to recent developments in proposal densities, the use of ideas from (optimal) transportation, the use of localization and intelligent adaptive resampling strategies. Furthermore, powerful hybrids between particle filters and ensemble Kalman filters and variational methods have been developed. We present a state-of-the-art discussion of present efforts of developing particle filters for high-dimensional nonlinear geoscience state-estimation problems, with an emphasis on atmospheric and oceanic applications, including many new ideas, derivations and unifications, highlighting hidden connections, including pseudo-code, and generating a valuable tool and guide for the community. Initial experiments show that particle filters can be competitive with present-day methods for numerical weather prediction, suggesting that they will become mainstream soon. KW - hybrids KW - localization KW - nonlinear data assimilation KW - particle filters KW - proposal densities Y1 - 2019 U6 - https://doi.org/10.1002/qj.3551 SN - 0035-9009 SN - 1477-870X VL - 145 IS - 723 SP - 2335 EP - 2365 PB - Wiley CY - Hoboken ER -