Tue, 16 Feb 2021
14:00
Virtual

Geodesic Geometry on Graphs

Nati Linial
(Hebrew University of Jerusalem)
Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Abstract

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $P=\{P_{u,v}| u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices $y,z$ are in $P_{u,v}$, then the sub-path of $P_{u,v}$ between them coincides with $P_{y,z}$. A map $w:E\to(0,\infty)$ is said to induce $P$ if for every $u,v\in V$ the path $P_{u,v}$ is $w$-geodesic. We say that $G$ is metrizable if every consistent path system is induced by some such $w$. As we show, metrizable graphs are very rare, whereas there exist infinitely many 2-connected metrizable graphs.
 

Mon, 08 Jun 2020
15:45
Virtual

The rates of growth in a hyperbolic group

Zlil Sela
(Hebrew University of Jerusalem)
Abstract

We study the countable set of rates of growth of a hyperbolic 
group with respect to all its finite generating sets. We prove that the 
set is well-ordered, and that every real number can be the rate of growth 
of at most finitely many generating sets up to automorphism of the group.

We prove that the ordinal of the set of rates of growth is at least $ω^ω$, 
and in case the group is a limit group (e.g., free and surface groups), it 
is $ω^ω$.

We further study the rates of growth of all the finitely generated 
subgroups of a hyperbolic group with respect to all their finite 
generating sets. This set is proved to be well-ordered as well, and every 
real number can be the rate of growth of at most finitely many isomorphism 
classes of finite generating sets of subgroups of a given hyperbolic 
group. Finally, we strengthen our results to include rates of growth of 
all the finite generating sets of all the subsemigroups of a hyperbolic 
group.

Joint work with Koji Fujiwara.

Tue, 12 May 2020
14:00
Virtual

Sections of high rank varieties and applications

Tamar Ziegler
(Hebrew University of Jerusalem)
Further Information

Part of the Oxford Discrete Maths and Probability Seminar, held via Zoom. Please see the seminar website for details.

Abstract

I will describe some recent work with D. Kazhdan where we obtain results in algebraic geometry, inspired by questions in additive combinatorics, via analysis over finite fields. Specifically we are interested in quantitative properties of polynomial rings that are independent of the number of variables. A sample application is the following theorem : Let $V$ be a complex vector space, $P$ a high rank polynomial of degree $d$, and $X$ the null set of $P$, $X=\{v \mid P(v)=0\}$. Any function $f:X\to C$ which is polynomial of degree $d$ on lines in $X$ is the restriction of a degree $d$ polynomial on $V$.

Tue, 06 Nov 2018
14:30
L6

Perfect matchings in random subgraphs of regular bipartite graphs

Michael Simkin
(Hebrew University of Jerusalem)
Abstract

The classical theory of Erdős–Rényi random graphs is concerned primarily with random subgraphs of $K_n$ or $K_{n,n}$. Lately, there has been much interest in understanding random subgraphs of other graph families, such as regular graphs.

We study the following problem: Let $G$ be a $k$-regular bipartite graph with $2n$ vertices. Consider the random process where, beginning with $2n$ isolated vertices, $G$ is reconstructed by adding its edges one by one in a uniformly random order. An early result in the theory of random graphs states that if $G=K_{n,n}$, then with high probability a perfect matching appears at the same moment that the last isolated vertex disappears. We show that if $k = Ω(n)$, then this holds for any $k$-regular bipartite graph $G$. This improves on a result of Goel, Kapralov, and Khanna, who showed that with high probability a perfect matching appears after $O(n \log(n))$ edges have been added to the graph. On the other hand, if $k = o(n / (\log(n) \log (\log(n)))$, we construct a family of $k$-regular bipartite graphs in which isolated vertices disappear long before the appearance of perfect matchings.

Joint work with Roman Glebov and Zur Luria.
 

Tue, 21 Feb 2017

14:15 - 15:15
L4

Growth, generation, and conjectures of Gowers and Viola

Aner Shalev
(Hebrew University of Jerusalem)
Abstract

I will discuss recent results in finite simple groups. These include growth, generation (with a number theoretic flavour), and conjectures of Gowers and Viola on mixing and complexity whose proof requires representation theory as a main tool.
 

Thu, 12 Nov 2015
17:30
L6

Restricted trochotomy in dimension 1

Dmitri Sustretov
(Hebrew University of Jerusalem)
Abstract

Let M be an algebraic curve over an algebraically closed field and let
$(M, ...)$ be a strongly minimal non-locally modular structure with
basic relations definable in the full Zariski language on $M$. In this
talk I will present the proof of the fact that $(M, ...)$ interprets
an algebraically closed field.

Tue, 27 Oct 2015

15:45 - 16:45
L4

Point-like bounding chains in open Gromov-Witten theory

Sara Tukachinsky
(Hebrew University of Jerusalem)
Abstract

Over a decade ago Welschinger defined invariants of real symplectic manifolds of complex dimension 2 and 3, which count $J$-holomorphic disks with boundary and interior point constraints. Since then, the problem of extending the definition to higher dimensions has attracted much attention.
  We generalize Welschinger's invariants with boundary and interior constraints to higher odd dimensions using the language of $A_\infty$-algebras and bounding chains. The bounding chains play the role of boundary point constraints. The geometric structure of our invariants is expressed algebraically in a version of the open WDVV equations. These equations give rise to recursive formulae which allow the computation of all invariants for $\mathbb{CP}^n$.
  This is joint work with Jake Solomon.

Thu, 12 Jun 2014

16:00 - 17:30
L4

CAPM, Stochastic Dominance, and prospect theory

Haim Levy
(Hebrew University of Jerusalem)
Abstract

Despite the theoretical and empirical criticisms of the M-V and CAPM, they are found virtually in all curriculums. Why?

Subscribe to Hebrew University of Jerusalem