# Faculty Activities

*Abstract:*

In Diophantine approximation we are often interested in the Lebesgue and Hausdorff measures of certain lim sup sets. In 2006, Beresnevich and Velani proved a remarkable result — the Mass Transference Principle — which allows for the transference of Lebesgue measure theoretic statements to Hausdorff measure theoretic statements for lim sup sets arising from sequences of balls in R k . Subsequently, they extended this Mass Transference Principle to the more general situation in which the lim sup sets arise from sequences of neighbourhoods of “approximating” planes. In this talk I will discuss a recent strengthening (joint with Victor Beresnevich, York, UK) of this latter result in which some potentially restrictive conditions have been removed from the original statement. This improvement gives rise to some very general statements which allow for the immediate transference of Lebesgue measure Khintchine–Groshev type statements to their Hausdorff measure analogues and, consequently, has some interesting applications in Diophantine approximation

*Abstract:*

The Kobayashi pseudometric on a complex manifold M is the maximal pseudometric such that any holomorphic map from the Poincare disk to M is distance-decreasing. Kobayashi has conjectured that this pseudometric vanishes on Calabi-Yau manifolds. It is still out of reach for general Calabi-Yau manifolds. The proof of Kobayashi conjecture for hyperkahler manifolds is based on ergodic theory. I would explain its proof in application to K3 surfaces.

*Abstract:*

**Advisors: **Dan Garber and Sabach Shoham** **

**Abstract**: Composite convex optimization problems that include a low-rank promoting term have important applications in data and imaging sciences. However, such problems are highly challenging to solve in large-scale: the low-rank promoting term prohibits efficient implementations of proximal based methods and even simple subgradient methods are very limited. On the other hand, methods which are tailored for low-rank optimization, such as conditional gradient-type methods, are usually slow. Motivated by these drawbacks, we present new algorithms and complexity results for some optimization problems in this class. At the heart of our results is the idea of using a low-rank SVD computations in every iteration. This talk is based on joint works with Dan Garber and Shoham Sabach.

*Abstract:*

Composite convex optimization problems that include a low-rank promoting term have important applications in data and imaging sciences. However, such problems are highly challenging to solve in large-scale: the low-rank promoting term prohibits efficient implementations of proximal based methods and even simple subgradient methods are very limited. On the other hand, methods which are tailored for low-rank optimization, such as conditional gradient-type methods, are usually slow. Motivated by these drawbacks, we present new algorithms and complexity results for some optimization problems in this class. At the heart of our results is the idea of using low-rank SVD computations in every iteration. This talk is based on joint works with Dan Garber and Shoham Sabach.

*Abstract:*

The algebra $H^{\infty}(\mathbb{D})$ of bounded analytic functions on the unit disc in the complex plane is a well-studied object. This algebra arises frequently in various areas of mathematics, in particular, function theory, hyperbolic geometry, and operator algebras. The classical Schwarz-Pick lemma tells us that analytic functions bounded by $1$ on the disc are necessarily contractions with respect to the Poincare metric. Furthermore, preserving metric between two points is equivalent to being an isometry and thus a Moebius map. In its other incarnation $H^{\infty}(\mathbb{D})$ is an operator algebra. The connection between the operator algebraic structure and the hyperbolic geometric of the disc was exploited to obtain interpolation and classification results.

However, operator algebras are generally noncommutative, hence it is common to think of them as quantized function algebras. The goal of my talk is to present a noncommutative generalization of this interplay between bounded functions on the disc and its geometry. To this end, I will introduce functions of noncommutative variables and explain how they arise naturally in many (even classical commutative) contexts. The focus of my talk is on bounded nc functions, that turns out to be automatically analytic. We will discuss the generalization of a classical fixed point theorem of Rudin and Herve and give an operator algebraic application.

Only basic familiarity with operators on Hilbert spaces and complex analysis is assumed.

*Abstract:*

In this talk, I will discuss a question which originates in complex analysis but is really a problem in non-linear elliptic PDE. A finite Blaschke product is a proper holomorphic self-map of the unit disk, just like a polynomial is a proper holomorphic self-map of the complex plane. A celebrated theorem of Heins says that up to post-composition with a M\"obius transformation, a finite Blaschke product is uniquely determined by the set of its critical points. Konstantin Dyakonov suggested that it may be interesting to extend this result to infinite degree. However, one must be a little careful since infinite Blaschke products may have identical critical sets. I will show that an infinite Blaschke product is uniquely determined by its "critical structure” and describe all possible critical structures which can occur. By Liouville’s correspondence, this question is equivalent to studying nearly-maximal solutions of the Gauss curvature equation $\Delta u = e^{2u}$. This problem can then be solved using PDE techniques, using the method of sub- and super-solutions.

*Abstract:*

Nonholonomic mechanics concerns with mechanical systems whose velocity is constrained. If these velocity constraints are linear, they define k-planes at every point of the configuration space of the system. In more complex situations further constraints appear: the movement of the system not only has to be tangent to these k-planes, but must obey conditions in which tangent vectors to the trajectories have constant length, or satisfy other, in general nonlinear, relations. This equips kinematics of nonholonomic mechanical systems with various geometric structures. These are: vector distributions on manifolds, their symmetry groups, differential invariants, associated exterior differential systems, Cartan connections, etc.

In the lectures we will discuss these geometric structures in simple examples of existing (or possible to exist) mechanical systems. We will concentrate on systems whose kinematics is described by a low dimensional parabolic geometry i.e. a geometry modeled on a homogeneous space G/P, with G being a simple Lie group, and P being its parabolic subgroup. The considered systems will include a movement of ice skaters on an ice rink, rolling without slipping or twisting of rigid bodies, movements of snakes and ants, and even movements of flying saucers. Geometric relations between these exemplary nonholonomic systems will be revealed. An appearance of the simple exceptional Lie group G2 will be a repetitive geometric phenomenon in these examples.

*Announcement:*

**דר' יובל פילמוס**

הפקולטה למדעי המחשב

טכניון

**Dr. Yuval Filmus**

The Faculty of Computer Science

Technion

**MATH CLUB 19.12.18**

**לאחר ההרצאה יתקיים טקס הענקת הפרסים של התחרות ע"ש גרוסמן**

**כמה מסובך לצבוע גרפים?**

בהינתן גרף, כמה קל לבדוק האם ניתן לצבוע את קדקודיו ב-* c *צבעים כך שכל קשת מחברת בין שני קדקודים בעלי צבעים שונים?

איך אפשר להשתכנע שצביעה כזו קיימת? ואיך אפשר להשתכנע שצביעה כזו אינה קיימת?

נדון בשאלות אלה כצוהר לעולם של סיבוכיות חישובית.

**Complexity of coloring graphs**

Given an undirected graph, how easy is it to determine whether we can color its vertices with *c* colors, so that no edge is monochromatic?

How easy is it to demonstrate that such a coloring exists? How can we prove that no such coloring exists?

We use these questions as a window to the world of computational complexity.

**ההרצאה תהיה בעברית**

**The lecture will be in Hebrew**

*Abstract:*

Abstract: An important and challenging class of two-stage linear optimization problems are those without relative-complete recourse, wherein there exist first-stage decisions and realizations of the uncertainty for which there are no feasible second-stage decisions. Previous data-driven methods for these problems, such as the sample average approximation (SAA), are asymptotically optimal but have prohibitively poor performance with respect to out-of-sample feasibility. In this talk, we present a data-driven method for two-stage linear optimization problems without relative-complete recourse which combines (i) strong out-of-sample feasibility guarantees and (ii) general asymptotic optimality. Our method employs a simple robustification of the data combined with a scenario-wise approximation. A key contribution of this work is the development of novel geometric insights, which we use to show that the proposed approximation is asymptotically optimal. We demonstrate the benefit of using this method in practice through numerical experiments.

*Abstract:*

The hydrogen atom system is one of the most thoroughly studied examples of a quantum mechanical system. It can be fully solved, and the main reason why is its (hidden) symmetry. In this talk I shall explain how the symmetries of the Schrödinger equation for the hydrogen atom, both visible and hidden, give rise to an example in the recently developed theory of algebraic families of Harish-Chandra modules. I will show how the algebraic structure of these symmetries completely determines the spectrum of the Schrödinger operator and sheds new light on the quantum nature of the system.

No prior knowledge on quantum mechanics or representation theory will be assumed.

*Abstract:*

T.B.A.

*Abstract:*

T.B.A.

*Abstract:*

TBA

*Abstract:*

T.B.A.

*Abstract:*

T.B.A.