C4

In 1996 using techniques from model theory and intersection theory, Hrushovski obtained a generalisation of the Lang-Weil estimates. Subsequently the estimates have found applications in group theory, algebraic dynamics and algebraic geometry. We shall discuss a geometric proof of the non-uniform version of these estimates.

I will give an introduction to the theory of definable parameterization of definable sets in the o-minimal context and its application to diophantine problems. I will then go on to discuss uniformity issues with particular reference to the subanalytic case. This is joint work with Jonathan Pila and Raf Cluckers

Short- and long-term memories are distinguished by their forgettability. Most of what we perceive and store is lost rather quickly to noise, as new sensations replace older ones, while some memories last for as long as we live. Synaptic dynamics is key to the process of memory storage; in this talk I will discuss a few approaches we have taken to this problem, culminating in a model of synaptic networks containing both cooperative and competitive dynamics. It turns out that the competitionbetween synapses is key to the natural emergence of long-term memory in this model, as in reality.

References
​Mehta, Anita. "Storing and retrieving long-term memories: cooperation and competition in synaptic dynamics." Advances in Physics: X 3.1 (2018): 1480415.

In the spirit of the Ax-Kochen-Ershov principle, one could conjecture that the imaginaries in equicharacteristic zero Henselian fields can be entirely classified in terms of the Haskell-Hrushovski-Macpherson geometric imaginaries, residue field imaginaries and value group imaginaries. However, the situation is more complicated than that. My goal in this talk will be to present what we believe to be an optimal conjecture and give elements of a proof.

Topological quantum field theories (TQFTs) are an extensively studied scheme for constructing invariants of manifolds, inspired by physics. In this talk, we will discuss a particular flavour of TQFT, where we equip our manifolds with principal bundles for some finite group. After introducing TQFTs and this particular flavour, I will discuss games one can play with these TQFTs, and a possible strategy for classifying equivariant TQFTs in three dimensions. 

A cohomology class on the diffeomorphism group Diff(M) of a manifold M

can be thought of as a characteristic class for smooth M-bundles.
I will survey a technique for producing examples of such classes,
and then explain how the signature (of 4-manifolds) provides an
obstruction to this technique in dimension 3.

I will define Miller-Morita-Mumford classes and explain how we can
think of them as coming from classes on the cobordism category.
Madsen and Weiss showed that for a surface S of genus g all cohomology
classes
of the mapping class group MCG(S) (of degree < 2(g-2)/3) are MMM-classes.
This technique has been successfully ported to higher even dimensions d= 2n,
but it cannot possibly work in odd dimensions:
a theorem of Ebert says that for d=3 all MMM-classes are trivial.
In the second part of my talk I will sketch a new proof of (a part of)
Ebert's theorem.
I first recall the definition of the signature sign(W) of a 4 manifold W,
and some of its properties, such as additivity with respect to gluing.
Using the signature and an idea from the world of 1-2-3-TQFTs,
I then go on to define a 'central extension' of the three dimensional
cobordism category.
This central extension corresponds to a 2-cocycle on the 3d cobordism
category,
and we will see that the construction implies that the associated MMM-class
has to vanish on all 3-dimensional manifold bundles.

Commuting concerns people’s spatial behaviour resulting from the geographic separation of home and workplace and is connected with their willingness to seek economic opportunities outside their place of residence (Rouwendal J., Nijkamp P., 2004). Such opportunities are usually found in the urban areas, so this phenomenon is often a subject of urban studies or research focusing on city centres (Drejerska N., Chrzanowska M., 2014). In literature, commuting patterns are used to determine the boundaries of local and regional labour markets. Furthermore, labour market is one of the most important features for the delimitation of functional regions, as commuting involves not only working outside one’s place of residence but also, among other things, using various services offered there, from shopping to health or cultural services. Taking this into account, it can be stated that commuting is an important characteristic of relations between territories, and these relations form complex networks.

People decide to commute to work for various reasons. Most commuters travel from a small town, village or rural area to a city or town where they have a wider range of employment opportunities. However, people differ in their attitudes toward commuting. While some people find it troublesome, others enjoy their daily travel. There are also people who regard commuting as the necessary condition for supporting themselves and their families. Therefore, commuting is an important factor that should be taken into account in the research on the quality of life and quality of work.

The main goals of this presentation is to identify and analyse relations between communities (municipalities) from the perspective of labour market, especially commuting in the vicinity of Warsaw, Data on the number of commuters come from the Central Statistical Office of Poland and cover the year 2011.

 Bibliography

Drejerska N., Chrzanowska M., 2014: Commuting in the Warsaw suburban area from a spatial perspective – an example of empirical research, Acta Universitatis Lodziensis. Folia Oeconomica 2014, Vol. 6, no 309, pp. 87-96.

Rouwendal J., Nijkamp P., 2004: Living in Two Worlds: A Review of Home-to-Work Decisions, Growth and Change, Volume 35, Issue 3, p. 287.

In recent years, much attention has been given to single-cell RNA sequencing techniques as they allow researchers to examine the functions and relationships of single cells inside a tissue. In this study, we combine single-cell RNA sequencing data with protein–protein interaction networks (PPINs) to detect active modules in cells of different transcriptional states. We achieve this by clustering single-cell RNA sequencing data, constructing node-weighted PPINs, and identifying the maximum-weight connected subgraphs with an exact Steiner-Tree approach. As a case study, we investigate RNA sequencing data from human liver spheroids but the techniques described here are applicable to other organisms and tissues. The benefits of our novel method are two-fold: First, it allows us to identify important proteins (e.g., receptors) which are not detected from a differential gene-expression analysis as they only interact with proteins that are transcribed in higher levels. Second, we find that different transcriptional states have different subnetworks of the PPIN significantly overexpressed. These subnetworks often reflect known biological pathways (e.g., lipid metabolism and stress response) and we obtain a nuanced picture of cellular function as we can associate them with a subset of all analysed cells.

The advent of social media and the resulting ability to instantaneously communicate ideas and messages to connections worldwide is one of the great consequences arising from the telecommunications revolution over the last century. Individuals do not, however, communicate only upon a single platform; instead there exists a plethora of options available to users, many of whom are active on a number of such media. While each platform offers some unique selling point to attract users, e.g., keeping up to date with friends through messaging and statuses (Facebook), photo sharing (Instagram), seeing information from friends, celebrities and numerous other outlets (Twitter) or keeping track of the career paths of friends and past colleagues (Linkedin), the platforms are all based upon the fundamental mechanisms of connecting with other users and transmitting information to them as a result of this link.

In this talk a model for the spreading of online information or “memes" on multiplex networks is introduced and analyzed using branching-process methods. The model generalizes that of [Gleeson et al., Phys. Rev. X., 2016] in two ways. First, even for a monoplex (single-layer) network, the model is defined for any specific network defined by its adjacency matrix, instead of being restricted to an ensemble of random networks. Second, a multiplex version of the model is introduced to capture the behavior of users who post information from one social media platform to another. In both cases the branching process analysis demonstrates that the dynamical system is, in the limit of low innovation, poised near a critical point, which is known to lead to heavy-tailed distributions of meme popularity similar to those observed in empirical data.

[1] J. P. Gleeson et al. “Effects of network structure, competition and memory time on social spreading phenomena”. Physical Review X 6.2 (2016), p. 021019.

[2] J. D. O’Brien et al. "Spreading of memes on multiplex networks." New Journal of Physics 21.2 (2019): 025001.