Tigran

Matroid is a structure $(E, F)$ where $E$ and $F$ are sets and elements of $E$ are ‘building’ the set $F$, which has the following properties: (A1): $\empty \in F$ (A2): If $X \subseteq Y$ and $Y \in F$ then $X \in F$ (A3): Let $X, Y \in F$ and $|X| < |Y|$ then $\exists y \in Y \backslash X$ such that $X \cup \ \{y\} \in F$ If $M$ is a matroid, then $E$ is called the ground set, elements of $F$ independent sets...

Formally: The generating function of an infinite sequence $(a_0, a_1, \ldots)$ is represented by the power series: $$ \sum_{n=0}^\infty a_nx^n $$ Informally: Consider a sequence of numbers $(a_0, a_1, \ldots)$. We want to encode this sequence within a function, expressed as: $$ a_0x^0 + a_1x^1 + a_2x^2 + \ldots + a_nx^n = \displaystyle\sum_{n=0}^\infty a_nx^n $$ Example of Sequence $(1, 1, 1, 1, \ldots )$: $$ 1x^0 + 1x^1 + 1x^2 + \ldots + 1x^n = \displaystyle\sum_{n=0}^\infty x^n = \frac{1}{1 - x} $$ You may ask why the equation $\displaystyle\sum_{n=0}^\infty x^n = \frac{1}{1 - x}$ holds....

A brief introduction of me and what can you gain from this blog Although probably nobody would read this except some close people who already know me well. But let’s goo. I do theoretical computer science and my university is very much focused on research on combinatorics and graph theory. So I also to do my bachelor thesis on a topic related to graph theory. It’s about Hadwiger’s conjecture a generalization of 4 color theorem which was proved in 1976 using computers....