Events

Jarry Gu, University of Waterloo

The Boyd-Lawton Formula

While Mahler measure gives us a quantification of geometric means of polynomials, the Boyd-Lawton formula provides a link between singlevariate and multivariate Mahler measures. In this talk, we will focus on how Lawton proved this formula, and discuss how we can approximate continuous functions on the unit torus with trigonometric polynomials.

MC 5479

Chris Karpinski, McGill University

Relativizing computable categoricity

A metric space is hyperbolic if geodesic triangles in the metric space are uniformly slim. To any hyperbolic metric space, one can associate a boundary at infinity, a topological space called the Gromov boundary. A group acting on a hyperbolic metric space by isometries induces an action on the associated Gromov boundary by homeomorphisms. Given a hyperbolic space equipped with an action of a group, one can then study the orbit equivalence relation of the boundary action. We show that a class of groups of interest in geometric group theory, defined using graphical small cancellation theory, induce hyperfinite orbit equivalence relations on the boundaries of their natural hyperbolic Cayley graphs, meaning roughly that the orbits look like lines. This is joint work with Damian Osajda and Koichi Oyakawa.

MC 5403

Nathaniel Sagman, University of Toronto

Complex harmonic maps and the Atiyah-Bott-Goldman symplectic form

The field of higher Teichmuller theory has developed alongside the theories of Higgs bundles and harmonic maps to symmetric spaces of non-compact type. In this talk, I aim to give an introduction to harmonic maps and Hitchin components for SL(n,R) (examples of so-called higher Teichmuller spaces), and to present a new development: complex harmonic maps to holomorphic Riemannian symmetric spaces. Along with surveying the basic theory, old and new, I will explain how we used complex harmonic maps to prove that the Atiyah-Bott-Goldman symplectic form determines a pseudo-Kahler structure on the Hitchin component for SL(3,R). This is joint work with Christian El Emam.

MC 5417

Muhammad Afifurrahman, University of New South Wales

Number Theory Seminar:Counting multiplicatively dependent integer vectors on a hyperplane

We give several asymptotic formulae and bounds for the number of multiplicatively dependent integer vectors of bounded height that lies on a hyperplane, extending the work of Pappalardi, Sha, Shparlinski and Stewart. Joint work with Valentio Iverson and Gian Cordana Sanjaya (University of Waterloo). 

Join on Zoom

Elan Roth, University of Waterloo

A Continuation of Random Binary Sequences

We will build on the notions of ML-random and 1-random by defining a third interpretation of unpredictability using martingales. We will then prove the equivalence of these definitions and discuss some of their nice properties. Then, we will see how randomness is spread among the Turing degrees.

MC 5403

Amanda Petcu, University of Waterloo

Stability and Lyapunov Functions

When working with a nonlinear system of differential equations, finding explicit, closed-form solutions can be difficult. A tool in such situations is to determine the stability of the equilibrium points of the system. This analysis allows us to predict the long-term behavior of the system by examining its trajectories and how they behave near an equilibrium point: specifically, do they remain bounded in some compact set, converge to the point, or escape to infinity? In this talk, we will discuss Lyapunov's Direct Method, a technique that allows us to determine the stability of an equilibrium point without explicitly solving the differential equations.

MC 5403

Josse van Dobben de Bruyn, Charles University

Asymmetric graphs with quantum symmetry

Quantum isomorphisms of graphs form a bridge between noncommutative geometry (NCG) and quantum information theory (QIT), as they connect quantum automorphism groups of graphs with nonlocal games. This makes it possible to use techniques from QIT in NCG and vice versa. In this talk, I will present a striking application of this connection, where we use ideas from QIT to prove a surprising result in NCG. Using a construction similar to the Mermin–Peres magic square from QIT, we construct graphs with trivial automorphism group and non-trivial quantum automorphism group, which shows that even graphs with no symmetry at all can have hidden quantum symmetries. These are the first known examples of any kind of commutative spaces in NCG with this property.

This talk is based on joint work with David E. Roberson (Technical University of Denmark) and Simon Schmidt (Ruhr University Bochum).

QNC 1507 or Join on Zoom

Gian Cordana Sanjaya, University of Waterloo

Density of Special Classes of Polynomials with Squarefree Discriminant

In this talk, we compute the density of monic polynomials of fixed degree over Z_p, which has squarefree discriminant, provided some restriction on the coefficients of the polynomial. This is a natural extension to a previous result by Yamamura, who solved the case where the coefficients have no restrictions at all.

MC 5479

Java Villano, University of Toronto

Relativizing computable categoricity

A computable structure A is said to be computably categorical if for all computable copies B of A, there exists a computable isomorphism between A and B. We can relativize this notion to any Turing degree d by asking that for any d-computable copy B of A, there is a d-computable isomorphism between A and B. In this talk, we will discuss results about this relativization. In particular, we will discuss how for directed graphs, categoricity relative to a degree need not be monotonic in the c.e.~ degrees, and how for other structures besides directed graphs, categorical behavior relative to a degree stabilizes on certain Turing cones.

MC 5403

Liam Orovec, University of Waterloo

Greedy and Lazy Parry Numbers

We say a real number \beta is a Parry number provided the greedy \beta-expansion for 1 is eventually periodic or finite. We show conditions for when \beta is a Parry number and provide a family of real numbers which are always Parry numbers, the PV-numbers. The related Salem numbers, constructed from PV-numbers are then considered. We split this into four cases, the first of which was shown by Hare and Tweedle, we give criteria for finding Salem numbers which are Parry numbers. Time permitting we will explore the case where we look at lazy expansions instead of greedy expansions, we call these numbers lazy Parry numbers.

MC 5417