Related papers: FinInG: a package for Finite Incidence Geometry

Neural operators aim to learn mappings between infinite-dimensional function spaces, but their performance often degrades on complex or irregular geometries due to the lack of geometry-aware representations. We propose the Finite Element…

In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative…

Physics Informed Neural Networks (PINNs) have been emerging as a powerful computational tool for solving differential equations. However, the applicability of these models is still in its initial stages and requires more standardization to…

I extend the framework of rigid analytic geometry to the setting of algebraic geometry relative to monoids, and study the associated notions of separated, proper, and overconvergent morphisms. The category of affine manifolds embeds as a…

Graph neural networks (GNNs) are widely used for modelling graph-structured data in numerous applications. However, with their inherently finite aggregation layers, existing GNN models may not be able to effectively capture long-range…

In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…

Finite trigonometric Fourier series on a set of discrete equidistant points are considered. A finite system of orthogonal functions that have interpolation and certain differential properties on the period is introduced. Finite Fourier…

Physics Informed Neural Networks (PINNs) have recently gained popularity for solving partial differential equations, given the fact they escape the curse of dimensionality. In this paper, we present Physics Informed Neural Networks as an…

We present here algorithms for efficient computation of linear algebra problems over finite fields.

This paper shows that quantization of $\pi$-finite spaces, as a functor out of a higher category of spans, is equivariant in two ways: Symmetries of a given polarization/Lagrangian always induce coherent symmetries of the quantization. On…

We define formal exponential maps for any graded manifold as maps from the formal tangent bundle (that we also define) into the graded manifold. We show that each such map uniquely determines and is determined by its associated Grothendieck…

We propose a totally functional view of geometric matrix completion problem. Differently from existing work, we propose a novel regularization inspired from the functional map literature that is more interpretable and theoretically sound.…

We study canonical filtrations of finite-dimensional associative algebras and Lie algebras. These filtrations are defined via optimal destabilizing one-parameter subgroups in the sense of geometric invariant theory (GIT), and appear to be a…

In this paper, the (infinite) direct product of fields is investigated. In particular, the finiteness of a given set is characterized in terms of some ring-theoretic observations. Next, a certain localization (whose multiplicative set…

Graph partitioning is the problem of dividing the nodes of a graph into balanced partitions while minimizing the edge cut across the partitions. Due to its combinatorial nature, many approximate solutions have been developed, including…

In the past two decades, some major efforts have been made to reduce exact (e.g. integer, rational, polynomial) linear algebra problems to matrix multiplication in order to provide algorithms with optimal asymptotic complexity. To provide…

Affinely closed homogeneous spaces G/H, i.e., affine homogeneous spaces that admit only the trivial affine embedding, are characterized for any affine algebraic group G. As a corollary, a description of affine G-algebras with finitely…

We present FaRe, a package for Mathematica that implements the decomposition of a generic tensor Feynman integral, with arbitrary loop number, into scalar integrals in higher dimension. In order for FaRe to work, the package FeynCalc is…

This paper presents `chipfiring`, a comprehensive Python package for the mathematical analysis of chip-firing games on finite graphs. The package provides a robust toolkit for defining graphs and chip configurations (divisors), performing…

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on applications in computational mechanics and design optimization. We leverage Mat\'ern-type…