Related papers: A Constructive Framework for Galois Connections
To put static program analysis at the fingertips of the software developer, we propose a framework for interactive abstract interpretation. While providing sound analysis results, abstract interpretation in general can be quite costly. To…
We present a new language for persistent homology in terms of Galois connections. This language has two main advantages over traditional approaches. First, it simplifies and unifies central concepts such as interleavings and matchings.…
In this paper we give a unified approach in categorical setting to the problem of finding the Galois closure of a finite cover, which includes as special cases the familiar finite separable field extensions, finite unramified covers of a…
We discuss the concept of Galois structure and Galois epimorphism in a general setting. Namely, a Galois structure for an epimorphism $\pi\colon M\to B$ in some category ${\mathcal C}$ is the action of a group object that gives to $M$ the…
For the Galois closure $\Xgal$ of a generic projection from a surface $X$, it is believed that $\pi_1(\Xgal)$ gives rise to new invariants of $X$. However, in all examples this group is surprisingly simple. In this article, we offer an…
We relate two different proposals to extend the \'etale topology into homotopy theory, namely via the notion of finite cover introduced by Mathew and via the notion of separable commutative algebra introduced by Balmer. We show that finite…
We study the structure of the absolute differential Galois group of a rational function field over an algebraically closed field of characteristic zero. In particular, we relate the behavior of differential embedding problems to the…
Directed acyclic graphs (DAGs) constitute a central modeling tool to enable principled reasoning about cause-effect interactions in complex systems. However, since the causal structure underlying a group of variables is often unknown and…
After discussing the significance of interactions to understand complex multiscale stochastic systems (CMSS), we turn our attention to the construction of a Generalised Theory of Interactions (GToI). We define interactions as discrete,…
Fixed an algebraic scheme $Y$. We suggest a definition for the conjugate of an algebraic scheme $X$ over $Y$ in an evident manner; then $X$ is said to be Galois closed over $Y$ if $X$ has a unique conjugate over $Y$. Now let $X$ and $Y$…
The fundamental concepts in the Galois Theory are separable, normal and Galois field extensions. These concepts are central in proofs of the Galois Theory. In the paper, we introduce a new approach, a ring theoretic approach, to the Galois…
We extend and apply the Galois theory of linear differential equations equipped with the action of an endomorphism. The Galois groups in this Galois theory are difference algebraic groups and we use structure theorems for these groups to…
Linear differential algebraic groups (LDAGs) appear as Galois groups of systems of linear differential and difference equations with parameters. These groups measure differential-algebraic dependencies among solutions of the equations.…
The traditional abstract domain framework for imperative programs suffers from several shortcomings; in particular it does not allow precise symbolic abstractions. To solve these problems, we propose a new abstract interpretation framework,…
Causal abstraction offers a principled framework for mechanistic interpretability, aligning a high-level causal model with the low-level computation realized by a neural network through counterfactual intervention analysis. Existing methods…
We study Bayesian model selection in colored Gaussian graphical models (CGGMs), which combine sparsity of conditional independencies with symmetry constraints encoded by vertex- and edge-colored graphs. A computational bottleneck in…
This is a collection of example computations that are cited in the Appendix of [DNT]. In each case, the aim is to show that the extension of a given finite simple group by an elementary abelian group of given rank has the property that not…
This short note describes and proves a connectedness property which was introduced in Blocher et al. [2023] in the context of data depth functions for partial orders. The connectedness property gives a structural insight into union-free…
Girard's Geometry of Interaction (GoI), a semantics designed for linear logic proofs, has been also successfully applied to programming language semantics. One way is to use abstract machines that pass a token on a fixed graph along a path…
Inter-domain Gaussian processes (GPs) allow for high flexibility and low computational cost when performing approximate inference in GP models. They are particularly suitable for modeling data exhibiting global structure but are limited to…