Related papers: Near orders and codes
This paper introduces a reduced order modeling technique based on Koopman operator theory that gives confidence bounds on the model's predictions. It is based on a data-driven spectral decomposition of the Koopman operator. The reduced…
This paper presents the first use of graph neural networks (GNNs) for higher-order proof search and demonstrates that GNNs can improve upon state-of-the-art results in this domain. Interactive, higher-order theorem provers allow for the…
This work builds on earlier work of the first three authors where a notion of congruence modules in higher codimension is introduced. The main new results are a criterion for detecting regularity of local rings in terms of congruence…
In this introductory paper we study nearly Frobenius algebras which are generalizations of the concept of a Frobenius algebra which appear naturally in topology: nearly Frobenius algebras have no traces (co-units). We survey the most basic…
Codes from generalized Hadamard matrices have already been introduced. Here we deal with these codes when the generalized Hadamard matrices are cocyclic. As a consequence, a new class of codes that we call generalized Hadamard full…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
In approximation theory classical discrete operators, like generalized sampling, Sz\'{a}sz-Mirak'jan, Baskakov and Bernstein operators, have been extensively studied for scalar functions. In this paper, we look at the approximation of…
In a series of recent papers, W. M. Schmidt and L. Summerer developed a new theory by which they recover all major generic inequalities relating exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and find new ones. Given a…
In this work we produce a framework for constructing universal function approximators on graph isomorphism classes. We prove how this framework comes with a collection of theoretically desirable properties and enables novel analysis. We…
This Diplom thesis provides an explicit construction of a quantum Goppa code for any hyperelliptic curve over a non-binary field. Hyperelliptic curves have conjugate pairs of rational places. We use these pairs to construct self-orthogonal…
The main objective of this paper is to construct a homotopy colimit functor on a category of functors taking values in the model category of quasi-categories.
The first author recently introduced a "nearby cycles formalism" in the framework of chain complexes of parity sheaves. In this paper, we compute this functor in two related settings: (i) affine space, stratified by the action of a torus,…
We introduce a universally applicable method, based on the bond-algebraic theory of dualities, to search for generalized order parameters in disparate systems including non-Landau systems with topological order. A key notion that we advance…
We define Convolutional Goppa Codes over algebraic curves and construct their corresponding dual codes. Examples over the projective line and over elliptic curves are described, obtaining in particular some Maximum-Distance Separable (MDS)…
Logical models have been successfully used to describe regulatory and signaling networks without requiring quantitative data. However, existing data is insufficient to adequately define a unique model, rendering the parametrization of a…
In this paper, we will study some connections between Hilbert al- gebras and binary block-codes.With these codes, we can eassy obtain orders which determine suplimentary properties on these algebras. We will try to emphasize how, using…
Higher-order graph neural networks (HOGNNs) and the related architectures from Topological Deep Learning are an important class of GNN models that harness polyadic relations between vertices beyond plain edges. They have been used to…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
We construct higher order spectral shift functions, extending the perturbation theory results of M. G. Krein and L. S. Koplienko on representations for the remainders of the first and second order Taylor-type approximations of operator…