Related papers: A Galois Connection for Weighted (Relational) Clon…

In $1991$, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's duality theorem has since been extensively studied from different…

We study the basic Galois connection induced by the "satisfaction" relation between external operations $A^n\rightarrow B$ defined on a set $A$ and valued in a possibly different set $B$ on the one hand, and ordered pairs $(R,S)$ of…

Recently, different works proposed a new way to mine patterns in databases with pathological size. For example, experiments in genome biology usually provide databases with thousands of attributes (genes) but only tens of objects…

The question of graviton cloning in the context of the bulk/boundary correspondence is considered. It is shown that multi-graviton theories can be obtained from products of large-N CFTs. No more than one interacting massless graviton is…

We consider $S$-operations $f \colon A^{n} \to A$ in which each argument is assigned a signum $s \in S$ representing a "property" such as being order-preserving or order-reversing with respect to a fixed partial order on $A$. The set $S$ of…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

Given a family of continuous real functions $\mathcal{G}$, let $R_\mathcal{G}$ be a binary relation defined as follows: a continuous function $f\colon\mathbb{R}\to\mathbb{R}$ is in the relation with a closed set $E\subseteq\mathbb{R}$ if…

A fundamental theorem of Katz \cite{Katz87} determines the differential Galois groups of rank $n$ connections on algebraic curves with slope $r/n$ at a singularity, where $\gcd(r,n)=1$. We extend this result to $G$-connections, where $G$ is…

Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…

One of the key points in Galois theory via field extensions is to build up a correspondence between subfields of a field and subgroups of its automorphism group, so as to study fields via methods of groups. As an analogue of the Galois…

In this paper, we prove new instances of the inverse Galois problem over global function fields for finite groups of Lie type. This is done by constructing compatible systems of $\ell$-adic Galois representations valued in a semisimple…

For each clone C on a set A there is an associated equivalence relation analogous to Green's R-relation, which relates two operations on A iff each one is a substitution instance of the other using operations from C. We study the clones for…

In this paper we extend a conjecture of Ash and Sinnott relating niveau one Galois representation to the mod p cohomology of congruence subgroups of SL(n,Z) to include Galois representations of higher niveau. We then present computational…

We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between…

We consider the problem of correlation clustering on graphs with constraints on both the cluster sizes and the positive and negative weights of edges. Our contributions are twofold: First, we introduce the problem of correlation clustering…

Preclones are described as the closed classes of the Galois connection induced by a preservation relation between operations and matrix collections. The Galois closed classes of matrix collections are also described by explicit closure…

We show that between any pair of Galois conjugate blocks of finite group algebras, there exists an isotypy with all signs positive.

Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is…

We consider sets of operations on a set A that are closed under permutation of variables, addition of dummy variables and composition. We describe these closed sets in terms of a Galois connection between operations and systems of pointed…

There exist two conjectures for constraint satisfaction problems (CSPs) of reducts of finitely bounded homogeneous structures: the first one states that tractability of the CSP of such a structure is, when the structure is a model-complete…