BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ARCADES Network - ECPv4.6.19//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ARCADES Network
X-ORIGINAL-URL:http://arcades-network.eu
X-WR-CALDESC:Events for ARCADES Network
BEGIN:VEVENT
DTSTART;TZID=UTC:20180903T130000
DTEND;TZID=UTC:20180907T130000
DTSTAMP:20180621T234512
CREATED:20180201T101108Z
LAST-MODIFIED:20180525T060237Z
UID:2352-1535979600-1536325200@arcades-network.eu
SUMMARY:ARCADES Doctoral School II and ESR Days in Barcelona
DESCRIPTION: \n\nThe first week of September the 2nd ARCADES Doctoral School and the workshop ESR Days – organised by the ESRs\, will take place in Barcelona. \n\nLocation\n\nThe meeting will take place at the Institut de Matematiques of the University of Barcelona. \n\nRegistration\nRegistration is now open! Please register here no later than June 15th. \n\nSchedule of the event\nThe events will start on Monday early afternoon and will close on Friday early afternoon. \nThe following invited speakers have confirmed their participation:\nDavid Brander – Technical University of Denmark\nAlicia Dickenstein – University of Buenos Aires\nBert Jüttler – Johannes Kepler University Linz\nRosa Maria Miro Roig – University of Barcelona\nHal Schenck – Iowa State University\nMartin Sombra – ICREA & University of Barcelona\nCarla Manni – University of Rome Tor Vergata \nPreliminary schedule \n\n\n\n\n\n\n\n\n\n\n \n Monday\, Sept 3\n Tuesday\, Sept 4\n Wednesday\, Sept 5\n Thursday\, Sept 6\n Friday\, Sept 7\n\n\n 9:30\n –\n Bert Jüttler\n Hal Schenck\n Rosa Maria Miro Roig\n Fellow’s presentations and discussions\n\n\n 11:00\n –\n Coffee break\n Coffee break\n Coffee break\n Coffee break\n\n\n 11:30\n –\n Bert Jüttler\n Hal Schenck\n Rosa Maria Miro Roig\n Fellow’s presentations and discussions\n\n\n 13:00\n Lunch\n Lunch\n Lunch\n Lunch\n\n\n\n 14:30\n David Brander\n Carla Manni\n Alicia Dickenstein\n Cultural activity\n –\n\n\n 16:00\n Coffee break\n Coffee break\n Coffee break\n\n –\n\n\n 16:30\n Martin Sombra\n Carla Manni\n Alicia Dickenstein\n Cultural activity\n –\n\n\n 18:00\n University building tour\n Supervisory Board meeting\n Educational commitee meeting\n\n –\n\n\n\n Welcome reception (18:30)\n\n Project dinner (20:00)\n\n\n\n\n\n\n\nLodging\nAll participants are kindly requested to make their own accommodation arrangements. \nThere are some University Residences in Barcelona where you can get some reasonably priced rooms. You can check in www.resainn.com/en/accommodation/. \nBut we suggest you to use some hotel or apartment searcher\, like www.booking.com\, www.airbnb.com or similar\, to find other offers and options. \n\n\nTalks\nDesigning with elastic curves\nDavid Brander\, Technical University of Denmark \nPlanar elastic curves were used in the design of ships and aircraft in pre-CAD years\, via physical splines\, i.e.\, elastic rods held in position at a number of interpolation points by so-called ducks. In the digital setting however\, it turns out to be difficult to simulate physical splines\, mainly because of non-uniqueness of solutions for a given boundary value problem. Hence the standard in CAD is to use polynomial and rational splines. However\, planar elastic curves arise naturally in some manufacturing settings: for example hot-blade cutting\, a generalization to non-ruled surfaces of the well-known hot-wire cutting. To design or rationalize for this process require the use of elastic curves. \nIn this talk I discuss some approaches that lead to reliable methods for designing with elastic curves and elastic splines. \n \nMacaulay style formulae for the sparse resultant\nMartin Sombra\, ICREA & University of Barcelona\n \nThe sparse resultant is a classical object from elimination theory\, that been widely used in polynomial equation solving and that has strong connections with combinatorics\, toric geometry\, residue theory\, and hypergeometric functions. \nIn this talk\, I will review some of the matrix formulae for this object. The first ones go back to Cayley and Sylvester in the univariate case\, and to Macaulay in the dense multivariate case. Formulae for the sparse case were obtained by Canny-Emiris and by D’Andrea\, and simplified in a recent work in collaboration with D’Andrea and Jeronimo. \n \nTowards Efficient Matrix Assembly in Isogeometric Analysis\nBert Jüttler\, Johannes Kepler University Linz\n \nThe framework of Isogeometric Analysis was introduced by T.J.R. Hughes et al. in 2005 in order to enhance the interaction between geometric design and numerical simulation. In particular\, it aims to reconcile the representations of geometric objects which are used in software for Computer-Aided Design (CAD) with the mathematical technology of the finite element method (FEM). While this approach opens numerous new possibilities\, it also creates additional computational challenges. These include the need to finde new methods for performing matrix assembly. The talk will present several approaches for improving the efficiency of this process in isogeometric analysis. They combine results from approximation theory and numerical tensor calculus. \n \nTotal positivity in CAGD\nCarla Manni\, University of Rome Tor Vergata\n \nTotal positivity is a powerful concept permeating different areas of mathematics including approximation theory\, probability and statistics to mention a few. \nIn the context of Computer Aided Geometric Design (CAGD)\, total positivity is a key property: dealing with a total positive system/basis ensures variation diminishing and shape preserving properties of the considered representation. Moreover\, among the all possible normalized totally positive bases (if any) of a given space it is possible to identify those which are “optimal” from the geometric point of view. Bernstein polynomials and B-splines are optimal normalized totally positive bases for the polynomial and spline spaces respectively. \nAfter presenting the basic definition and properties of totally positive matrices\, we will introduce totally positive (normalized) bases and discuss their variation diminishing properties. Finally\, we will present the concept of geometrically optimal totally positive bases. The general theory will be discussed in detail for polynomial and spline spaces. \n \nGeometric modeling and syzygies\nHal Schenck\, Iowa State University \n \nUnderstanding the implicit equation and singular locus of a parametric object embedded in projective or affine space is a central problem in geometric modeling; such objects are used by companies as diverse as Pixar and Boeing. In particular\, this is a real-world problem of importance in manufacturing and image manipulation. There are typically three methods used to find the implicit equation(s) of the image of a map: Gröbner bases\, resultants\, and syzygies. We will focus on the third method. I’ll start with an overview of syzygies and Rees algebras\, then move on to other tools such as Fitting ideals\, the determinant of a complex\, approximation complexes\, and the McRae invariant. We’ll conclude by applying these tools to examples. \n \nIterated discriminants and singular space curves\nAlicia Dickenstein – University of Buenos Aires \nIn general\, two quadric surfaces intersect in a nonsingular quartic space curve\, but under special circumstances this intersection curve may degenerate to a finite number of different possible types of singular curves. These degenerate space curves are important since they occur frequently in practice and\, unlike the generic case\, they admit rational\nparameterizations. In the nice paper [3]\, the authors formulate the condition for a degenerate intersection\, which refines the study of the real case and with an algorithmic point of view the classical treatise [1]. Independently\, the condition for a degenerate intersection of two surfaces of tensor type (or more generally\, of two hypersurfaces described by multilinear equations) is studied in [4]. \nFolllowing joint work with S. di Rocco and R. Morrison in [2]\, I will present a general framework of iterated discriminants to characterize the singular intersection of hypersurfaces with a given monomial support\, which generalizes both previous situations. I will explain the notion of mixed discriminant and the relation with these iterated discriminants. \n[1] T. J. I’A. Bromwich: Quadratic forms and their classification by means of invariant-factors. Cambridge Univ. Press\, Cambridge\, Jbuch 37\, 1906. \n[2] A. Dickenstein\, S. di Rocco\, R. Morrison: Iterated multivariate discriminants and mixed discriminants\, Manuscript\, 2018. \n[3] R.T. Farouki\, C.A. Neff\, M.A. O’Connor: Automatic parsing of degenerate quadricsurface intersections\, ACM Transactions on Graphics 8 (3) (1989) 174-203. \n[4] L. Schläfli: Gesammelte mathematische Abhandlungen. Band II\, Verlag Birkhäuser\, Basel\, 1953. \n \nLiaison Theory with a view towards Algebraic Geometry\nRosa Maria Miro Roig\, University of Barcelona \nAbstract \n\nCultural activity\nTwo options are under consideration: a guided city tour and/or Sagrada Familia tour. This will be decided according to the preference of participants. \n\n
URL:http://arcades-network.eu/index.php/event/arcades-doctoral-school-ii-and-esr-days-in-barcelona/
LOCATION:Gran Via de les Corts Catalanes 585\, Barcelona\, 08007\, Spain
END:VEVENT
END:VCALENDAR