Mathematics ITB
International Virtual Course
About ivc - international virtual course
International Virtual Course is designed for serving international students (especially undergraduate student) to learn and work together in project based problems during a period of time. The lecture will be delivered in English.
This Programs is supported by World Class University Program of ITB
TOPICS
In this event, the participants will have experience to know theory (graph theory and combinatorial design) and application (in statistics and modeling) in combinatorics. This course is an undergraduate course, but graduate students are also welcome to this course. In this course, we will learn the following topics:
Fundamental Graph Theory
Combinatorial design and coding theory
Floorplan partition
Equiangular lines
Neural Network Identification using graph theory
Network based approach for market basket analysis using graph representation
Generatingfunctionology
Fun Project and Modeling with Combinatorics Objects
ramsey theory
network appliaction from disease modelling prespective
SYMBOLIC COMPUTATION AND COMBINATORIAL DESIGNS USING HIGH PERFORMANCE COMPUTING
Lecturer
Registration
IVC Program Details
- For Foreigner student (undergraduate or graduate students):
- Facilities for participants:
- E-certificate
- Official Transcript
- New collaborators
- Experience to solve some project based problems in combinatorics
- This course can be claimed as the following course: MA2011 Topics in Math Perspectives or MA4099 Independence Study/Project C
- You CANNOT cancel your registration if you are accepted as participants by system.
- The registration fee: FREE!!
- For Indonesian AND non-ITB students
- Facilities for participants:
- E-certificate
- Official Transcript*)
- New collaborators
- Experience to solve some project based problems in combinatorics
- *) This program can be claimed as the following course: MA2011 Topics in Math Perspectives (2 SKS) or MA4099 Independence Study/Project C (2 SKS)
- Please note that this course is equivalent to undergraduate courses (2 SKS).
- If you want to claim this program with courses above, the payment is Rp 2.200.000,- (registration and course fee). Otherwise, you may only receive an e-certificate only if you attend all the lectures and join the project.
Note: You CANNOT cancel your registration if you are accepted as participants by system.
- For undergraduate ITB students
- Facilities for participants:
- E-certificate
- Official Transcript
- New collaborators
- Experience to solve some project based problems in combinatorics
- This course can be claimed as the following course: MA2011 Topics in Math Perspectives (Topik Wawasan Matematika) or MA4099 Independence Study/Project C (Studi / Proyek Mandiri C)
- Note that if you already taken at least one the courses above, we will take the last index for your transcript, i.e. the index in IVC 2022 (in SIX).
- You CANNOT cancel your registration if you are accepted as participants by system. Otherwise, your transcript will be indexed by E (Fair).
- The registration fee: Free*)
Note : *) Once you register at the admission system, you will need to pay Rp 200.000,-. This will be returned by ITB after you complete (attend the courses and do assignments) the IVC program. You can register up to 3 IVC programs in admission system and only pay Rp 200.000,- once for all IVC programs that you apply.Rp 200.000,-.
Registration Details
- Registration
Open : 01 August 2022 - 25 august 2022 31 August 2022 (Extended)
acceptance announcement : 01 september 2022
- Guidance of Registration
- Please register and the admission system will send you a selection number and password.
- Please login using the given selection number and password.
- Fill the data entry.
- List of Documents: Here are the required documents that you need to upload (each file needs less than 2MB).
-
- Recent photograph: Please upload your photograph
- Student ID/Personal ID Card/Employment ID Card
- Statement of Purpose: Upload the motivation letter
- Motivation Letter: Upload the motivation letter again (Click here to download the template of Motivation Letter ML IVC 2022 Math (Your Name)(You just can VIEW this document, but you can DOWNLOAD it))
- Other documents, such as Identity page of passport, proof of health insurance, latest academic transcript ARE OPTIONAL to be uploaded.
Schedule (UTC +7)
05 – 16 September 202
Contact person
Dr. Pritta Etriana Putri / Dr. Novry Erwina / Dr. Rudy Kusdiantara (summer.school@math.itb.ac.id)
Topics in Combinatorics
1. Introduction to Combinatorial Design Theory
by Professor Akihiro Munemasa - Professor (Tohoku University)
Combinatorial design theory aims to minimize the size of a subfamily of subsets of a fixed finite set, while maintaining a property to guarantee a certain conclusion. In these lectures, I will use a real-world problem to motivate the need of such theory, and derive Fisher’s lower bound for balanced subfamily. Then I introduce symmetric designs, and mention finite projective planes as an example.
2. Introduction to Generatingfunctionology
by Dr. Hilda Assiyatun - Associate Professor (ITB)
The topic is an introduction to generating functions and some of their uses in discrete mathematics.
In discrete mathematics, many problems /questions have the answer in the form of a sequence. Generating functions offer a method for ‘getting’ the sequence. Naturally, what is meant by getting a sequence is to obtain an explicit and simple formula for the sequence. However, many sequences are so complex that simple explicit formulas cannot be obtained. For example, the n-th term of the sequence of prime numbers, 2, 3, 5, 7, 11, …., cannot be expressed in explicit form.
Although an explicit formula cannot be obtained, we should still expect to get more information about the behavior of the sequence.
Generatingfunctionology offers a tool for extracting much information about a sequence, not just in the form of an explicit formula.
3. Network based approach for Market Basket Analysis
by Dr. Sapto Wahyu Indratno - Associate Professor (ITB)
Online/offline transactions happen every day. With the development of online business allows us to get this transaction data in large quantities. Currently this transaction data can be used by sellers to carry out their sales strategies. There are several transaction data mining techniques that have been introduced in the literature which are generally based on the classical approach of Association rules.
In this lecture we will mine this transaction data with a product network-based approach. Transaction data mining with the classical approach, namely the association rules approach, will also be given as a comparison. This networking approach allows us to partition this product network into multiple product network communities. This makes it easier for us to get detailed information about products in each of these communities.
4. Neural Network using Directed Graph Representation
by Dr. Intan Muchtadi Alamsyah - Associate Professor (ITB)
A neural network is a layer of “neurons” connected by edges. Each of these neurons is assigned a value that depends on the previous layer, except for the neurons in the input layer. Neural networks are used, among others, in pattern recognition (radar systems, face identification, signal classification) and sequence recognition (gestures, speech, text recognition). In this presentation, we will explain how a neural network is described as a directed graph where the vertices are a set of complex numbers and arrows are linear transformations. With this directed graph representation, some neural networks can be simplified.
5. Codes and designs in association schemes and floorplan partition by Dr. John Vincent Morales
by Dr. John Vincent Morales - Associate Professor (De La Salle University, Philippines)
Design theory is a branch of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry. These concepts are not made precise so that a wide range of objects can be thought of as being under the same umbrella. At times this might involve the numerical sizes of set intersections as in block designs, while at other times it could involve the spatial arrangement of entries in an array as in sudoku grids.
Combinatorial design theory can be applied to the area of design of experiments. Some of the basic theory of combinatorial designs originated in the statistician Ronald Fisher’s work on the design of biological experiments. Modern applications are also found in finite geometry, tournament scheduling, lotteries, mathematical chemistry, mathematical biology, algorithm design and analysis, networking, group testing and cryptography.
6. Equiangular lines
By Dr. Gary Greaves - Senior Lecturer (Nanyang Technological University, Singapore)
Given some dimension d, what is the maximum number of lines in ℝ^d such that the angle between any pair of lines is constant? This classical problem has recently enjoyed a renewed interest due to the current attention the quantum information community is giving to its complex analogue. I will give an introduction to this problem and present some of the tools that have been developed to solve the problem for various values of d.
7. Challenges in Finding Ramsey Minimal Graphs
By Professor Edy Tri Baskoro - PROFESSOR (ITB)
Ramsey theory has always fascinated everyone. For any graph F, G and H, we write the
notation F 
(G, H) means that for any red-blue coloring on the edges of graph F, we
always obtain either a red copy of G or a blue copy of H in F. A graph F is called a
Ramsey (G, H)-minimal graph if F satisfies these two conditions: (i) F (G, H), and
(ii) F − {e} 6 
(G, H) for any edge e ∈ E(F).
In general, finding all Ramsey (G, H)-minimal graphs for fixed graphs G and H is a
difficult task. Even, it is for standard (and small) graphs G and H. In this talk, we are
going to discuss some challenges in finding Ramsey (G, H)-minimal graphs for certain
graphs G and H.
8. Network Application From an Infectious Disease Modeling Perspective
By Dr. Nuning nuraini - ASSOCIATE PROFESSOR (ITB)
Mathematical descriptions of infectious disease modeling need to go beyond simply dividing the population into discrete compartments to a complete representation of the specific contact patterns. This might require a different type of mathematical model and language, i.e., network or graph theory research. This talk will cover the spatial pattern of disease spread outbreaks using the epidemic forest.
other coming soon!
Partner University
