Which graph properties are not determined by the spectrum?

Promotor: Aida Abiad

Spectral graph theory aims to understand to what extent graphs are characterized by their spectra. Starting from the eigenvalues of a matrix associated to a graph, it seeks to deduce combinatorial properties of the graph. If a property is not characterized by the spectrum, then there exist a pair of non-isomorphic graphs with the same spectrum (cospectral graphs). For many graph properties and several types of associated matrices, such pairs of cospectral graphs are not hard to find. Such a pair of regular cospectral graphs has been found for a number of properties. For example: being distance-regular [1], having a given diameter [2], admitting a perfect matching [3] and having a given vertex or edge-connectivity [4].  Motivated by the complexity of properties of graphs that can be characterized by the spectrum of the adjacency matrix of the graph, spectral characterizations of some well-known NP-hard properties have recently been studied [5].

In this project we will investigate other graph properties which cannot be derived from the spectrum of a specific matrix associated to a graph. 

[1] W.H. Haemers, Distance-regularity and the spectrum of graphs, Linear Algebra Appl. 236 (1996), 265--278.
[2] W.H. Haemers and E. Spence, Graphs cospectral with distance-regular graphs, Linear Multilinear Algebra 39 (1995) 91–107.
[3] Z. Blázsik, J. Cummings and W.H. Haemers, Cospectral regular graphs with and without a perfect matching, Discrete Math. 338 (2015), 199--201.
[4] W.H. Haemers, Cospectral pairs of regular graphs with different connectivity, Discussiones Mathematicae Graph Theory 40 (2020), 577--584.
[5]  O. Etesami and W.H. Haemers, On NP-hard graph properties characterized  by the spectrum, Discrete Applied Mathematics 285 (2020),  526--529.

A geometrical approach to a combinatorial question

Promotor: Aida Abiad

The k-th power of a graph G =(V, E) is a graph with vertex set V in which two distinct elements of V are joined by an edge if there is a path in G of length at most k between them. The main motivation for this thesis project comes from distance colorings, which have received a lot of attention in the literature. In particular, this project focus on the following question of Alon and Mohar [1]:

Question. What is the largest possible value of the chromatic number of the k-th power graph among all graphs G with maximum degree at most d and girth (length of a shortest cycle contained in G) at least g?

The main challenge in the above question is to provide examples with large distance chromatic number (under the condition of girth and maximum degree). For k = 1, this question was essentially a long-standing problem of Vizing, one that stimulated much of the work on the chromatic number of bounded degree triangle-free graphs, and was eventually settled asymptotically by Johansson by using the probabilistic method. The case k = 2 was considered and settled asymptotically by Alon and Mohar. For larger k, bounds are known, mostly with an extremal and algebraic flavor.

Although much research has been done into trying to solve Alon and Mohar's question, less is known on how  finite geometry can help to prove good bounds. Thus in this project we will investigate the above question from a geometrical point of view. We will do it by investigating further links between the independence (and chromatic) number of the k-th power graph and the distance-j ovoids in incidence geometry [3,4]. We will for instance investigate the bounds from [2, Section 3].

[1] N. Alon and B. Mohar, The chromatic number of graph powers, Combin. Probab. Comput. 11  (2002), 1--10.
[2] A. Bishnoi and F. Ihringer, Some non-existence results for distance-j ovoids in small generalized polygons, Contributions to Discrete Mathematics 12(1) (2000), 157–161. (https://arxiv.org/abs/1606.07288, for longer version).
[3] A. Offer and H. Van Maldeghem, Distance-j ovoids and related structures in generalized polygons, Discrete Mathematics 294(1-2) (2005), 147-160.
[4] J.A. Thas, Ovoids and spreads of finite classical polar spaces, Geom. Dedicata 10(1-4) (1981), 135--143.

A graph theory approach to generalized Kneser and Johnson graphs

Promotoren: Aida Abiad, Jozefien D´haeseleer

While plenty of combinatorial properties and graph parameters are known for Kneser graphs (see for example [2, 4] and references herein), much less is known for their extension to subspaces, that is, for generalized Kneser graphs [1, 5, 3]. The same applies to Johnson graphs and generalised Johnson graphs. This thesis aims to complete this gap by extending known results for Kneser/Johnson graphs to their generalised versions.

[1] J. D’haeseleer, K. Metsch, D. Werner, On the chromatic number of two generalized Kneser graphs,
European J. Combin. (2022)
[2] P. Frankl and Z. Füredi, Extremal problems concerning Kneser graphs, J. Combin. Theory Ser. B, 40
(1986), 270-284.
[3] K. Liu, M. Cao, M. Lu, Treewidth of the generalized Kneser graphs, arXiv:2011.12725.
[4] L. Lovasz, Kneser’s conjecture, chromatic number and homotopy, J. Combin. Theory Ser. A, 25 (1978),
319-324.
[5] R. Simoens, Cospectral generalized Kneser graphs, Master thesis UGent, 2022.

An algebraic approach to the graph integrity

Promotoren: Aida Abiad, Alessandro Neri

The integrity of a graph G = (V, E) is defined as I(G) = min{|S| + m(G − S) : S ⊆ V (G)}, where m(G − X)
denotes the order of the largest component in the graph G − X. An I-set of G is any set S for which the
minimum is attained. This parameter was introduced by [3] as an alternative measure of the vulnerability of graphs to disruption aused by the removal of vertices. The motivation was that, in some respects, connectivity is oversensitive to local weaknesses and does not reflect the overall vulnerability.

Some eigenvalue bounds are known for both the vertex and edge-version of this graph parameter, see e.g.
[6, 1]. This project aims to find new algebraic bounds for the graph integrity, and to study its value for some
specific classes of graphs.

[1] N. Alon, A. Bishnoi, S. Das, and A. Neri. Strong blocking sets and minimal codes from expander graphs.
In preparation, 2023.
[2] K.S. Bagga, L.W. Beineke, A survey of integrity, Discrete Applied Mathematics 37-38 (1992), 13-28.
[3] C.A. Barefoot, R. Entringer, H.C. Swart, Vulnerability in graphs - A comparative survey, J. Combin.
Math. Combin. Comput. 1 (1987), 13-22.
[4] D. Benko, C. Ernst, D. Lanphier, Asymptotic Bounds on the Integrity of Graphs and Separator Theo-
rems for Graphs, SIAM Journal on Discrete Mathematics 23(1) (2009), 265-277.
[5] W. Goddard, H.C. Swart, Integrity in Graphs : Bounds and Basics (2006).
[6] Yinkui Li, Yongtang Shi, Xiaofeng Gu, Spectrum bounds for the scattering number, integrity, tenacity
of regular graphs, Future Generation Computer Systems 83 (2018), 450-453.

Injecting algebraic graph theory tools into coding theory

Promotor: Aida Abiad

The container method (which is a very power tool for upper bounding the number of independent sets,
codes, sum free sets, monotone Boolean functions etc.) has been recently used to count the number of
t-error correcting Lee metric codes [1]. The general idea is to reduce an enumeration problem in coding theory to
evaluating the number of independent sets using graph theory tools, and in particular, the container method.

The main goal of this project is to provide alternative ways of counting the number of t-error correcting
Lee metric codes using other not yet explored graph theory tools which are known to give upper bounds for
independent sets. In particular, we will investigate the use of several eigenvalue bounds for the independence
number, or the Expander Mixing Lemma, among others.

[1] Anna-Lena Horlemann, Violetta Weger, Nadja Willenborg, Asymptotic Density and Counting Results
for Lee Metric Codes, talk at ALCOCRYPT 2023.

Zero-Pattern Rank-Metric Codes

Promotor: Alessandro Neri

On the space of mxn matrices over a (finite) field F, one can consider the metric induced by the rank. A linear rank-metric code is a subspace of the space of mxn matrices over F, and its minimum rank distance is the minimum among the ranks of its nonzero matrices. Rank-metric codes have first been studied by Delsarte [1] in the late 70's and gained interest due to their application in network coding proposed by Silva-Kschischang-Koetter [4].

Several special families of rank-metric codes with restrictions have been investigated. Among them, of particular interest is the family of zero-pattern rank-metric codes. They are defined as subspaces of matrices whose nonzero entries are only those corresponding to indices from a subset of {1,...,m}x{1,...,n}. They generalize codes in the Hamming metric, which are obtained by only allowing nonzero entries on the diagonal, sum-rank metric codes [3], where the nonzero entries lie on diagonal blocks and Ferrers diagram codes [2], where the nonzero entries only appear on a prescribed Ferrers diagram.

The aim of this project is to investigate combinatorial, geometric and algebraic features of zero-pattern rank-metric codes, in analogy to those for Hamming-metric, (sum-)rank-metric and Ferrers diagram codes.

[1] P. Delsarte. Bilinear forms over a finite field, with applications to coding theory. J. Combin. Theory Ser. A, 25:226–241, 1978.
[2] T. Etzion and N. Silberstein. Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams. IEEE Trans. Inform. Theory, IT-55:2909–2919, 2009.
[3] U. Martinez-Penas , Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring, J. Algebra, 504:587--612, 2018.
[4] D. Silva, F. R. Kschischang, and R. Koetter. A rank-metric approach to error control in random network coding. IEEE Trans. Inform. Theory, IT-54:3951–3967, 2008.

Strong Blocking Sets in Coding Theory

Promotoren: Jozefien D'haeseleer, Alessandro Neri

A strong blocking set in a finite dimensional projective space over a (finite) field F is a set of points such that its intersection with any hyperplane generates the hyperplane itself. In the last decade they have been shown to have important applications in coding theory. They were first introduced and studied in order to construct covering codes [4]. Recently, they have been shown to be the geometric counterparts of minimal linear codes [1], a special family of linear codes in F^n in which the supports of their nonzero codewords form a Sperner family in the set {1,...,n}. In addition, over the field with three elements, strong blocking sets correspond also to trifferent codes [3]. Over the last years, constructions of small strong blocking sets have been an active topic of research. Many of these constructions are obtained as union of lines [1,2,4,5,6], a feature that helps in controlling their intersection with hyperplanes. However, it is not clear whether such a restrictive choice can be relaxed in order to obtain infinite families of smaller strong blocking sets.

Expansion and Thresholds in Finite Geometries

Promotor: Ferdinand Ihringer

Current topics in extremal combinatorics and theoretical computer science are results on thresholds and expansion in finite vector spaces. For instance, given two families Y and Z of k-spaces in an n-dimensional vector space, how many elements of Y meet an element of Z in a (k-1)-space? This is closely related to spectral properties of Grassmann graphs.

Goal of the thesis is to study expansion in finite geometries such as projective spaces and polar spaces. See [1] for a possible starting point. The student is expected to investigate open problems in this project.

[1] B. Rossman. Thresholds in the Lattice of Subspaces of $(\mathbb F_q)^n$. https://arxiv.org/abs/1910.00656v1

Rank Bounds in Vector Spaces

Promotor: Ferdinand Ihringer

Bounding families with restricted intersection sizes is an important topic in combinatorics. Here rank bounds are an extremely important tool. Goal of the thesis is to study recent papers on rank bounds for families with restricted intersection sizes thoroughly. See [1] for a classical result and [2,3] for recent developments.

There is the possibility (but no necessity) to conduct research in the framework of this project. For instance, one can investigate special choices for L or one can generalize the work to polar spaces.

[1] P. Frankl, R. Graham. Intersection theorems for vector spaces. European Journal of Combinatorics, 6(2):183 – 187 (1985).
[2] J. Q. Liu, S. G. Zhang, J. M. Xiao. A Common Generalization to Theorems on Set Systems with L-intersections. Acta Mathematica Sinica, English Series volume 34, pages 1087--1100 (2018). https://arxiv.org/abs/1707.01715
[3] R. Mathew, T. K. Mishra, R. Ray, S. Srivastava. Modular and fractional L-intersecting families of vector spaces. https://arxiv.org/abs/2004.04937v2

Cospectral generalized Kneser graphs

The spectrum of a graph G is the multi-set of eigenvalues of its adjacency matrix. Two graphs are called cospectral if they have the same spectrum. A graph G is determined by spectrum if any graph cospectral to G must be isomorphic to G. Two non-isomorphic graphs that are cospectral are called cospectral mates. An important research area of spectral graph theory is devoted to determining which graphs are determined by their spectra (see [1] for example).
In this project we will investigate whether the generalized Kneser graphs are not determined by their spectra. We will do this by investigating whether the results known for Kneser graphs [2] (construction of cospectral graphs with the Kneser graph) extend to the generalized Kneser graphs (see [3] for their definition).

[1] E. van Dam and W.H. Haemers, Which graphs are determined by their spectrum?, Linear Algebra Appl. 373 (2003), 241–272.
[2] W.H. Haemers and F. Ramezani, Graphs cospectral with Kneser graphs, Combinatorics and graphs, 159–164, Contemp. Math., 531, Amer. Math. Soc., Providence, RI, 2010.
[3] J. D'haeseleer, K. Metsch and D. Werner. On the chromatic number of two generalized Kneser graphs. arXiv:2005.05762

Sudoku Latin squares and the link with spectral graph theory and finite geometry

Deelstructuren in eindige projectieve ruimten en eindige klassieke polaire ruimten (Meetkunde)

Promotor: Leo Storme

Binnen eindige projectieve ruimten en eindige klassieke polaire ruimten worden vele verschillende deelstructuren bestudeerd. Dit omvat blokkerende verzamelingen, partiele spreads, en recent ook Cameron-Liebler rechtenverzamelingen, Erdos-Ko-Rado verzamelingen, en tight sets.

Binnen dit onderwerp worden enkele deelstructuren bestudeerd die recent veel aandacht gekregen hebben binnen de eindige projectieve ruimten en/of eindige klassieke polaire ruimten. 

Zo kan er een studie gemaakt worden van partiele k-spreads in eindige projectieve ruimten. Een partiele k-spread in PG(n,q) is een verzameling van paarsgewijs disjuncte k-dimensionale deelruimten in PG(n,q). Een partiele k-spread noemen we maximaal als zij niet bevat is in een grotere partiele k-spread.

Zo kan het recente resultaat van Dr. Maarten De Boeck besproken worden over de ondergrens op de kleinste maximale partiele k-spreads in PG(2k+1,q), alsook andere verwante resultaten over maximale partiele k-spreads in PG(n,q).

 Analoog wordt er op dit ogenblik intensief onderzoek verricht over Erdos-Ko-Rado verzamelingen en Cameron-Liebler verzamelingen in eindige projectieve ruimten. Hier worden er, naast meetkundige, ook  vele andere  technieken gebruikt, zoals matrixtechnieken. Bij een keuze voor de studie van deze deelstructuren kunnen dus verschillende technieken bestudeerd worden.

Lineaire codes komende van meetkundige structuren (Codeertheorie en meetkunde)

Promotor: Leo Storme

Binnen de codeertheorie worden vele codes bestudeerd die in verband staan met meetkundige structuren. Zo worden in detail de lineaire p-aire codes gedefinieerd door de incidentiematrices van punten met k-ruimten van PG(n,q), q=p^h, p priem, bestudeerd. Analoog worden de duale codes van deze lineaire codes bestudeerd.

Verder zijn er vele verbanden tussen lineaire codes en specifieke deelverzamelingen punten in eindige projectieve ruimten. Dit verband gebeurt heel veel via de kolommen van een generator of pariteitscontrole matrix van deze lineaire codes. Via deze verbanden tussen lineaire codes en specifieke deelverzamelingen punten in eindige projectieve ruimten hebben vele problemen uit de codeertheorie een equivalent meetkundig probleem. Twee concrete voorbeelden zijn het verband tussen lineaire MDS codes en bogen, en tussen lineaire codes die de Griesmer grens bereiken en minihypers.

Op dit ogenblik is er een groot europees project over random network codes (http://www.network-coding.eu/). Dit is een nieuw type code waarin de codewoorden projectieve deelruimten uit een gegeven eindige projectieve ruimte zijn. Dit impliceert dat vele problemen over random network codes gelijk zijn aan meetkundige problemen. 

Deze masterproef heeft tot doel codes en verbanden met deelstructuren uit projectieve ruimten te bestuderen. Er kan gekozen worden om lineaire codes corresponderend met eindige projectieve ruimten te bestuderen, om een specifiek verband tussen een bepaald probleem uit de codeertheorie met een equivalent meetkundig probleem te bestuderen, of om random network codes te bestuderen.

Faseovergangen

Promotor: Andreas Weiermann

Een mogelijke thesis gaat over actueel onderzoek omtrent fasenovergangen voor onafhankelijkheidsstellingen (zoals bijvoorbeeld de stelling  van Kruskal of van Paris en Harrington. Een recent onderwerp behandeld faseovergangen voor Friedmans versie van de stelling van Bolzano Weierstrass. 

Dit onderwerp sluit direct aan bij de lezing over fasenovergangen en/of bewijstheorie. (Er zijn meerdere thesisprojecten over faseovergangen beschikbaar.)

Logische Limietwetten voor ordinalen

Een mogelijke thesis gaat over eigenschappen van toevallig gekozen ordinalen.We nemen aan dat E een eigenschap van ordinalen is die kan worden uitgedrukt in de logica van eerste orde of in de monadische logica van tweede orde. We nemen verder aan dat een bepaald segment S van ordinalen is gegeven. Hoe groot is de kans dat E waar is voor een ordinaal alpha uit S als we alpha uit S "toevallig" kiezen?

In het project gaat het erover om in een gepaste context eerst een nul een wet voor de logida van eerste orde te bewijzen voor echte deelsegmenten van de ordinalen kleiner dan epsilon_0 en het zou dan worden aangetoond dat voor de monadische logica nog steeds gepaste limietwetten bestaan. 

Generalizations of Fusible Numbers

Promotor: Fedor Pakhomov

Consider the following mathematical puzzle. We are given fuses that burn out in exactly one minute if ignited from one end. Then we are interested in procedures of measuring intervals of time using only this fuses: In the beginning of a procedure some fuses are ignited (either from one or both ends) and it is allowed to do some further ignitions in future points of time that are the moments when some of the fuses burns out completely.

The set of intervals of time (measured in minutes) that could be measured by some procedure of this kind is called the set of fusible numbers. Notice that if we ignite a fuse from one end at a moment x and another end at a moment y, where |x-y|<1, then the fuse burns out at the moment f(x,y)=(x+y+1)/2. It is easy to see that the set of fusible numbers is the inclusion least set F that contains 0 and for any x,y with f(x,y)>max(x,y) containing f(x,y). An interesting property of the set of fusible numbers that it is a well-ordered set of reals whose order type is the ordinal ε₀. And since the ordinal ε₀ is the characteristic ordinal of fist-order Peano Aritmetic PA, in fact a number of true facts about the set of fusible numbers aren't provable in PA. In particular PA doesn't prove the fact that for any fusible number x there is the smallest fusible number above x.

For  any monotone function f(x₁,..,xₙ) on reals analogously to the set of fusible numbers we define the set F(f) that is the inclusion least set consisting of 0 and together with any x₁,..,xₙ containing f(x₁,..,xₙ) as long as f(x₁,..,xₙ)>max(x₁,..,xₙ). In follows from Kruskal's tree theorem that the set F(f) is always well-ordered. This project is about studying the properties of F(f) for some specific functions f.

[1] Jeff Erickson. Fusible numbers. https://www.mathpuzzle.com/fusible.pdf.
[2] Jeff Erickson, Gabriel Nivasch, and Junyan Xu. Fusible numbers and Peano arithmetic. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021.

Fast-Growing Functors

Promotor: Fedor Pakhomov

For countable ordinals Λ equipped with certain additional structure one could define hierarchies of fast-growing functions < F_α:ℕ→ℕ|α<Λ > [1]. The fast-growing hierarchies are important in proof theory since they allow to characterize the provably total computable functions of fist order theories: In particular a computable function is provably total in first-order Peano arithmetic iff for some α<ε₀ the function is computable in time bounded by F_α. Functions from fast growing hierarchy could be naturally extended to functions on the class of ordinals F_α:On→On [2]. In fact this extension is achieved by showing that those functions could be naturally treated as functors on the category of well-orders and strictly monotone functions between them. The goal of this project is to study the properties of the functors F_α:On→On for particular ordinals α≤ε₀.

[1] Rose, H.E., 1984. Subrecursion: functions and hierarchies.
[2] Aguilera, J. P., F. Pakhomov, and A. Weiermann. "Functorial Fast-Growing Hierarchies." arXiv preprint arXiv:2201.04536 (2022).

Infinitesimale Analyse en Topologische Vectorruimten

Promotor: Hans Vernaeve

In de cursus Infinitesimale analyse behandelen we distributietheorie, en kort ook algemene topologie, met infinitesimalen (d.m.v. een nietstandaard model). Klassiek worden resultaten over distributies gekaderd binnen de (zeer uitgebreid bestudeerde) algemene theorie van de topologische vectorruimten. In deze thesis willen we

1) de bestaande nietstandaard theorie van topologische vectorruimten beter leren kennen

2) een aantal verdere stellingen over distributietheorie binnen het infinitesimale framework uitwerken.

Veralgemeende functies in de infinitesimale analyse

Promotor: Hans Vernaeve

in de cursus infinitesimale analyse behandelden we veralgemeende functies (Schwartz distributies) met infinitesimalen. In deze thesis willen we het gebruik van veralgemeende functies onderzoeken die buiten de distributie-theorie vallen. Dit houdt aan de ene kant een studie in van hoe in de (standaard) analyse veralgemeende functies gebruikt worden die buiten het kader van Schwartz vallen, en aan de anderen kant hoe we dit intuïtief kunnen behandelen via infinitesimalen.

Asymptotische verdeling van veralgemeende priemgetallen en veralgemeende gehelen

Promotor: Jasson Vindas

De theorie van de veralgemeende priemgetallen stelt zich als doel de verzameling van de gewone priemgetallen te vervangen door een tamelijk willekeurige stijgende rij van positieve reële getallen (veralgemeende priemgetallen). Ze bestudeert de multiplicatieve groep die hierdoor voortgebracht wordt (veralgemeende gehelen) en het verband tussen asymptotische eigenschappen van de verdeling van de veralgemeende gehelen en priemgetallen. Dit probleem werd voor het eerst bestudeerd in 1937 door Beurling, die in deze context abstracte versies vond van de priemgetallenstelling.

Het doel van de thesis is klassieke en recente resultaten in dit gebied te bestuderen en een dieper begrip te verkrijgen over een aantal nuttige technieken uit de analyse die hier gebruikt worden (o.a. uit de Fourier-analyse en complexe analyse).

Rijruimten representaties

Promotor: Jasson Vindas

Verscheidene functie- en distributieruimten kunnen gerepresenteerd worden als Köthe rijruimten. Naast hun inherente elegantie, zijn zulke representaties ook belangrijk voor de isomorfisme classificatie en de topologische eigenschappen van zulke ruimten. Deze representaties worden vaak bewezen met behulp van diepe stellingen uit functionaalanalyse omtrent de structuur van de Köthe rijruimten. Het doel van deze thesis is om vertrouwd te geraken met deze technieken en enkele van deze isomorfismen te bewijzen.

References

R. Meise, D.Vogt, Introduction to functional analysis, Clarendon Press, 1997.

D. Vogt, Sequence space representations of test functions and distributions, in: Functional analysis, holomorphy and approximation theory, Proc. Semin., Rio de Janeiro 1979, Lect. Notes Pure Appl. Math. 83 (1983, 405-443.

Asymptotisch gedrag van distributies

Promotor Jasson Vindas

De studie van het asymptotisch gedrag van distributies is een zeer divers en bruisend onderwerp in de functionaalanalyse, en biedt een uniforme benadering voor verschillende aspecten uit de asymptotische analyse en haar toepassingen. Door middel van algemeen structureel onderzoek is men vaak in staat nieuwe resultaten te bekomen en klassieke stellingen efficiënt te bewijzen, zoals bijvoorbeeld de priemgetalstelling. Het doel van deze thesis is om vertrouwd te geraken met de achterliggende theorie, alsook deze toe te passen in een specifieke context.

Referenties

R. Estrada, R. Kanwal, A distributional approach to asymptotics. Theory and applications, Birkhäuser Boston, Boston, MA, 2002.

S. Pilipovic, B. Stankovic, J. Vindas, Asymptotic behavior of generalized functions, Series on Analysis, Applications and Computation, 5, World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2012.

J. Vindas, R. Estrada, A quick distributional way to the prime number theorem, Indag. Math. (N.S.) 20(1) (2009), 159-165.

Fractional Calculus

Numerical mathematical study and extension of a 2DH idealized model for the identification and the stability of morphodynamic equilibria in tidal basins

Supervisor: Karel Van Bockstal and Tian Qi, MSc (EA15)

Click here (in dutch)

You can also contact us if you are interested in an internship or holiday job related to this subject.

A heat transfer problem and a wave propagation problem with Robin type boundary condition in 1D: a case study

Supervisor: Karel Van Bockstal

A heat and wave problem on a bounded domain in 1D accompanied by Robin-type boundary conditions with real coefficients at the endpoints is considered. The goal of this thesis is to solve these problems by the method of separation of variables. The exact solution to these problems depends on the coefficients appearing in the Robin boundary conditions. The objective is to catch all possible situations in a phase diagram. Another goal is to develop a Python code such that numerical simulations for each situation can be established.

The implementation of flow through porous media

Supervisor: Karel Van Bockstal

There are numerous applications in which it is of interest to study the flow of multiple fluids through porous media. Some examples of these include the transport of dissolved nutrients through biological tissue and the extraction of petroleum from underground deposits. In many practical situations, the physics of such flows are characterised by coupled governing equations that are nonlinear and transient, and the problem is further complicated by material heterogeneity and irregular geometries.

This thesis aims to study (e.g. the derivation) and implement existing numerical algorithms for such systems of equations (Darcy's law, porous medium equation, Navier-Stokes equation). The code will be implemented using the FEniCS Project, which is based on the variational framework and the finite element method. There are different demos available for solving these types of equations. Furthermore, a computer can be provided for performing the simulations. 

Inverse problems in science and engineering

Supervisor: Karel Van Bockstal

In most of the course notes (partial) differential equations were only depicted as a tool for modelling physical phenomena. If some universal law is translated into mathematical language, then this model can be used to predict the behaviour of the quantity of interest, and it is often called the forward or direct problem. Inverse problems (IPs) -as the name suggests- do the opposite. They induce the reason which led to the result from the observed data.

An example of an inverse problem is determining the cause of a disease based on the results of a medical examination. It is easy to make a mistake when solving inverse problems. For example, symptoms associated with an HIV infection look like symptoms of other illnesses. It is thus impossible to tell, exclusively based on symptoms, whether the problem is related to HIV or another medical condition. Therefore, the problem of determining the cause of a disease is called ill-posed, i.e. there is no unique cause (or solution). Additional medical investigations (measurements) are required to determine the correct cause. Similar issues are encountered when studying inverse problems for partial differential equations. 

Inverse problems arise in many mathematical physics areas, and applications rapidly expand to geophysics, chemistry, medicine and engineering. A typical example is computed axial tomography (CAT or CT scan). CT provides clinically relevant anatomic and functional information, is relatively noninvasive, and has low short- and long-term risks. 

The topics of the master dissertation range from the mathematical modelling and the theoretical analysis of inverse problems for partial differential equations where some parameters (right-hand side (heat/load source), kernel, diffusion coefficient, etc.), unknown boundary condition(s) or portion of the boundary are to be found, to the development of efficient numerical schemes and their practical application in sciences, engineering (e.g. diffusion equation, beam equation, Maxwell's equations) and finance.

The exact topic of the master dissertation is worked out in consultation with the thesis advisors. For each problem under consideration, the most important questions are:

• Which additional measurement is required for the unique reconstruction of the solution?
• How can the solution be reconstructed?

Regularisation methods for inverse problems

Supervisor: Karel Van Bockstal

Inverse problems often lead to mathematical problems that are not well-posed in the sense of Hadamard, i.e. to ill-posed problems. This means especially that their solution is unstable under data perturbations. Numerical methods that can cope with this problem are so-called regularization methods. This thesis is devoted to the study of these regularization methods. Click here for a more detailed description. 

Reference:

H. W. Engl, M. Hanke, and A. Neubauer, Regularization of Inverse Problems, vol. 375. Dordrecht: Kluwer Academic Publishers, 1996.

The finite element method for Maxwell's equations

Supervisor: Karel Van Bockstal

Maxwell's equations are a set of coupled partial differential equations that, together with the Lorentz force law, form the foundation of classical electromagnetism. Maxwell's equations describe how charges, currents, and changes of the fields generate electric and magnetic fields. This thesis aims to learn how numerical solutions to (practical) problems related to these fundamental equations can be obtained. The goal of the dissertation is

• To introduce the physical laws that describe the phenomena of electromagnetism, leading to Maxwell's equations in their classical form;
• To study Sobolev spaces for vector functions (definition/trace theorem/Green's theorem);
• To study finite elements on tetrahedra;
• To study and implement (using the finite element library DOLFIN of the FEniCS project) a particular problem derived from Maxwell equations (curl-curl formulation in terms of the magnetic or electric field, scattering problem,...).

Partial differential equations with singularities

References:

Functional inequalities and applications

References:

Subelliptic harmonic analysis

References

Multiplication of distributions

Quantum-machine-learning the fate of Schrödinger's cat

Approximation theory on harmonic manifolds of purely exponential volume growth

The Black-Scholes equation on almost Abelian groups

Partial differential equations on Lie groups

Quantum-machine-learning the fate of Schrödinger's cat

Non-commutative analysis performed on the basic example of the Heisenberg group