BEGIN:VCALENDAR
VERSION:2.0
PRODID:PHP
METHOD:REQUEST
TZID:Australia/Sydney
BEGIN:VTIMEZONE
TZID:Australia/Sydney
X-LIC-LOCATION:Australia/Sydney
BEGIN:DAYLIGHT
TZOFFSETFROM:+1000
TZOFFSETTO:+1100
TZNAME:AEDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+1100
TZOFFSETTO:+1000
TZNAME:AEST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=4;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20111121T143000
DTEND;TZID=Australia/Sydney:20111121T153000
SUMMARY:SIGMAopt Seminar
DESCRIPTION:SIGMAopt Seminar\nV206, Mathematics Building\n\n"A finite element method for density estimation with Gaussian process priors"\nMarkus Hegland\n\nAbstract:\nProbability densities are a major tool in exploratory statistics and stochastic modelling. I will talk about a numerical technique for the estimation of a probability distribution from scattered data using exponential families and a maximum a-posteriori approach with Gaussian process priors.\nUsing Cameron-Martin theory, it can be seen that density estimation leads to a nonlinear variational problem with a functional defined on a reproducing kernel Hilbert space. This functional is strictly convex. A dual problem based on Fenchel duality will also be given. The (original) problem is solved using a Newton-Galerkin method with damping for global convergence. In this talk I will discuss some theoretical results relating to the numerical solution of the variational problem and the results of some computational experiments. A major challenge is of course the curse of dimensionality which appears when high-dimensional probability distributions are estimated.
UID:172
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20111118T125829
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20111124T150000
DTEND;TZID=Australia/Sydney:20111124T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV129, Mathematics Building\n\n"Dependent Random Choice III"\nDr Thomas Kalinowski\n\nAbstract:\nThomas will be finishing his talks this Thursday where he will finish looking at (parts of) the survey paper Dependent Random Choice by Jacob Fox and Benny Sudakov: http://arxiv.org/abs/0909.3271
UID:173
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20111122T100436
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20111129T090000
DTEND;TZID=Australia/Sydney:20111201T170000
SUMMARY:CARMA Workshop
DESCRIPTION:CARMA Workshop\nV205, Mathematics Building\n\nWORKSHOP on EXPERIMENTAL and ANALYTICAL MATHEMATICS Marking the occasion of Jonathan Borwein's 60th birthday\n\nConference website: http://carma.newcastle.edu.au/jonfest/
UID:144
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20110824T102931
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20111209T100000
DTEND;TZID=Australia/Sydney:20111209T110000
SUMMARY:SIGMAopt Seminar/OCANA Seminar
DESCRIPTION:SIGMAopt Seminar/OCANA Seminar\nV206, Mathematics Building\n\n"The asymmetric sandwich theorem"\nStephen Simons\n\nAbstract:\nWe discuss the asymmetric sandwich theorem, a generalization of the Hahn–Banach\ntheorem. As applications, we derive various results on the existence of linear functionals\nin functional analysis that include bivariate, trivariate and quadrivariate generalizations\nof the Fenchel duality theorem. We consider both results that use a simple boundedness\nhypothesis (as in Rockafellar’s version of the Fenchel duality theorem) and also results\nthat use Baire’s theorem (as in the Robinson–Attouch–Brezis version of the Fenchel\nduality theorem).
UID:176
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20111205T092549
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20111215T140000
DTEND;TZID=Australia/Sydney:20111215T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV129, Mathematics Building\n\n"Analytic combinatorics of lattice paths with small steps in the quarter plane"\nSamuel Johnson\n\nAbstract:\nLattice paths effectively model phenomena in chemistry, physics and probability theory. Techniques of analytic combinatorics are very useful in determining asymptotic estimates for enumeration, although asymptotic growth of the number of Self Avoiding Walks on a given lattice is known empirically but not proved. We survey several families of lattice paths and their corresponding enumerative results, both explicit and asymptotic. We conclude with recent work on combinatorial proofs of asymptotic expressions for walks confined by two boundaries.\n"Hamilton Surface Decompositions of Cartesian Products of Graphs"\nprof. dr. Tomaž Pisanski\n\nAbstract:\nA Hamilton surface decomposition of a graph is a decomposition of the collection of shortest cycles in such a way that each member of the decomposition determines a surface (with maximum Euler characteristic). Some sufficient conditions for Hamilton surface decomposition of cartesian products of graphs are obtained. Necessary and sufficient conditions are found for the case when factors are even cycles.
UID:174
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20111122T100902
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20111215T160000
DTEND;TZID=Australia/Sydney:20111215T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"Minimal Faithful Permutation Representations of Finite Groups "\nDr Neil Saunders\n\nAbstract:\nThe minimal degree of a finite group $G$ is the smallest non-negative integer $n$ such that $G$ embeds in $\Sym(n)$. This defines an invariant of the group $\mu(G)$.  In this talk, I will present some interesting examples of calculating  $\mu(G)$ and examine how this invariant behaves under taking direct products and homomorphic images.\nIn particular, I will focus on the problem of  determining the smallest degree for which we obtain a strict inequality $\mu(G \times H) < \mu(G) + \mu(H)$, for two groups $G$ and $H$. The answer to this questions also leads us to consider the problem of  exceptional permutation groups. These are groups $G$ that possess a normal subgroup $N$ such that $\mu(G/N) > \mu(G)$. They are somewhat mysterious in the sense that a particular homomorphic image becomes 'harder' to faithfully represent than the group itself. I will present some recent examples of exceptional groups and detail recent developments in the 'abelian quotients conjecture' which states that $\mu(G/N) < \mu(G)$, whenever $G/N$ is abelian.
UID:177
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20111213T143600
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120110T150000
DTEND;TZID=Australia/Sydney:20120110T160000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"Complexity of and Algorithms for Borda Manipulation"\nNina Narodytska\n\nAbstract:\nWe prove the it is NP-hard for a coalition of two\nmanipulators to compute how to manipulate the Borda voting rule.\nThis resolves one of the last open problems in the computational\ncomplexity of manipulating common voting rules. Because\nof this NP-hardness, we treat computing a manipulation\nas an approximation problem where we try to minimize\nthe number of manipulators. Based on ideas from bin packing\nand multiprocessor scheduling, we propose two new approximation\nmethods to compute manipulations of the Borda\nrule. Experiments show that these methods significantly outperform\nthe previous best known approximation method. We\nare able to find optimal manipulations in almost all the randomly\ngenerated elections tested. Our results suggest that,\nwhilst computing a manipulation of the Borda rule by a coalition\nis NP-hard, computational complexity may provide only\na weak barrier against manipulation in practice.\n\nWe also consider  Nanson’s and Baldwin’s voting rules that\nselect a winner by successively eliminating candidates with low\nBorda scores. We theoretically and experimentally\ndemonstrate that these rules are significantly\nmore difficult to manipulate compared to Borda rule.\nIn particular, with unweighted votes, it\nis NP-hard to manipulate either rule with one manipulator,\nwhilst with weighted votes, it is NP-hard to manipulate either\nrule with a small number of candidates and a coalition of manipulators.\n
UID:179
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120109T141511
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120123T140000
DTEND;TZID=Australia/Sydney:20120123T150000
SUMMARY:CARMA Optimization Seminar
DESCRIPTION:CARMA Optimization Seminar\nV205, Mathematics Building\n\n"Packing Ellipsoids and Circles (with Application to Chromosome Arrangement)"\nConjoint Prof Steve Wright\n\nAbstract:\nWe consider the problem of packing ellipsoids of different size and shape in an ellipsoidal container so as to minimize a measure of total overlap. The motivating application is chromosome organization in the human cell nucleus. A bilevel optimization formulation is described, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. We prove convergence to stationary points of this nonconvex problem, and describe computational experience.  The talk describes joint work with Caroline Uhler (IST, Vienna).
UID:180
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120118T093559
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120124T140000
DTEND;TZID=Australia/Sydney:20120124T150000
SUMMARY:NUOR Seminar
DESCRIPTION:NUOR Seminar\nV129, Mathematics Building\n\n"Margining Option Portfolios by Network Flows"\nDmytro Matsypura\n\nAbstract:\nHaving been constructed as trading strategies, option spreads are\nalso used in margin calculations for offsetting positions in\noptions. All option spreads that appear in trading and margining\npractice have two, three or four legs. As shown in Rudd and\nSchroeder (Management Sci, 1982), the problem of margining option\nportfolios where option spreads with two legs are used for\noffsetting can be solved in polynomial time by network flow\nalgorithms. However, spreads with only two legs do not provide\nsufficient accuracy in measuring risk. Therefore, margining practice\nalso employs spreads with three and four legs. A polynomial-time\nsolution to the extension of the problem where option spreads with\nthree and four legs are also used for offsetting is not known. We\npropose a heuristic network-flow algorithm for this extension and\npresent a computational study that demonstrates high efficiency of\nthe proposed algorithm in margining practice.\n
UID:181
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120123T114350
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120207T140000
DTEND;TZID=Australia/Sydney:20120207T150000
SUMMARY:CARMA Show-and-Tell
DESCRIPTION:CARMA Show-and-Tell\nV205, Mathematics Building\n\nLike last summer, we are running "show and tell" summer seminars.  Please come along to hear what everyone is doing and be prepared to spend 10-15 minutes reporting on your work.
UID:183
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120202T163133
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120209T100000
DTEND;TZID=Australia/Sydney:20120209T110000
SUMMARY:SIGMAopt Seminar/OCANA Seminar
DESCRIPTION:SIGMAopt Seminar/OCANA Seminar\nV206, Mathematics Building\n\n"A first-order method for finding minimal norm-like solutions of convex optimization problems"\nMr Shoham Sabach\n\nAbstract:\nWe consider a general class of convex optimization problems in which one seeks to minimize a strongly convex function over a closed and convex set which is by itself an optimal set of another convex problem. We introduce a gradient-based method, called the minimal norm gradient method, for solving this class of problems, and establish the convergence of the sequence generated by the algorithm as well as a rate of convergence of the sequence of function values. A portfolio optimization example is given in order to illustrate our results.
UID:178
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20111214T084824
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120209T160000
DTEND;TZID=Australia/Sydney:20120209T170000
SUMMARY:CARMA Colloquium
DESCRIPTION:CARMA Colloquium\nV129, Mathematics Building\n\n"Closure techniques for cycles and paths in graphs"\nProf Zdenek Ryjacek\n\nAbstract:\nGraph closures became recently an important tool in Hamiltonian Graph Theory since the use of closure techniques often substantially simplifies the structure of a graph under consideration while preserving some of its prescribed properties (usually of Hamiltonian type). In the talk we show basic ideas of construction of some graph closures for claw-free graphs and techniques that allow to reduce the problem to cubic graphs. The approach will be illustrated on a recently introduced closure concept for Hamilton-connectedness in claw-free graphs and, as an application, an asymptotically sharp Ore-type degree condition for Hamilton-connectedness in claw-free graphs will be obtained.
UID:184
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120206T102733
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120214T140000
DTEND;TZID=Australia/Sydney:20120214T150000
SUMMARY:CARMA Show-and-Tell
DESCRIPTION:CARMA Show-and-Tell\nV205, Mathematics Building\n\nWe will be running a "show and tell" summer seminar.  This is for students and RAs to tell and inform others of their work.  Please come along to hear what everyone is doing and be prepared to spend 10-15 minutes reporting on your work.
UID:188
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120213T114054
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120221T150000
DTEND;TZID=Australia/Sydney:20120221T160000
SUMMARY:CARMA Analysis Seminar
DESCRIPTION:CARMA Analysis Seminar\nV129, Mathematics Building\n\n"Investigations of some Stieltjes functions and some completely monotonic  functions"\nProf David Jeffrey\n\nAbstract:\nTwo sets of functions are studied to ascertain whether they are \nStieltjes functions and whether they are completely monotonic. The first \ngroup of functions are all built from the Lambert $W$ function.\nThe $W$ function will be reviewed briefly. It will be shown that $W$ is \nBernstein and various functions containing $W$ are Stieltjes. Explicit \nexpressions for the Stieltjes transforms are obtained. We also give some \nnew results regarding general Stieltjes functions.\nThe second set of functions were posed as a challenge by Christian Berg \nin 2002. The functions are $(1+a/x)^{(x+b)}$ for various $a$ and $b$.\nWe show that the functions is Stieltjes for some ranges of $a,b$ and \ninvestigate experimentally complete monotonicity for a larger range.\nWe claim an accurate experimental value for the range.\nMy co-authors are Rob Corless, Peter Borwein, German Kalugin and Songxin \nLiang.
UID:185
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120208T103955
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120223T150000
DTEND;TZID=Australia/Sydney:20120223T160000
SUMMARY:AMSI Event
DESCRIPTION:AMSI Event\n, Isabella's\n\nPhD Internship Workshop\n\nAll FSCIT RHD students have been invited to attend the Australian Mathematical Sciences Institute (AMSI) PhD Internship (informal) workshop on Thursday 23 February 2012 at 3.00pm.  Any Faculty RHD Supervisors/Mentors who may be interested in this great opportunity are encouraged to attend.
UID:182
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120202T162004
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120223T160000
DTEND;TZID=Australia/Sydney:20120223T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"A simplified proof of Hesselholts conjecture on Galois cohomology of Witt vectors of algebraic integers"\nWilson Ong\n\nAbstract:\nLet $K$ be a complete discrete valuation field of characteristic zero with residue field $k_K$ of characteristic $p > 0$. Let $L/K$ be a finite Galois extension with Galois group $G = \text{Gal}(L/K)$ and suppose that the induced extension of residue fields $k_L/k_K$ is separable. Let $W_n(.)$ denote the ring of $p$-typical Witt vectors of length $n$. Hesselholt [Galois cohomology of Witt vectors of algebraic integers, Math. Proc. Cambridge Philos. Soc. 137(3) (2004), 551557] conjectured that the pro-abelian group ${H^1(G,W_n(O_L))}_{n>0}$ is isomorphic to zero. Hogadi and Pisolkar [On the cohomology of Witt vectors of $p$-adic integers and a conjecture of Hesselholt, J. Number Theory 131(10) (2011), 17971807] have recently provided a proof of this conjecture. In this talk, we present a simplified version of the original proof which avoids many of the calculations present in that version.
UID:187
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120213T100824
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120228T150000
DTEND;TZID=Australia/Sydney:20120228T160000
SUMMARY:CARMA Analysis Seminar
DESCRIPTION:CARMA Analysis Seminar\nV129, Mathematics Building\n\n"The Method of Darboux Transformations for Partial Differential  operators"\nEkaterina Shemyakova\n\nAbstract:\nIntegrability theory is the area of mathematics in which methods are developed for the exact solution of partial differential \nequations, as well as for the study of their properties. We concentrate on PDEs appearing in Physics and other applications. Darboux transformations constitute one of the important methods used in integrability theory and, as well as being a method for the exact solution of linear PDEs, they are an essential part of the method of Lax pairs, used for the solution of non-linear PDEs. A large series of Darboux transformations may be constructed using Wronskians built from some number of individual solutions of the original PDE. In this talk we prove a long-standing conjecture that this construction captures all possible Darboux transformations for transformations of order two, while for transformations of order one the construction captures \neverything but two Laplace transformations. An introduction into the theory will be provided.
UID:186
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120208T104058
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120301T160000
DTEND;TZID=Australia/Sydney:20120301T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"On connections between neighbour transitive codes and power line communication"\nMr Neil Gillespie\n\nAbstract:\nPower line communication has been proposed as a possible solution to the "last mile" problem in telecommunications i.e. providing economical high speed telecommunications to millions of end users. As well as the usual background interference (noise), two other types of noise must also be considered for any successful practical implementation of power line communication. Coding schemes have traditionally been designed to deal only with background noise, and in such schemes it is often assumed that background noise affects symbols in codewords independently at random. Recently, however, new schemes have been proposed to deal with the extra considerations in power line communication. We introduce neighbour transitive codes as a group theoretic analogue to the assumption that background noise affects symbols independently at random. We also classify a family of neighbour transitive codes, and show that such codes have the necessary properties to be useful in power line communication.
UID:189
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120227T141207
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120302T100000
DTEND;TZID=Australia/Sydney:20120302T110000
SUMMARY:NUOR Seminar
DESCRIPTION:NUOR Seminar\nV129, Mathematics Building\n\n"Scenario Grouping in Methods for Stochastic Network Design"\nMike Hewitt\n\nAbstract:\nWe present a technique for enhancing a progressive hedging-based metaheuristic for a network design problem that models demand uncertainty with scenarios. The technique uses machine learning methods to cluster scenarios and, subsequently, the metaheuristic repeatedly solves multi-scenario subproblems (as opposed to single-scenario subproblems as is done in existing work). With a computational study we see that solving multi-scenario subproblems leads to a significant increase in solution quality and that how you construct these multi-scenario subproblems directly impacts solution quality. We also discuss how scenario grouping can be leveraged in a Benders' approach and show preliminary results of its effectiveness. This is joint work with Theo Crainic and Walter Rei at University of Quebec at Montreal.
UID:191
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120301T120106
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120302T120000
DTEND;TZID=Australia/Sydney:20120302T130000
SUMMARY:Summer Scholar Presentations
DESCRIPTION:Summer Scholar Presentations\nV206, Mathematics Building\n\nPresentations from this years' summer scholars. See attached programme for details.
UID:190
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120227T141615
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120306T130000
DTEND;TZID=Australia/Sydney:20120306T140000
SUMMARY:CARMA Analysis and Number Theory Seminar
DESCRIPTION:CARMA Analysis and Number Theory Seminar\nV129, Mathematics Building\n\n"On firmly nonexpansive mappings with an introduction to geodesic metric spaces"\nMr David Ariza-Ruiz\n\nAbstract:\nWe start this talk by introducing some basic definitions and properties relative to geodesic in the setting of metric spaces. After showing some important examples of geodesic metric spaces (which will be used through this talk), we shall define the concept of firmly nonexpansive mappings and we shall prove the existence, under mild conditions, of periodic points and fixed points for this class of mappings. Some of these results unify and generalize previous ones. We shall give a result relative to the $\Delta$-convergence to a fixed point of Picard iterates for firmly nonexpansive mappings, which is obtained from the asymptotic regularity of this class of iterates. Moreover, we shall get an effective rate of asymptotic regularity for firmly nonexpansive mappings (this result is new, as far as we know, even in linear spaces). Finally, we shall apply our results to a minimization problem. More precisely, we shall prove the $\Delta$-convergence to a minimizer of a proximal point-like algorithm when applied to a convex proper lower semi-continuous function defined on a CAT(0) space.\n
UID:192
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120305T103835
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120308T150000
DTEND;TZID=Australia/Sydney:20120308T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV205, Mathematics Building\n\n"Designs, Groups and Linear Algebra"\nDon Kreher\n\nAbstract:\nThe Discrete Mathematics Instructional Seminar will be getting underway again this Thursday.
UID:196
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120305T165134
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120312T090000
DTEND;TZID=Australia/Sydney:20120316T170000
SUMMARY:CARMA and AMSI Conference
DESCRIPTION:CARMA and AMSI Conference\n, Noah's On the Beach \n( Campus, Newcastle, NSW)\n\nInternational Number Theory Conference in Memory of Alf van der Poorten, AM\n\nFor information, visit the conference website.
UID:113
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:-00011130T000000
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120313T150000
DTEND;TZID=Australia/Sydney:20120313T160000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV205, Mathematics Building\n\n"hp-adaptive DG-FEM for Parabolic Obstacle Problems"\nErnst Stephan\n\nAbstract:\nParabolic obstacle problems find applications in the financial markets for pricing American put options. We present a mixed and an equivalent variational inequality hp-interior penalty DG (IPDG) method combined with an hp-time DG (TDG) method to solve parabolic obstacle problems approximatively. The contact conditions are resolved by a biorthogonal Lagrange multiplier and are component-wise decoupled. These decoupled contact conditions are equivlent to finding the root of a non-linear complementary function. This non-linear problem can in turn be solved efficiently by a semi-smooth Newton method. For the hp-adaptivity a p-hierarchical error estimator in conjunction with a local analyticity estimate is employed. For the considered stationary problem, this leads to exponential convergence, and for the instationary problem to greatly improved convergence rates. Numerical experiments are given demonstrating the strengths and limitations of the approaches.\n
UID:197
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120308T112601
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120315T150000
DTEND;TZID=Australia/Sydney:20120315T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV206, Mathematics Building\n\n"Designs, Groups and Linear Algebra - Part 2"\nDon Kreher
UID:198
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120312T142310
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120321T180000
DTEND;TZID=Australia/Sydney:20120321T190000
SUMMARY:ASOR Seminar
DESCRIPTION:ASOR Seminar\nV206, Mathematics Building\n\n"Incremental Network Design with Shortest Paths"\nProf Martin Savelsbergh\n\nAbstract:\nNetwork infrastructures are a common phenomenon. Network upgrades\nand expansions typically occur over time due to budget constraints.\nWe introduce a class of incremental network design problems that\nallow investigation of many of the key issues related to the choice\nand timing of infrastructure expansions and their impact on the\ncosts of the activities performed on that infrastructure. We focus\non the simplest variant: incremental network design with shortest\npaths, and show that even its simplest variant is NP-hard. We\ninvestigate structural properties of optimal solutions, we analyze\nthe worst-case performance of natural greedy heuristics, we derive a\n4-approximation algorithm, and we present an integer program\nformulation and conduct a small computational study.\n\nJoint work with\n\nMatthew Baxter\nTarek Elgindy\nAndreas Ernst\nCSIRO Mathematics Informatics and Statistics\n\nThomas Kalinowski\nInstitute for Mathematics\nUniversity of Rostock, Germany
UID:202
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120320T115118
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120322T150000
DTEND;TZID=Australia/Sydney:20120322T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV206, Mathematics Building\n\n"Designs, Groups and Linear Algebra - Part 3"\nDon Kreher
UID:200
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120319T103817
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120322T160000
DTEND;TZID=Australia/Sydney:20120322T170000
SUMMARY:SIGMAopt Seminar
DESCRIPTION:SIGMAopt Seminar\nV205, Mathematics Building\n\n"Selection theorems in optimization"\nLaureate Prof Jon Borwein\n\nAbstract:\nSelection theorems assert that one can pick a well behaved function from a corresponding multifunction. They play a very important role in modern optimization theory. I will survey their structure and some applications before sketching some important open research problems.
UID:193
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120305T112740
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120323T140000
DTEND;TZID=Australia/Sydney:20120323T150000
SUMMARY:AMSI Event
DESCRIPTION:AMSI Event\nV205, Mathematics Building\n\n"Metrical musings on Littlewood and friends"\nProf Simon Kristensen\n\nAbstract:\nThe celebrated Littlewood conjecture in Diophantine approximation concerns the simultaneous approximation of two real numbers by rationals with the same denominator. A cousin of this conjecture is the mixed Littlewood conjecture of de Mathan and Teulié, which is concerned with the approximation of a single real number, but where some denominators are preferred to others.\nIn the talk, we will derive a metrical result extending work of Pollington and Velani on the Littlewood conjecture. Our result implies the existence of an abundance of numbers satisfying both conjectures.
UID:199
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120319T103138
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120327T100000
DTEND;TZID=Australia/Sydney:20120327T123000
SUMMARY:PhD Confirmation Seminar
DESCRIPTION:PhD Confirmation Seminar\nV31, Mathematics Building\n\n10.00-10.30 am: Michael Rose11.00-11.30 am: Daniel Sutherland12.00 noon-12.30 pm - Chris Banks20 minute presentations followed by 10 minutes of questions and discussion.
UID:201
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120320T110449
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120329T150000
DTEND;TZID=Australia/Sydney:20120329T160000
SUMMARY:SIGMAopt Seminar
DESCRIPTION:SIGMAopt Seminar\nV205, Mathematics Building\n\n"Selection theorems in optimization, Part II: Applications"\nLaureate Prof Jon Borwein\n\nAbstract:\nSelection theorems assert that one can pick a well behaved function from a corresponding multifunction. They play a very important role in modern optimization theory. In Part I, I will survey their structure and some applications before sketching some important applications and open research problems in Part II.
UID:206
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120326T115107
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120330T153000
DTEND;TZID=Australia/Sydney:20120330T163000
SUMMARY:AMSI Access Grid Seminar
DESCRIPTION:AMSI Access Grid Seminar\nV206, Mathematics Building\n\nPersons outside the School of Mathematical and Physical Sciences should RSVP to agr@newcastle.edu.au.\n\n"A Tighten-and-Branch ILP Algorithm Framework under Generalized Formulation"\nDr Yanqun Liu\n\nAbstract:\nIn this talk, we present a numerical method for a class of generalized inequality constrained integer linear programming (GILP) problems that includes the usual mixed-integer linear programming (MILP) problems as special cases. Instead of restricting certain variables to integer values as in MILP, we require in these GILP problems that some of the constraint functions take integer values. We present a tighten-and-branch method that has a number of advantages over the usual branch-and-cut algorithms. This includes the ability of keeping the number of constraints unchanged for all subproblems throughout the solution process and the capability of eliminating equality constraints. In addition, the method provides an algorithm framework that allows the existing cutting-plane techniques to be incorporated into the tightening process. As a demonstration, we will solve a well-known "hard ILP problem".
UID:208
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120327T145235
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120403T130000
DTEND;TZID=Australia/Sydney:20120403T140000
SUMMARY:CARMA Colloquium
DESCRIPTION:CARMA Colloquium\nV206, Mathematics Building\n\n"First Encounters of a Chebfun Novice"\nProf Robert Corless\n\nAbstract:\nSymbolic and numeric computation have been distinguished by definition: numeric computation puts numerical values in its variables as soon as possible, symbolic computation as late as possible. Chebfun blurs this distinction, aiming for the speed of numerics with the generality and flexibility of symbolics.  What happens when someone who has used both Maple and Matlab for decades, and has thereby absorbed the different fundamental assumptions into a "computational stance", tries to use Chebfun to solve a variety of computational problems? This talk reports on some of the outcomes.
UID:210
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120329T124557
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120403T150000
DTEND;TZID=Australia/Sydney:20120403T160000
SUMMARY:SIGMAopt Seminar
DESCRIPTION:SIGMAopt Seminar\nV205, Mathematics Building\n\n"A new look at nonnegativity and polynomial optimization"\nDr Jean Lasserre
UID:203
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120322T101021
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120404T090000
DTEND;TZID=Australia/Sydney:20120404T100000
SUMMARY:AMSI Access Grid Seminar
DESCRIPTION:AMSI Access Grid Seminar\nV206, Mathematics Building\n\nATTENDEES FROM OUTSIDE MATHS SHOULD RSVP TO agr@newcastle.edu.au DUE TO LIMITED ROOM CAPACITY. \n\n"Planning and Control of Massive Networks "\nDr David Hill\n\nAbstract:\nThe modernization of infrastructure networks requires coordinated planning and control. Considering traffic networks and electricity grids raises similar issues on how to achieve substantial  new capabilities of effectiveness and efficiency. For instance, power grids need to integrate renewable energy sources and electric vehicles. It is clear that all this can only be achieved by greater reliance on  systematic planning in the presence of uncertainty and sensing, communications, computing and control on an unprecedented scale, these days captured in the term "smart grids". This talk will outline current research on planning future grids and control of smart grids. In particular, the possible roles of network science will be emphasized and the challenges arising.
UID:209
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120327T161821
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120404T110000
DTEND;TZID=Australia/Sydney:20120404T160000
SUMMARY:CARMA Number Theory Short Course
DESCRIPTION:CARMA Number Theory Short Course\nV205, Mathematics Building\n\n11:00 am - 1:30 pm and 2:30 pm - 4:00 pm\n\n"Hilbert's 7th Problem"\nAssoc Prof Wadim Zudilin\n\nAbstract:\nThe problem posed by Hilbert in 1900 was resolved in the 1930s independently by A. Gelfond and Th. Schneider. The statement is that $a^b$ is transcendental for algebraic $a \ne 0,1$ and irrational algebraic $b$. The aim of the two 2-hour lectures is to give a proof of this result using the so-called method of interpolation determinants.
UID:207
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120327T124438
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120405T093000
DTEND;TZID=Australia/Sydney:20120405T103000
SUMMARY:SIGMAopt Seminar/OCANA Seminar
DESCRIPTION:SIGMAopt Seminar/OCANA Seminar\nV205, Mathematics Building\n\n"Pathological maximal monotone operators"\nLaureate Prof Jon Borwein\n\nAbstract:\nIn this paper, we construct maximally monotone operators that are not of Gossez's dense-type (D) in many nonreflexive spaces. Many of these operators also fail to possess the Br&oslash;nsted-Rockafellar (BR) property. Using these operators, we show that the partial inf-convolution of two BC-functions will not always be a BC-function. This provides a negative answer to a challenging question posed by Stephen Simons. Among other consequences, we deduce that every Banach space which contains an isomorphic copy of the James space J or its dual $J^*$, or of $c_0$ or its dual $l^1$ admits a non type (D) operator.
UID:195
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120305T113324
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120405T150000
DTEND;TZID=Australia/Sydney:20120405T160000
SUMMARY:CARMA Colloquium
DESCRIPTION:CARMA Colloquium\nV205, Mathematics Building\n\n"Moments, Positive Polynomials and Semidefinite Programming"\nDr Jean Lasserre
UID:204
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120322T101136
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120405T160000
DTEND;TZID=Australia/Sydney:20120405T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"Automorphisms of geometric structures associated to Coxeter groups"\nGraham White\n\nAbstract:\nIn this talk, we consider the automorphism groups of the Cayley graph with respect to the Coxeter generators and the Davis complex of an arbitrary Coxeter group. We determine for which Coxeter groups these automorphism groups are discrete. In the case where they are discrete, we express them as semidirect products of two obvious families of automorphisms. This extends a result of Haglund and Paulin.
UID:211
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120403T100805
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120411T150000
DTEND;TZID=Australia/Sydney:20120411T160000
SUMMARY:SIGMAopt Seminar
DESCRIPTION:SIGMAopt Seminar\nV205, Mathematics Building\n\n(Rescheduled from 10th April)\n\n"Sublevel sets of positively homogeneous functions and non-Gaussian integrals"\nDr Jean Lasserre\n\nAbstract:\nWe investigate various properties of the sublevel set $\{x : g(x) \leq 1\}$ and the integration of $h$ on this sublevel set when $g$ and $h$ are positively homogeneous functions. For instance, the latter integral reduces to integrating $h\exp(- g)$ on the whole space $\mathbb{R}^n$ (a non-Gaussian integral) and when $g$ is a polynomial, then the volume of the sublevel set is a convex function of its coefficients.\nIn fact, whenever $h$ is non-negative, the functional $\int \phi(g)h dx$ is a convex function of $g$ for a large class of functions $\phi:\mathbb{R}_{+} \to \mathbb{R}$. We also provide a numerical approximation scheme to compute the volume or integrate $h$  (or, equivalently, to approximate the associated non-Gaussian integral). We also show that finding the sublevel set $\{x : g(x) \leq 1\}$ of minimum volume that contains some given subset $K$ is a (hard) convex optimization problem for which we also propose two convergent numerical schemes. Finally, we provide a Gaussian-like property of non-Gaussian integrals for homogeneous polynomials that are sums of squares and critical points of a specific function.
UID:205
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120322T101258
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120412T111500
DTEND;TZID=Australia/Sydney:20120412T121500
SUMMARY:Seminar
DESCRIPTION:Seminar\nV109, Mathematics Building\n\n"An Introduction to Simultaneous Localisation and Mapping"\nDr Roger Stuckey\n\nAbstract:\nSimultaneous Localisation and Mapping (SLAM) has become prominent in the field of robotics over the last decade, particularly in application to autonomous systems. SLAM enables any system equipped with exteroceptive (and often inertial) sensors to simultaneously update its own positional estimate and map of the environment by utilising information collected from the surroundings. The solution to the probabilistic SLAM problem can be derived using Bayes Theorem to yield estimates of the system state and covariance. In recursive form, the basic prediction-correction algorithm employs an Extended Kalman Filter (EKF) with Cholesky decomposition for numerical stability during inversion. This talk will present the mathematical formulation and solution of the SLAM problem, along with some algorithms used in implementation. We will then look at some applications of SLAM in the real world and discuss some of the challenges for future development.
UID:212
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120411T085900
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120412T150000
DTEND;TZID=Australia/Sydney:20120412T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nV129, Mathematics Building\n\n"The Anatomy of a Famous Conjecture"\nProf Brian Alspach\n\nAbstract:\nIn my opinion, the most significant unsolved problem in graph decompositions is the cycle double conjecture.  This begins a series of talks on this conjecture in terms of background, relations to other problems and partial results.
UID:213
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120411T090921
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120412T160000
DTEND;TZID=Australia/Sydney:20120412T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"Graph decomposition and the Oberwolfach problem"\nDarryn Bryant\n\nAbstract:\nThis will be an introductory talk which begins by describing the four colour theorem and finite projective planes in the setting of graph decompositions. A problem posed by Ringel at a graph theory meeting in Oberwolfach in 1967 will then be discussed. This problem is now widely known as the Oberwolfach Problem, and is a generalisation of a question asked by Kirkman in 1850. It concerns decompositions of complete graphs into isomorphic copies of spanning regular graphs of degree two.
UID:214
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120411T091217
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120419T093000
DTEND;TZID=Australia/Sydney:20120419T103000
SUMMARY:SIGMAopt Seminar/OCANA Seminar
DESCRIPTION:SIGMAopt Seminar/OCANA Seminar\nV205, Mathematics Building\n\n(Rescheduled from 29 March.)\n\n"A structure theorem for maximally monotone operators with points of continuity"\nDr Liangjin Yao\n\nAbstract:\nIn this talk, we consider the structure of maximally monotone operators in Banach space whose domains have nonempty interior and we present new and explicit structure formulas for such operators. Along the way, we provide new proofs of the norm-to-weakstar closedness and property (Q) of these operators (recently established by Voisei). Various applications and limiting examples are given.  This is the joint work with Jon Borwein.
UID:194
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120305T112837
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120419T150000
DTEND;TZID=Australia/Sydney:20120419T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nMC110, McMullin Building\n\n"The Anatomy of a Famous Conjecture"\nProf Brian Alspach\n\nAbstract:\nBrian Alspach will continue with "The Anatomy of a Famous Conjecture" this Thursday.  One can easily pick up the thread this week without having attended last week, but if you miss this week it will not be easy to join in next week.
UID:218
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120416T120654
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120419T160000
DTEND;TZID=Australia/Sydney:20120419T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"The Coxeter Group Project: A Progress Report"\nProf Brian Alspach\n\nAbstract:\nI have embarked on a project of looking for Hamilton paths in Cayley graphs on finite Coxeter groups.  This talk is a report on the progress thus far.
UID:217
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120413T155644
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120420T140000
DTEND;TZID=Australia/Sydney:20120420T150000
SUMMARY:AMSI Access Grid Seminar
DESCRIPTION:AMSI Access Grid Seminar\nV206, Mathematics Building\n\n"A tale of two $G_2$"\nProf Boris Kruglikov\n\nAbstract:\nExceptional Lie group $G_2$ is a beautiful 14-dimensional continuous group, having relations with such diverse notions as triality, 7-dimensional cross product and exceptional holonomy. It was found abstractly by Killing in 1887 (complex case) and  then realized as a symmetry group by Engel and Cartan in 1894 (real split case). Later in 1910 Cartan returned to the topic and realized split $G_2$ as the maximal finite-dimensional symmetry algebra of a rank 2 distribution in $\mathbb{R}^5$. In other words, Cartan classified all symmetry groups of Monge equations of the form $y'=f(x,y,z,z',z'')$. I will discuss the higher-dimensional generalization of this fact, based on the joint work with Ian Anderson. Compact real form of $G_2$ was realized by Cartan as the automorphism group of octonions in 1914. In the talk I will also explain how to realize this $G_2$ as the maximal symmetry group of a geometric object.
UID:215
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120412T153853
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120423T120000
DTEND;TZID=Australia/Sydney:20120423T160000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n
 12:00-1:00Michael Coons (University of Waterloo)
 1:00-2:00Claus Koestler (Aberystwyth University)
 2:00-3:00Eric Mortenson (The University of Queensland)
 3:00-4:00Ekaterina Shemyakova (University of Western Ontario)


UID:221
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120420T151516
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120426T150000
DTEND;TZID=Australia/Sydney:20120426T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nMC110, McMullin Building\n\n"The Anatomy Of A Famous Conjecture"\nProf Brian Alspach\n\nAbstract:\nBrian Alspach will continue with "The Anatomy Of A Famous Conjecture" this Thursday.  One can easily pick up the thread this week without having attended last week, but if you miss this week it will not be easy to join in next week.
UID:222
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120423T120946
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120426T153000
DTEND;TZID=Australia/Sydney:20120426T163000
SUMMARY:SIGMAopt Seminar
DESCRIPTION:SIGMAopt Seminar\nV205, Mathematics Building\n\n"Strong Convergence in Hilbert spaces via Gamma-duality"\nJefferson Melo\n\nAbstract:\nIn this talk, we consider a general convex feasibility problem in Hilbert space, and analyze a primal-dual pair of problems generated via a duality theory introduced by Svaiter. We present some algorithms and their convergence properties. The focus is a general primal-dual principle for strong convergence of some classes of algorithms. In particular, we give a different viewpoint for the weak-to-strong principle of Bauschke and Combettes. We also discuss how subgradient and proximal type methods fit in this primal-dual setting.\nJoint work with Maicon Marques Alves (Universidade Federal de Santa Catarina-Brazil)
UID:219
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120419T152757
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120426T163000
DTEND;TZID=Australia/Sydney:20120426T173000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\nPlease note the start time.\n\n"New constructions for Hadamard matrices"\nDr Paul Leopardi\n\nAbstract:\nThe talk will outline some topics associated with constructions for Hadamard matrices, in particular, a relatively simple construction, given by a sum of Kronecker products of ingredient matrices obeying certain conditions. Consideration of the structure of the ingredient matrices leads, on the one hand, to consideration of division algebras and Clifford algebras, and on the other hand, to searching for multisets of {-1,1} ingredient matrices. Structures within the sets of ingredient matrices can make searching more efficent.
UID:220
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120420T095448
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120501T130000
DTEND;TZID=Australia/Sydney:20120501T140000
SUMMARY:CARMA Analysis and Number Theory Seminar
DESCRIPTION:CARMA Analysis and Number Theory Seminar\nV205, Mathematics Building\n\n"Computation and theory of extended Mordell-Tornheim-Witten sums I"\nLaureate Prof Jon Borwein\n\nAbstract:\nWe consider some fundamental generalized Mordell-Tornheim-Witten (MTW) zeta-function values along with their derivatives, and explore connections with multiple-zeta values (MZVs). To achieve these results, we make use of symbolic integration, high precision numerical integration, and some interesting combinatorics and special-function theory.\nOur original motivation was to represent previously unresolved constructs such as Eulerian log-gamma integrals. Indeed, we are able to show that all such integrals belong to a vector space over an MTW basis, and we also present, for a substantial subset of this class, explicit closed-form expressions. In the process, we significantly extend methods for high-precision numerical computation of polylogarithms and their derivatives with respect to order. That said, the focus of our paper is the relation between MTW sums and classical polylogarithms. It is the\nadumbration of these relationships that makes the study significant.\nThe associated paper (with DH Bailey and RE Crandall) is at http://carmasite.newcastle.edu.au/jon/MTW1.pdf.\n
UID:230
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120427T115401
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120503T160000
DTEND;TZID=Australia/Sydney:20120503T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"Analysis on infinite-dimensional spaces: from qualitative stability to quantitative"\nSergey Ajiev\n\nAbstract:\nApproximation theory is a classical part of the analysis of functions defined on an Euclidean space or its subset and the foundation of its applications, while the problems related to high or infinite dimensions create known challenges even in the setting of Hilbert spaces. The stability (uniform continuity) of a mapping is one of the traditional properties investigated in various branches of pure and applied mathematics and further applications in engineering. Examples include analysis of linear and non-linear PDEs, (short-term) prediction problems and decision-making and data evolution.\nWe describe the uniform approximation properties of the uniformly continuous mappings between the pairs of Banach and, occasionally, metric spaces from various wide parameterised and non-parameterised classes of spaces with or without the local unconditional structure in a quantitative manner. The striking difference with the finite-dimensional setting is represented by the presence of Tsar'kov's phenomenon.  Many tools in use are developed under the scope of our quasi-Euclidean approach. Its idea seems to be relatively natural in light of the compressed sensing and distortion phenomena.
UID:223
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120423T121217
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120508T130000
DTEND;TZID=Australia/Sydney:20120508T140000
SUMMARY:CARMA Analysis and Number Theory Seminar
DESCRIPTION:CARMA Analysis and Number Theory Seminar\nV205, Mathematics Building\n\n"Computation and theory of extended Mordell-Tornheim-Witten sums II"\nLaureate Prof Jon Borwein\n\nAbstract:\nWe consider some fundamental generalized Mordell-Tornheim-Witten (MTW) zeta-function values along with their derivatives, and explore connections with multiple-zeta values (MZVs). To achieve these results, we make use of symbolic integration, high precision numerical integration, and some interesting combinatorics and special-function theory.\nOur original motivation was to represent previously unresolved constructs such as Eulerian log-gamma integrals. Indeed, we are able to show that all such integrals belong to a vector space over an MTW basis, and we also present, for a substantial subset of this class, explicit closed-form expressions. In the process, we significantly extend methods for high-precision numerical computation of polylogarithms and their derivatives with respect to order. That said, the focus of our paper is the relation between MTW sums and classical polylogarithms. It is the\nadumbration of these relationships that makes the study significant.\nThe associated paper (with DH Bailey and RE Crandall) is at http://carmasite.newcastle.edu.au/jon/MTW1.pdf.
UID:231
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120427T115620
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120510T150000
DTEND;TZID=Australia/Sydney:20120510T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nMC110, McMullin Building\n\n"The Anatomy Of A Famous Conjecture"\nProf Brian Alspach\n\nAbstract:\nBrian Alspach will continue his discussion "The Anatomy Of A Famous Conjecture."
UID:232
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120509T115023
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120511T100000
DTEND;TZID=Australia/Sydney:20120511T110000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV09, Mathematics Building\n\n"Transportation and logistics models in non-profit settings"\nKaren Smilowitz\n\nAbstract:\nThis talk will discuss opportunities and challenges related to the development and application of operations research techniques to transportation and logistics problems in non-profit settings. Much research has been conducted on transportation and logistics problems in commercial settings where the goal is either to maximize profit or to minimize cost. Significantly less work has been conducted for non-profit applications. In such settings, the objectives are often more difficult to quantify since issues such as equity and sustainability must be considered, yet efficient operations are still crucial. This talk will present several research projects that introduce new approaches tailored to the objectives and constraints unique to non-profit agencies, which are often concerned with obtaining equitable solutions given limited, and often uncertain, budgets, rather than with maximizing profits.\nThis talk will assess the potential of operations research to address the problems faced by non-profit agencies and attempt to understand why these problems have been understudied within the operations research community. To do so, we will ask the following questions: Are non-profit operations problems rich enough for academic study? and Are solutions to non-profit operations problems applicable to real communities?
UID:233
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120509T115911
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120517T150000
DTEND;TZID=Australia/Sydney:20120517T160000
SUMMARY:CARMA Discrete Mathematics Instructional Seminar
DESCRIPTION:CARMA Discrete Mathematics Instructional Seminar\nMC110, McMullin Building\n\n"The Anatomy Of A Famous Conjecture"\nProf Brian Alspach\n\nAbstract:\nBrian Alspach will continue his discussion "The Anatomy Of A Famous Conjecture."
UID:234
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120515T121551
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120517T160000
DTEND;TZID=Australia/Sydney:20120517T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"Time and Band Limiting"\nJoe Lakey\n\nAbstract:\nThis talk will survey some of the classical and recent results concerning operators composed of a projection onto a compact set in time, followed by a projection onto a compact set in frequency. Such "time- and band-limiting" operators were studied by Landau, Slepian, and Pollak in a series of papers published in the Bell Systems Tech. Journal in the early 1960s identifying the eigenfunctions, providing eigenvalue estimates, and describing spaces of "essentially time- and band-limited signals."\n\nFurther progress on time- and band-limiting has been intermittent, but genuine recent progress has been made in terms of numerical analysis, sampling theory, and extensions to multiband signals, all driven to some extent by potential applications in communications. After providing an outline of the historical developments in the mathematical theory of time- and bandlimiting,  some details of the sampling theory and multiband setting will be given. Part of the latter represents joint work with Jeff Hogan and Scott Izu.
UID:225
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120423T121407
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120531T160000
DTEND;TZID=Australia/Sydney:20120531T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"TBA"\nProf John Giles\n\nAbstract:\nTBA
UID:226
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120423T121439
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Australia/Sydney:20120607T160000
DTEND;TZID=Australia/Sydney:20120607T170000
SUMMARY:CARMA Seminar
DESCRIPTION:CARMA Seminar\nV129, Mathematics Building\n\n"TBA"\nDr Roslyn Hickson\n\nAbstract:\nTBA
UID:227
SEQUENCE:0
DTSTAMP;TZID=Australia/Sydney:20120423T121450
END:VEVENT
END:VCALENDAR