Related papers: Techniques for approaching the dual Ramsey propert…
In this article we survey recent results on rigid dualizing complexes over commutative algebras. We begin by recalling what are dualizing complexes. Next we define rigid complexes, and explain their functorial properties. Due to the…
In this short note, we shall prove some observations regarding the connection between indestructible $\omega_1$-guessing models and the $\omega_1$-approximation property of forcing notions.
We consider the restriction of Ramsey's theorem that arises from considering only translation-invariant colourings of pairs, and show that this has the same strength (both from the viewpoint of Reverse Mathematics and from the viewpoint of…
We find that second order quantification is problematic when a quantified concept variable is supposed to function predicatively. This issue is analyzed and it is shown that a constructive interpretation of the falling under relation…
Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the…
What does it mean for an algorithm to be fair? Different papers use different notions of algorithmic fairness, and although these appear internally consistent, they also seem mutually incompatible. We present a mathematical setting in which…
Suppose we are given a computably enumerable object arise from algorithmic randomness or computable analysis. We are interested in the strength of oracles which can compute an object that approximates this c.e. object. It turns out that,…
Recent work in hypergraph Ramsey theory has involved the introduction of a "lifting map" that associates a certain $3$-uniform hypergraph to a given graph, bounding cliques in a predictable way. In this paper, we interpret the lifting map…
The paper considers the problem of finding the number of dominant voters in two-level voting procedures. At the first stage, voting is conducted among local groups of voters, and at the second stage, the results are aggregated to form a…
Using the superfield formalism and the master action approach, we prove, both at the classical and quantum levels, the dual equivalence between four-dimensional supersymmetric self-dual and topologically massive models coupled to dynamical…
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, and beyond. The purpose of this paper is to illustrate the…
We survey recent developments concerning two properties of classes of finite structures: the Ramsey property and the extension property for partial automorphisms (EPPA).
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…
Projection maps which appear in the theory of buildings and oriented matroids are closely related to the notion of shellability. This was first observed by Bj{\"o}rner. In this paper, we give an axiomatic treatment of either concept and…
We propose a computationally straightforward test for the linearity of a spatial interaction function. Such functions arise commonly, either as practitioner imposed specifications or due to optimizing behaviour by agents. Our conditional…
We use the exterior product of double forms to reformulate celebrated classical results of linear algebra about matrices and bilinear forms namely the Cayley-Hamilton theorem, Laplace expansion of the determinant, Newton identities and…
Slicing a module into semisimple ones is useful to study modules. Loewy structures provide a means of doing so. To establish the Loewy structures of projective modules over a finite dimensional symmetric algebra over a field $F$, the…
Given a topological Ramsey space $(\mathcal R,\leq, r)$, we extend the notion of semiselective coideal to sets $\mathcal H\subseteq\mathcal R$ and study conditions for $\mathcal H$ that will enable us to make the structure $(\mathcal…
Representing and navigating hierarchy is a fundamental primitive of reasoning. Large language models have demonstrated proficiency in a wide variety of tasks requiring hierarchical reasoning, but there exists limited analysis on how the…
Identities that relate projections of Raviart-Thomas finite element vector fields to discrete gradients of Crouzeix-Raviart finite element functions are derived under general conditions. Various implications such as discrete convex duality…