'I Like the Metamorphosis of the Characters': Dynamics of Transnational Television Comedy Engagement

This article contributes to debates on transnational television comedy audiences through analysis of Eastern European audiences’ engagement with British television comedy. Using questionnaire and focus group data it examines the extent and nature of British television comedy engagement by Romanian audiences and the limits of broadcasting British television comedy to Romanian audiences. The research reveals Romanian audiences’ high involvement with television comedy. Over half of questionnaire respondents watch British television comedy. Three themes regarding Romanian audiences’ engagement with British television comedy are identified in the focus group data: 1) transnational television comedy aesthetics; 2) transnational television comedy as intellectual comedy; and 3) ethical limits of transnational television comedy. These themes highlight the complex contours of transnational television comedy engagement.https://ijoc.org/index.php/ijoc/article/view/2941/152

Un model geometric al legaturilor directe dintre fenomenele economice

Abstract. In this paper we approach the issue of the evolution of economic phenomena that influence one another. First of all, we introduce a geometric model to establish whether there is a direct influence between two economic phenomena. After this, we find out the strength of this influence and, finally, we suggest a model for the form of this influence.Key words: economic phenomenon; evolution; development; increase; decrease

Subfactors of index less than 5, part 1: the principal graph odometer

In this series of papers we show that there are exactly ten subfactors, other than $A_\infty$ subfactors, of index between 4 and 5. Previously this classification was known up to index $3+\sqrt{3}$. In the first paper we give an analogue of Haagerup's initial classification of subfactors of index less than $3+\sqrt{3}$, showing that any subfactor of index less than 5 must appear in one of a large list of families. These families will be considered separately in the three subsequent papers in this series.Comment: 36 pages (updated to reflect that the classification is now complete

A planar calculus for infinite index subfactors

We develop an analog of Jones' planar calculus for II_1-factor bimodules with arbitrary left and right von Neumann dimension. We generalize to bimodules Burns' results on rotations and extremality for infinite index subfactors. These results are obtained without Jones' basic construction and the resulting Jones projections.Comment: 56 pages, many figure

Semi-regular masas of transfinite length

In 1965 Tauer produced a countably infinite family of semi-regular masas in the hyperfinite $\mathrm{II}_1$ factor, no pair of which are conjugate by an automorphism. This was achieved by iterating the process of passing to the algebra generated by the normalisers and, for each $n\in\mathbb N$, finding masas for which this procedure terminates at the $n$-th stage. Such masas are said to have length $n$. In this paper we consider a transfinite version of this idea, giving rise to a notion of ordinal valued length. We show that all countable ordinals arise as lengths of semi-regular masas in the hyperfinite $\mathrm{II}_1$ factor. Furthermore, building on work of Jones and Popa, we obtain all possible combinations of regular inclusions of irreducible subfactors in the normalising tower.Comment: 14 page

Spectral measures of small index principal graphs

The principal graph $X$ of a subfactor with finite Jones index is one of the important algebraic invariants of the subfactor. If $\Delta$ is the adjacency matrix of $X$ we consider the equation $\Delta=U+U^{-1}$. When $X$ has square norm $\leq 4$ the spectral measure of $U$ can be averaged by using the map $u\to u^{-1}$, and we get a probability measure $\epsilon$ on the unit circle which does not depend on $U$. We find explicit formulae for this measure $\epsilon$ for the principal graphs of subfactors with index $\le 4$, the (extended) Coxeter-Dynkin graphs of type $A$, $D$ and $E$. The moment generating function of $\epsilon$ is closely related to Jones' $\Theta$-series.Comment: 23 page

A Parameterized Study of Maximum Generalized Pattern Matching Problems

The generalized function matching (GFM) problem has been intensively studied starting with Ehrenfreucht and Rozenberg (Inf Process Lett 9(2):86–88, 1979). Given a pattern p and a text t, the goal is to find a mapping from the letters of p to non-empty substrings of t, such that applying the mapping to p results in t. Very recently, the problem has been investigated within the framework of parameterized complexity (Fernau et al. in FSTTCS, 2013). In this paper we study the parameterized complexity of the optimization variant of GFM (called Max-GFM), which has been introduced in Amir and Amihood (J Discrete Algorithms 5(3):514–523, 2007). Here, one is allowed to replace some of the pattern letters with some special symbols “?”, termed wildcards or don’t cares, which can be mapped to an arbitrary substring of the text. The goal is to minimize the number of wildcards used. We give a complete classification of the parameterized complexity of Max-GFM and its variants under a wide range of parameterizations, such as, the number of occurrences of a letter in the text, the size of the text alphabet, the number of occurrences of a letter in the pattern, the size of the pattern alphabet, the maximum length of a string matched to any pattern letter, the number of wildcards and the maximum size of a string that a wildcard can be mapped to