home dept info people

research

courses

events

links

jobs

contact us

hebrew website
 
 

 

           
 

H.I.T. Combinatorics Seminar 2005/2006

 
           
 
       
 

The organisers are Dr David Garber (Department of Applied Mathematics) and Dr Eugen Mandrescu (Department of Computer Science) Please contact them to suggest a potential speaker.

   
  Archive of the hit Combinatorics Seminar is available for the academic year 2004/2005
   
 

The seminar language is English. Unless otherwise is specified, the seminars take place on Wednesdays at 13:00/Fall Term, in the Seminar Room 330/5, Margalit Building. Light refreshments are served quarter an hour before the announced seminar time.

 
   
     
 

27 Aug 2006

      Dr Jeremy Kaminski, Holon Institute of Technology  

Sunday 15:00

   

Room 330/5

    COMPUTATIONAL ALGEBRAIC GEOMETRY- II
 

We present a series of lectures on Computational Algebraic Geometry. The purpose is to introduce the basic concepts of algebraic geometry and so the basic tools for computations. The program includes, among others, the following subjects: affine and projective varieties, primary decomposition, Groebner bases, dimension and degree of a variety, Hilbert function and polynomial, zero-dimensional algebra, resultants (univariate and multivariate), toric resultant, bezoutian, dual affine algebra, Gorenstein algebras, algebraic residues.

 
 
     
 

13 Aug 2006

      Dr Jeremy Kaminski, Holon Institute of Technology  

Sunday 15:00

   

Room 330/5

    COMPUTATIONAL ALGEBRAIC GEOMETRY- I
 

We present a series of lectures on Computational Algebraic Geometry. The purpose is to introduce the basic concepts of algebraic geometry and so the basic tools for computations. The program includes, among others, the following subjects: affine and projective varieties, primary decomposition, Groebner bases, dimension and degree of a variety, Hilbert function and polynomial, zero-dimensional algebra, resultants (univariate and multivariate), toric resultant, bezoutian, dual affine algebra, Gorenstein algebras, algebraic residues.

 
 
     
 

22 Feb 2006

      Dr Jeremy Kaminski, Holon Institute of Technology  

Wednesday 14:00

   

Room 330/5

    INTRODUCTION TO TROPICAL CONVEXITY - II
 

The lecture will continue the first presentation and introduce further developments. We will focus on tropical polytopes and cell complexes. In particular, we will show that several classical results on ordinary polytopes also hold in the tropical framework.

 
 
     
 

16 Feb 2006

      Dr Jeremy Kaminski, Holon Institute of Technology  

Wednesday 14:00

   

Room 330/5

    INTRODUCTION TO TROPICAL CONVEXITY - I
 

The lecture will introduce the basic concepts of tropical geometry and in particular the basis of tropical convexity. The definitions are basically the same than in the classical setting. However the set of scalar is now the real line endowed by two new operations, making it a semi-ring. The lecture includes the following issues: the tropical semi-ring and the tropical projective space, tropically convex sets, tropical polytopes and cell complexes.

 
 
     
 

04 Jan 2006

      Dr Yulia Kempner, Holon Academic Institute of Technology  

Wednesday 12:00

   

Room 330/5

    A GEOMETRIC CHARACTERISATION OF POLY-ANTIMATROIDS
 

The notion of "antimatroid with repetition" was invented by Bjorner, Lovasz and Shor in 1991 as an extension of the notion of antimatroid in the framework of non-simple languages. There are many equivalent ways to define antimatroids. They may be separated into two categories: antimatroids defined as set systems and antimatroids defined as languages. In our research we emphasize the set system approach, and we extend it to multisets systems. As a result, we define poly-antimatroids and prove the equivalence between poly-antimatroids and antimatroids with repetition.  Our main observation is a geometric characterization of poly-antimatroids in terms of abstract convexity.

 
 
     
 

14 Dec 2005

      Professor Yuval Roichman, Bar Ilan University  

Wednesday 13:00

  STATISTICS OF PERMUTATION GROUPS, CANONICAL WORDS,

Room 330/5

    AND PATTERN AVOIDANCE
 

The number of left to right minima of a permutation is generalized to Coxeter (and closely related) groups, via an interpretation as the number of "long factors" in canonical expressions of elements in the group. This statistic is used to determine a covering map, which "lifts" identities on the symmetric group S_n to the alternating group A_{n+1}. The covering map is then extended to "lift" known identities on S_n to new identities on S_{n+q-1} for every positive integer q, thus yielding q-analogues of the known S_n identities. Equi-distribution identities on certain families of pattern avoiding permutations follow. The cardinalities of subsets of permutations avoiding these patterns are given by extended Stirling and Bell numbers. The dual systems (determined by matrix inversion) have combinatorial realizations via statistics on coloured permutations.

 
 
     
 

07 Dec 2005

      Dr Danny Hermelin, University of Haifa  

Wednesday 13:00

  FIXED-PARAMETER ALGORITHMS FOR PROTEIN SIMILARITY

Room 330/5

    SEARCH UNDER RNA STRUCTURE CONSTRAINTS
 

In the context of protein engineering, we consider the problem of computing an mRNA sequence of maximal codon-wise similarity to a given mRNA (and consequently, to a given protein) that additionally satisfies some secondary structure constraints, the so-called MRSO problem. Since the MRSO problem is known to be APX-hard, Bongartz proposed to attack the problem using the concept of parameterized complexity. In this paper we follow this suggested approach by devising fixed-parameter algorithms for several interesting parameters of MRSO. We believe these algorithms to be relevant for practical applications today, as well as for several future applications. Furthermore, our results extend the known tractability borderline of MRSO, and provide new research horizons for further improvements of this sort.

 
 
     
 

16 Nov 2005

      Dr David Garber, Holon Academic Institute of Technology  

Wednesday 13:00

   

Room 330/5

    EXCEDANCE NUMBERS OF SOME COLOURED PERMUTATION GROUPS
 

We generalize the results of Ksavrelof and Zeng about the multidistribution of the excedance number of S_n with some natural parameters to the  colored permutation group and to the Coxeter group of type D. We define two different orders on these groups which induce two different excedance numbers. Surprisingly, in the case of the colored permutation group, we get the same generalized formulas for both orders.

 
 

Department of Sciences, Holon Academic Institute of Technology, 52 Golomb Street, PO Box 305, Holon 58102, Israel

 

Optimised for Internet Explorer 6.0 – Copyright (c) Eugene Kanzieper 2003-2005

 

Click here if you do not see hit logo at the top of this screen