Onlline Seminar
Dr. Buket Özkaya (Nanyang Technological University)
eSeminar: Good Stabilizer Codes from Quasi-Cyclic Codes abstract
Abstract:
(**This eSeminar will take place on Zoom, using same meeting details as previous seminars. If you do not have meeting details, please contact karan.khathuria@math.uzh.ch **)
Lisonek and Singh proposed an interesting modification to the construction of qubit stabilizer codes by relaxing the Hermitian self-orthogonality requirement. Their framework, inspired by Construction X in the classical setup, yielded a number of better qubit codes than the previous best-known. These better codes came from applying their construction to specifically chosen quaternary cyclic codes. Construction X for qubit codes generalizes naturally to q-ary quantum codes.
This work uses self-orthogonal or nearly self-orthogonal quasi-cyclic codes over F4 and F9 as ingredients in the quantum Construction X to derive good qubit and qutrit (3-ary quantum) codes. We consider quasi-cyclic codes with large Hermitian hulls, which can be easily produced using their Chinese Remainder Theorem decomposition. Such codes have a good chance to be implemented in actual quantum processors. We exhibit quantum codes with parameters that strictly improve on the currently best-known ones and list those that match the best-known ones in performance.
09:00 • Onlline Seminar
Peter K. Friz (Technische Universität Berlin)
Rough Analysis and Applications (ONLINE) abstract
Abstract:
We plan to discuss: the algebra of iterated integrals, signatures and expected signatures, rough paths and models; Kolmogorov type criteria; Schauder estimates; p-variation, abstract Riemann-Stieltjes integration (Sewing); rough integration and reconstruction; a paracontrolled view; rough differential equations and flows; rough transport equations; second order rough partial differential equations; rough volatility; a regularity structure view; large deviations and precise asymptotics for rough volatility.A good part of the lecture will follow F-Hairer (2014,2020).
10:15 • ETH Zentrum, Rämistrasse 101, Zürich, Building HG, Room
Valentina Ros (ENS Paris)
Title T.B.A.
11:00 • Universität Basel, Fachbereich Mathematik, Spiegelgasse 1, Seminar Room 00.002
Giacomo Del Nin (University of Warwick)
CANCELLED: Title T.B.A.
14:15 • Universität Basel, Fachbereich Mathematik, Spiegelgasse 1, Seminar Room 00.003
Onlline Seminar
Prof. Dr. Madhu Sudan (Harvard University)
eSeminar: Codes for correcting editing errors abstract
Abstract:
(**This eSeminar will take place on Zoom, using same meeting details as previous seminars. If you do not have meeting details, please contact karan.khathuria@math.uzh.ch **) <BR> The "edit distance\'\', also known as the Levenstein distance, between two strings X, Y over some alphabet Sigma, is the minimum number of insertions and deletions in X that will transform it to Y. For example if X = 010101010101 and Y = 101010101010, then their Hamming distance is 12 while the edit distance is 2 - since you can delete the first 0 in X and insert a 0 in the last position to get Y. In this talk we will consider the task of correcting editing errors, i.e., the task of recovering X, given a string Y obtained from the transmission of X followed by a "few" editing errors. <BR> Coding theory has traditionally focussed mostly on correcting Hamming errors and till recently the theory of coding for editing errors was far behind. A recent series of works by Haeupler and Shaharasbi (with varying sets of authors) has completely transformed this picture, and brought us to the stage where the results subsume what we know for the Hamming setting, at least for large constant sized alphabets! (Of course the proofs also use the state of the art results in the Hamming setting to get there.) <BR> In this talk, I will use a recent theorem (from a paper with Haeupler and Shahrasbi) as an excuse to talk about these developments. Our theorem shows that for every delta < 1, gamma < infinity and epsilon > 0, there is an constant q and an infinite family of q-ary codes of rate 1 - delta - epsilon which can be list decoded in polynomial time from delta fraction deletions and gamma "fraction" insertions. (Note that gamma, the fraction of insertions can be much larger than 1!) Depending on availability of time we will speak about the two main ingredients in this result: (1) The corresponding result in the Hamming setting (where we allow delta fraction deletions, but only allow same number of insertions in the same locations) which comes from the Folded-Reed-Solomon-Codes of Guruswami and Rudra and the many followups. (2) Synchronization strings, which are magical ingredients introduced by Haeupler and Shahrasbi that convert codes for Hamming settings into codes for editing errors.
15:00 • Onlline Seminar
Matthew Westaway (University of Warwick)
Higher Modular Representations of Lie Algebras abstract
Abstract:
n positive characteristic, a representation of an algebraic group G gives rise to a restricted representation of Lie(G). These restricted representations are more connected to the representation theory of the first Frobenius kernel of G - a certain infinitesimal group scheme - than that of G itself. In fact, one can form a family of associative algebras by deforming the distribution algebra of the first Frobenius kernel in some way, and the irreducible representation theory of these algebras totally captures the irreducible (not necessarily restricted) representations of Lie(G). It is this theory which will be explained during this talk, as well as a consideration of how the theory changes when we instead look at higher Frobenius kernels.
15:15 • EPF Lausanne, Salle tba
Kristóf Huszár (IST, Austria)
Combinatorial width parameters for 3-manifolds abstract
Abstract:
Algorithms in computational 3-manifold topology typically take a triangulation as an input and return topological information about the underlying 3-manifold. However, extracting the desired information from a triangulation (e.g., evaluating an invariant) is often computationally very expensive. In recent years this complexity barrier has been successfully tackled in some cases by importing ideas from the theory of parameterized algorithms into the realm of 3-manifolds. In this talk we focus on the key combinatorial parameter in this context (i.e., the treewidth of a compact, orientable 3-manifold), and relate it with classical topological invariants (e.g., Heegaard genus) in a quantitative way.Joint work with Jonathan Spreer and Uli Wagner.
15:45 • Location T.B.A.
Joontae Kim (KIAS Seoul)
Real Lagrangian submanifolds in S^2 x S^2 abstract
Abstract:
A Lagrangian submanifold in a symplectic manifold is called real if it is the fixed point set of an antisymplectic involution. In this talk, we explore the topology of real Lagrangians in S^2 x S^2, which shows interesting real symplectic phenomena. In particular, we prove that any real Lagrangian in S^2 x S^2 is Hamiltonian isotopic to either the antidiagonal sphere or the Clifford torus.
Seongchan Kim (Université de Neuchâtel)
Symmetric periodic orbits in Hamiltonian systems abstract
Abstract:
A symmetric periodic orbit of a Hamiltonian system is a special kind of periodic orbit, which can be regarded as a Lagrangian intersection point.It plays an important role in the planar circular restricted three-body problem.In this talk I will give a gentle introduction to symmetric periodic orbits in Hamiltonian systems and present some results on existence and on the systole. This is partly joint work with Myeonggi Kwon and Joontae Kim.
20:00 • Université de Neuchâtel ( https://unige.zoom.us/j/5928729514 Meeting ID: 592 872 9514 ; password: 3^3 )