At Drexel ECE department: 

2013:

August 6th of 2013, Partition representable matroids by F. Matus

( different kinds of representations of matroids, Partition representable matroids( secret sharing schemes and almost affine codes)  

 

August 8th of 2013, Partition representable matroids by F. Matus

( Uniformity of meet partitions and P-representations,  Partitions are random variables, Probability space of Partitions,

weakly and strongly probabilistic representable matroids. coordinate projections, p isotopic representations, latin partitions. )  

 

October 24th 2013, Marcel Wild analytic enumeration of Isometries of binary codes

(Asymptotic enumeration of binary linear codes and Brylawski–Lucas theorem of uniquely representable linear matroids )

 

October 29th 2013, Marcel Wild analytic enumeration of Isometries of binary codes

(Burnside lemma:  Counting transversal of orbits of group action by averaging fix points )

 

2014:

 

January 7th  2014, Marcel Wild analytic enumeration of Isometries of binary codes

(wreath product of General linear group and symmetric permutations group.  )

 

January  9th 2014, Marcel Wild analytic enumeration of Isometries of binary codes

(Action of wreath product of groups over the set of column matrix representations)

​

April 8th 2014, Marcel Wild analytic enumeration of Isometries of binary codes

(Conjugacy equivalence classes for Averaging fix points from their representatives.)

​

April 11th 2014, Marcel Wild analytic enumeration of Isometries of binary codes

(Permutations cycle decomposition/linear transformation cycle decomposition - Analogy between Permutations and Linear transformations acting on finite sets.)

​

June 3th 2014,  Marcel Wild analytic enumeration of Isometries of binary codes
( Polya index and Vector space cycle index, automorphisms cyclic decomposition for computing fix points per representatives of conjugacy classes.

​

June 27th of 2014, Entropics vectors meeting Introducing Kerber-Betten-Kraus-Fripertinger Binary linear codes analytic construction method. 

October 14th 2014,  Talk to Dr Babak Hassibi of Caltech: Marcel wild binary linear codes analytic enumeration of binary linear codes. 

​

2015:

​

January 12th 2015, I passed my Candidacy exam. (Multisource Multisink  Network coding Capacities region found from the Region of entropic vectors. )

​

January 26th 2015,  Kerber-Fripertinger-Laue Binary linear codes analytic construction

(Construction of Isomorphic Classes of linear Groups, Canonic Actions, Restrictions to Projective spaces, Lehmann Lemma for Triple Group action Characterization)

​

January 28th 2015,  Kerber-Fripertinger-Laue Binary linear codes analytic construction

(Construction of  Structures Isomorphic classes using finite group actions, reduction of complexity in computation using Homomorphism principle, the two

basic lemmata and Dixon Sampling strategies)

 

February 2nd 2015,  Kerber-Fripertinger-Laue Binary linear codes analytic construction

( Bijection Codes/ Dual Codes, spaces of Code check matrices and Code generator matrices, Linear isometries of projective codes, 

binary linear codes bijection w.r.t. Orbits of Projective linear group on n subsets of Projective codes)

 

February 4th 2015,  Kerber-Fripertinger-Laue Binary linear codes analytic construction

(Orbits Graphical representation in Schreier trees, orbit Data Structure, points Enumerating of projective vector spaces using ranks and subranks, 
Lexicographic ordering of the points in ordered trees,)

 

April 6th 2015   Analytic construction of binary linear codes - Schmalz Lieterspiel algorithm adapted by Betten & Braun

 

(The four basic problems: Reaching all G orbits at (i+1)level, Detect Isomorphic Extensions, Computing Group Stabilizer of extensions, Computing Transporter map of (i+1)-sets )

 

April 8th 2015, Analytic construction of binary linear codes - Schmalz Lieterspiel algorithm adapted by Betten & Braun

 

(Assumptions of algorithm:  we can construct stabilizers, Group extensions - Orbits on points. Algorithm computing orbits of a group G on subsets of a set X )

 

December 8th 2015, Analytic construction of binary linear codes -Schmalz Lieterspiel algorithm adapted by Betten & Braun

 

( Breadth first search proceeding, construction of orbit representatives level by level,  working in sequence of subgroups and overgroups,

the G invariant and hereditary test-function)

 

2016:

 

Tuesday May 3th 2016  :  The non linearly representable 11 elements Algebraic matroid proposed by A.W. Ingleton. 

 

Friday February 26th 2016,  Building Entropies from the A.W. Ingleton Algebraic Matroid using Quasi Uniform distributions