Related papers: Descending sequences in reflection hierarchies

We develop and collect techniques for determining Hochschild cohomology of skew group algebras S(V)#G and apply our results to graded Hecke algebras. We discuss the explicit computation of certain types of invariants under centralizer…

We prove that the statement "there is a $k$ such that for every $f$ there is a $k$-bounded diagonally non-recursive function relative to $f$" does not imply weak K\"onig's lemma over $\mathrm{RCA}_0 + \mathrm{B}\Sigma^0_2$. This answers a…

In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…

We generalise various theorems for finding indiscernible trees and arrays to positive logic: based on an existing modelling theorem for s-trees, we prove modelling theorems for str-trees, str$_0$-trees (the reduct of str-trees that forgets…

In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…

We compute the divisor of the modular equation on the modular curve $\Gamma_0(N) \backslash \mathbb H^*$ and then find recurrence relations satisfied by the modular traces of the Hauptmodul for any congruence subgroup $\Gamma_0(N)$ of genus…

Mathematical models play an increasingly important role in the interpretation of biological experiments. Studies often present a model that generates the observations, connecting hypothesized process to an observed pattern. Such generative…

In the mid thirties Murray and von Neumann found a natural way to associate a von Neumann algebra $L(\Gamma)$ to any countable discrete group $\Gamma$. Classifying $L(\Gamma)$ in term of $\Gamma$ is a notoriously complex problem as in…

A set $G \subseteq \omega$ is $n$-generic for a positive integer $n$ if and only if every $\Sigma^0_n$ formula of $G$ is decided by a finite initial segment of $G$ in the sense of Cohen forcing. It is shown here that every $n$-generic set…

Grunewald and O'Halloran conjectured in 1993 that every complex nilpotent Lie algebra is the degeneration of another, non isomorphic, Lie algebra. We prove the conjecture for the class of nilpotent Lie algebras admitting a semisimple…

We develop a behavioural theory of reflective sequential algorithms (RSAs), i.e. sequential algorithms that can modify their own behaviour. The theory comprises a set of language-independent postulates defining the class of RSAs, an…

We study the coherence and conservativity of extensions of dependent type theories by additional strict equalities. By considering notions of congruences and quotients of models of type theory, we reconstruct Hofmann's proof of the…

Descriptive complexity theory aims at inferring a problem's computational complexity from the syntactic complexity of its description. A cornerstone of this theory is Fagin's Theorem, by which a graph property is expressible in existential…

We calculate all decomposition matrices of the cyclotomic Hecke algebras of the rank 2 exceptional complex reflection groups in characteristic 0. We prove the existence of canonical basic sets in the sense of Geck-Rouquier and show that all…

In this article, we give a family of examples of algebras, showing that for every $n \geq 2$ and $m \geq 0$, there is an algebra displaying a path of n irreducible morphisms between indecomposable modules whose composite lies in the…

We describe a "slow" version of the hierarchy of uniform reflection principles over Peano Arithmetic ($\mathbf{PA}$). These principles are unprovable in Peano Arithmetic (even when extended by usual reflection principles of lower…

We describe a finitary 2-monad on a locally finitely presentable 2-category for which not every pseudoalgebra is equivalent to a strict one. This shows that having rank is not a sufficient condition on a 2-monad for every pseudoalgebra to…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We analyse divergent diagrams of \(k\)-fold map-germs on \((\mathbb{C}^n,0)\), for $k, n \geq 2$, associated with reflections, adapting to the complex setting the theory of folds associated with involutions on \((\mathbb{R}^n,0)\). In the…

We classify gradings on matrix algebras by a finite abelian group. A grading is called good if all elementary matrices are homogeneous. For cyclic groups, all gradings on a matrix algebra over an algebraically closed field are good. We can…