|
2004-2005 Departmental Colloquium
The organizers of the seminar are Toufik Mansour and Yuval Ginosar
|
Tuesday at 16:10 on 2004 November 2 |
Raphael Yuster: Fast sparse matrix multiplication Let A and B two n×n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B using O(m0.7n1.2+n2+o(1)) algebraic operations (i.e., multiplications, additions and subtractions) over R. The naive matrix multiplication algorithm, on the other hand, may need to perform W(mn) operations to accomplish the same task. For m £ n1.14, the new algorithm performs an almost optimal number of only n2+o(1) operations! For m £ n1.68, the new algorithm is also faster than the best known matrix multiplication algorithm for dense matrices which uses O(n2.38) algebraic operations. Obtaining a fast sparse matrix multiplication algorithm that beats the naive method even for very sparse matrices was a long standing open problem. The new algorithm is obtained using a surprisingly straightforward combination of a simple combinatorial idea and existing fast rectangular matrix multiplication algorithms. We also obtain improved algorithms for the multiplication of more than two sparse matrices. Joint work with Uri Zwick |
||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Tuesday at 16:10 on 2004 November 16 |
Kobi Peterzil: Complex analytic geometry and o-minimal
structures
Remmert's Proper Mapping Theorem says that the
image of a complex analytic set under a proper holomorphic map is an analytic
subset of the target manifold. The theorem fails without the properness
assumptions for several reasons the most obvious being that the image set might
not be even topologically closed . |
||||||||||||||||
| Tuesday at 16:10 on 2004 November 23 |
Ehud De-Shalit: Hyperplane arrangement and p-adic
uniformization I will give an introduction to
work done over the last 5 years combining combinatorics of hyperplane
arrangements, representation theory and p-adic algebraic geometry. |
||||||||||||||||
| Tuesday at 16:10 on 2004 November 30 |
Florian Deloup: Recent "rigidity" results for
braids. The braid group is one of the simplest noncommutative group and can be described in several equivalent ways (fundamental group of the configuration space of C, mapping class group of the complement of n points in the unit disk, etc). We will present this group and some recent rigidity results. |
||||||||||||||||
| Tuesday at 16:10 on 2004 December 7 |
Daoud Bshouty:
Planar Harmonic Mappings onto convex domains. A mapping f from a domain W in C into C is called (planar) harmonic if f=u+iv where u and v are both real harmonic. This is a natural generalization of analytic functions. These mappings are in one to one correspondence with minimal surfaces and that is where their importance stems from. Under mild conditions these are quasiregular maps and under even milder conditions they are pseodoanalytic. Most of all complex analytic methods proved to be useful in there study . In this talk we shall refer to some of the results in the field related to mappings onto convex domains and discuss some open problems. |
||||||||||||||||
| Tuesday at 16:10 on 2004 December 14 |
Leonid G.Fel:
Frobenius problem for 3-dim semigroups. The matrix representation of the set D(d3), d3 = (d1,d2,d3), of the integers which are unrepresentable by d1,d2,d3 is found. The diagrammatic procedure of calculation of the generating function F(d3;z) for the set D(d3) is developed. The Frobenius number F(d3), genus G(d3) and Hilbert series H(d3;z) of a graded subring for non-symmetric and symmetric semigroups S(d3) are found. |
||||||||||||||||
| Tuesday at 16:10 on 2004 December 21 |
Shustin Evgenii:
Tropical algebraic geometry and its applications. The tropical algebraic geometry, i.e., an algebraic geometry over the reals equipped with the operations of maximum and addition, appears as a limit (dequantization) of the classical algebraic geometry. We discuss an application of this relation to enumeration of real and complex algebraic curves (due to Mikhalkin, Itenberg, Kharlamov, Seibert and the author), resulting in answers, expressed via combinatorics of convex lattice polytopes and their lattice subdivisions. |
||||||||||||||||
| Tuesday at 16:10 on 2004 December 28 | Yoav Moriah: A survey of the theory of 3-manifolds and some recent results about Heegaard splittings. | ||||||||||||||||
| Tuesday at 16:10 on 2005 January 4 |
Eli Berger: A solution of the Erdos-Menger conjecture
We prove an old conjecture of Erdos, saying that
Menger's theorem is valid also for infinite graphs, in the following strong
form: given sets A and B of vertices in a directed graph, there exists a family
P of disjoint A-B paths, and an A-B separating set S, such that S consists of a
choice of precisely one vertex from each path in P. The talk will describe the
history of the problem and the main ideas of our proof. |
||||||||||||||||
| Tuesday at 16:10 on 2005 January 11 |
Yair Glasner-UIC: On infinite primitive
permutation groups We investigate finitely
generated groups by studying their actions on sets. Our focus is on groups that
have some geometric flavor to them such as: linear groups, hyperbolic groups,
mapping class groups, and more. This is a joint work with Tsachik Gelander. |
||||||||||||||||
| Tuesday at 16:10 on 2005 March 1 |
E. Plotkin: On solvability of finite groups. A way to the solvable radical The theorem by R. Baer
(1957) shows how to characterize the nilpotent radical of a finite group. This
theorem is a natural generalization of the classical theorems by Engel and Zorn
which describe the nilpotency property in terms of two variable laws. |
||||||||||||||||
| Tuesday at 16:10 on 2005 March 8 |
Wafiq Hibi: The Beckman-Quarles theorem for rational spaces
Let R^d and Q^d denote the real and the rational
d-dimensional spaces, respectively. For a real number b, a mapping f:X --> X,
where X is either R^d or Q^d, is called b-distance preserving if dist(x,y)=b
implies dist(f(x),f(y))=b for all x,y in X. |
||||||||||||||||
| Tuesday at 16:10 on 2005 March 15 |
Amnon Besser: A new proof of de Shalit's p-adic period relation Let S be a Riemann surface of positive genus g. Then S can be written as the quotient of a complex domain D by a discrete automorphism group G. It has a fundamental domain whose boundary is a polygon with 4g sides: a1,b1,a1-1,b1-1,¼ag-1,bg-1 and the group action identifies a side with its opposite side. A fundamental theorem states that for two holomorphic differential forms on S, which are the same thing as holomorphic G-invariant forms w and h on D, one has the period relation
We comment that this relation can be
generalized to mermorphic vector valued forms. |
||||||||||||||||
| Tuesday at 16:30 on 2005 March 22 (room 570) |
Richard Stanley:
The RSK algorithm. Will deliver three lectures at the University of Haifa (All lectures will be in room 570 on the fifth floor of the Science & Education Building): Monday, March 21, 2005 at 16:30 Tuesday, March 22, 2005 at 16:30 Wednesday, March 23, 2005 at 14:00 The RSK algorithm, named after G. de B. Robinson, C. Schensted, and D. Knuth, is perhaps the most interesting algorithm in all of mathematics. In its most basic form, it transforms a permutation of 1,2,...,n into a pair of standard Young tableaux of the same shape with n squares. The beauty and importance of this algorithm stems from (1) its remarkable symmetry and other properties, (2) the deep connections with representation theory, probability theory, and other areas, and (3) its many variations and extensions. |
||||||||||||||||
| Tuesday at 16:30 on 2005 March 29 |
A. Kaplan:
Proximal method for variational inequalities: Case of non-paramonotone
operators. The main motivation for
Bregman-function-based proximal methods is that, |
||||||||||||||||
| Tuesday at 16:30 on 2005 April 5 |
Y. Friedman:
Spin domain as a model for super symmetry. We
construct a model in which spin 1 and spin 1/2 particles coexist. The Prof. Friedman will give another talk on Monday, April 4 at 14-16 in the seminar on Operator Theory and Mathematical Physics (room 570, Education/Science Building) |
||||||||||||||||
| Tuesday at 16:10 on 2005 May 3 |
Guy Cohen: Extensions of the Menchoff-Rademacher theorem
with applications to ergodic theory We prove extensions of Menchoff's inequality and the Menchoff-Rademacher theorem for sequences {fn} Ì Lp, based on the size of the norms of sums of sub-blocks of the first n functions. The results are applied to the study of a.e. convergence of series ån [(an Tng)/(na )] when T is an L2-contraction, g Î L2, and {an} is an appropriate sequence. Given a sequence {fn} Ì Lp(W,m) of independent symmetric random variables, we study conditions for the existence of a set of x of m-probability 1, such that for every contraction T on L2(Y,p) and g Î L2(p), the random power series ån fn(x)Tn g converges p-a.e. This is a joint work with M. Lin. |
||||||||||||||||
| Tuesday at 16:10 on 2005 May 10 |
Alexander A. Borisenko: On the global structure of hopf
hypersurfaces in space forms.
It is known that a tube over a K\"ahler
submanifold in a complex space form is a Hopf hypersurface. In some sense the
reverse statement is true: a connected compact generic immersed $C^{2n-1}$
regular Hopf hypersurface in the complex projective space is a tube over an
irreducible algebraic variety. In the complex hyperbolic space a connected
compact generic immersed $C^{2n-1}$ regular Hopf hypersurface is a geodesic
hypersphere. Let $CH^n$ be the complex hyperbolic space of
constant holomorphic curvature $-4$. |
||||||||||||||||
| Tuesday at 16:10 on 2005 May 17 |
Joram Lindenstrauss:
Differentiability of Lipschitz Maps between Banach Spaces and Porous Sets.
In the lecture I define the two important notions
of |
||||||||||||||||
| Tuesday at 16:10 on 2005 May 22 |
Leah Epstein: SONET ADMs Minimization in Ring Networks
SONET add-drop multiplexers (ADMs) are the
dominant cost factor in SONET/WDM rings. The number of SONET ADMs required by a
set of traffic streams is determined by the routing and wavelength assignment of
the streams. We need to assign wavelengths so as to minimize the total number of
used ADMs. Following previous work, we consider several models of the ADM
minimization problem. The input is given as pairs of ring vertices, and the
paths may be either pre-assigned (arc version) or to be assigned by the
algorithm (chord/routing version). Furthermore, we also consider the model where
traffic streams can be divided into several parts, and assigned to different
wavelengths. We present approximation algorithms for the different cases, each
of which has a better performance guarantee than the best algorithm previously
known for the problem. |