Related papers: Graded Galois Lattices and Closed Itemsets
We study properties that allow first-order theories to be disjointly combined, including stable infiniteness, shininess, strong politeness, and gentleness. Specifically, we describe a Galois connection between sets of decidable theories,…
We define graded group schemes and graded group varieties and develop their theory. Graded group schemes are the graded analogue of group schemes and are in correspondence with graded Hopf algebra. In this setting, graded group varieties…
Lattice-based Cryptography is considered to have the characteristics of classical computers and quantum attack resistance. We will design various graphic lattices and matrix lattices based on knowledge of graph theory and topological…
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
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…
We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…
We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…
These notes are an exposition of Galois Theory from the original Lagrangian and Galoisian point of view. A particular effort was made here to better understand the connection between Lagrange's purely combinatorial approach and Galois…
A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…
Higher gauge theory is a higher order version of gauge theory that makes possible the definition of 2-dimensional holonomy along surfaces embedded in a manifold where a gauge 2-connection is present. In this paper, we will continue the…
GRAFT is a structured multimodal benchmark designed to probe how well LLMs handle instruction following, visual reasoning, and tasks requiring tight visual textual alignment. The dataset is built around programmatically generated charts and…
Finite fields form an important chapter in abstract algebra, and mathematics in general. We aim to provide a geometric and intuitive model for finite fields, involving algebraic numbers, in order to make them accessible and interesting to a…
This paper studies algebras arising as algebraic semantics for logics used to model reasoning with incomplete or inconsistent information. In particular we study, in a uniform way, varieties of bilattices equipped with additional…
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
The aim of this article is to give practicing teachers an overview about the theory behind paperfolding, it is my qualifying thesis(Zulassungsarbeit) as a teacher in Germany. It is a survey about the relations between paperfolding and…
Knowledge Graph Completion is a task of expanding the knowledge graph/base through estimating possible entities, or proper nouns, that can be connected using a set of predefined relations, or verb/predicates describing interconnections of…
A large body of recent work has identified transformations in the latent spaces of generative adversarial networks (GANs) that consistently and interpretably transform generated images. But existing techniques for identifying these…
Ludics is a logical framework in which types/formulas are modelled by sets of terms with the same computational behaviour. This paper investigates the representation of inductive data types and functional types in ludics. We study their…
We formalize the Gauss-Landau theorem, providing a unified prime factorization approach to computing the GCD and LCM of finite nonzero integer sets. Although commonly used as a heuristic or technique in elementary number theory education,…
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…