Browsing by Title
Now showing items 339358 of 1935

1631  Computational Group Theory
[OWR201637] (2016)  (31 Jul  06 Aug 2016)This was the seventh workshop on Computational Group Theory. It showed that Computational Group Theory has significantly expanded its range of activities. For example, symbolic computations with groups and their representations ... 
0627  Computational Group Theory
[OWR200630] (2006)  (02 Jul  08 Jul 2006)This workshop on Computational Group Theory revealed the close connections between its main themes “finitely presented groups”, “permutation groups”, “matrix groups” and “representations of groups”. The meeting also presented ... 
1131  Computational Group Theory
[OWR201137] (2011)  (31 Jul  06 Aug 2011)This sixth workshop on Computational Group Theory proved that its main themes “finitely presented groups”, “$p$groups”, “matrix groups” and “representations of groups” are lively and active fields of research. The talks ... 
0131  Computational Group Theory
[TB200134] (2001)  (29 Jul  04 Aug 2001) 
1243  Computational Inverse Problems
[OWR201251] (2012)  (21 Oct  27 Oct 2012)Inverse problem typically deal with the identification of unknown quantities from indirect measurements and appear in many areas in technology, medicine, biology, finance, and econometrics. The computational solution of ... 
1720  Computational Inverse Problems for Partial Differential Equations
[OWR201724] (2017)  (14 May  20 May 2017)The problem of determining unknown quantities in a PDE from measurements of (part of) the solution to this PDE arises in a wide range of applications in science, technology, medicine, and finance. The unknown quantity may ... 
2050  Computational Inverse Problems for Partial Differential Equations (hybrid meeting)
[OWR202039] (2020)  (06 Dec  12 Dec 2020)Inverse problems in partial differential equations (PDEs) consist in reconstructing some part of a PDE such as a coefficient, a boundary condition, an initial condition, the shape of a domain, or a singularity from ... 
0925  Computational Multiscale Methods
[OWR200929] (2009)  (14 Jun  20 Jun 2009)Computational Multiscale Methods play an important role in many modern computer simulations in material sciences with different time scales and different scales in space. Besides various computational challenges, the meeting ... 
1931  Computational Multiscale Methods
[OWR201935] (2019)  (28 Jul  03 Aug 2019)Many physical processes in material sciences or geophysics are characterized by inherently complex interactions across a large range of nonseparable scales in space and time. The resolution of all features on all scales ... 
1426  Computational Multiscale Methods
[OWR201430] (2014)  (22 Jun  28 Jun 2014)Almost all processes in engineering and the sciences are characterised by the complicated relation of features on a large range of nonseparable spatial and time scales. The workshop concerned the computeraided simulation ... 
Computational Optimal Transport
[SNAP2017008EN] (Mathematisches Forschungsinstitut Oberwolfach, 20171221)Optimal transport is the mathematical discipline of matching supply to demand while minimizing shipping costs. This matching problem becomes extremely challenging as the quantity of supply and demand points increases; ... 
1610  Computationally and Statistically Efficient Inference for Complex Largescale Data
[OWR201616] (2016)  (06 Mar  12 Mar 2016)The aim of the highly successful workshop Computationally and statistically efficient inference for largescale and heterogeneous data was to foster dissemination and collaboration between researchers in the area of ... 
Computer Algebra with GAP
[OWP202303] (Mathematisches Forschungsinstitut Oberwolfach, 20230413)This monograph includes the following topics: a basic introduction to the language, basic arithmetic, permutations, matrices, polynomial rings, finite fields, finite and finitely presented groups, small groups, group ... 
Computing Congruence Quotients of Zariski Dense Subgroups
[OWP201822] (Mathematisches Forschungsinstitut Oberwolfach, 20181026)We obtain a computational realization of the strong approximation theorem. That is, we develop algorithms to compute all congruence quotients modulo rational primes of a finitely generated Zariski dense group $H \leq ... 
Computing the long term evolution of the solar system with geometric numerical integrators
[SNAP2017009EN] (Mathematisches Forschungsinstitut Oberwolfach, 20171227)Simulating the dynamics of the Sun–Earth–Moon system with a standard algorithm yields a dramatically wrong solution, predicting that the Moon is ejected from its orbit. In contrast, a well chosen algorithm with the ... 
Computing with symmetries
[SNAP2018003EN] (Mathematisches Forschungsinstitut Oberwolfach, 20180306)Group theory is the study of symmetry, and has many applications both within and outside mathematics. In this snapshot, we give a brief introduction to symmetries, and how to compute with them. 
Configuration spaces and braid groups
[SNAP2019011EN] (Mathematisches Forschungsinstitut Oberwolfach, 20191008)In this snapshot we introduce configuration spaces and explain how a mathematician studies their ‘shape’. This will lead us to consider paths of configurations and braid groups, and to explore how algebraic properties of ... 
Conformal Differential Geometry
[OWS40] (Birkhäuser Basel, 2010)Conformal invariants (conformally invariant tensors, conformally covariant differential operators, conformal holonomy groups etc.) are of central significance in differential geometry and physics. Wellknown examples of ... 
Congruences Associated with Families of Nilpotent Subgroups and a Theorem of Hirsch
[OWP201916] (Mathematisches Forschungsinstitut Oberwolfach, 20190527)Our main result associates a family of congruences with each suitable system of nilpotent subgroups of a finite group. Using this result, we complete and correct the proof of a theorem of Hirsch concerning the class number ... 
2215b  Conic Linear Optimization for ComputerAssisted Proofs
[OWR202220] (2022)  (10 Apr  16 Apr 2022)From a mathematical perspective, optimization is the science of proving inequalities. In this sense, computational optimization is a method for computerassisted proofs. Conic (linear) optimization is ...