Search arXiv⌕ Search

arXiv subjects

Mohamed Barakat

Publications and source records attributed to Mohamed Barakat.

At least 19 recordsLinked to original sources
arXiv2026

A Tree-Based Localized Reduced Basis Method for Parametrized Parabolic PDEs

We propose a localized reduced basis method for parametrized parabolic partial differential equations based on an adaptive partitioning of the parameter domain using hierarchical binary trees. A POD-Greedy procedure is employed to construct reduced spaces associated with each parameter subdomain. A certified \emph{a posteriori} error estimator is derived from an inf-sup stability analysis and shown to be equivalent to the underlying approximation error. This equivalence, together with suitable regularity assumptions on the parameter-to-solution map, enables a rigorous convergence analysis and is used to derive a strategy for selecting the number of POD modes to retain in each local reduced space. Numerical experiments for a parametrized convection--diffusion problem demonstrate the effectiveness of the proposed approach and confirm the predicted convergence behavior.

math.NA↗
arXiv2026

Implementing the biset category of finite groups

We describe an implementation of the biset category of finite groups as a tower of standard categorical constructions, all of which are implemented in the software project CAP for algorithmic category theory. In particular, we describe the composition of bisets as a composition in a Kleisli category of some biadjunction monad. This composition relies on the universal property of the coequalizer completion of a group viewed as a groupoid on one object. Expressing this universal property offers an elegant categorical interpretation of the Schreier-Sims orbit algorithm. Indeed, the implementation relies on every aspect of the algorithm.

math.CT↗
arXiv2025

Convergence analysis for a tree-based nonlinear reduced basis method

We develop and analyze a nonlinear reduced basis (RB) method for parametrized elliptic partial differential equations based on a binary-tree partition of the parameter domain into tensor-product structured subdomains. Each subdomain is associated with a local RB space of prescribed dimension, constructed via a greedy algorithm. A splitting strategy along the longest edge of the parameter subdomains ensures geometric control of the subdomains and enables a rigorous convergence analysis. Under the assumption that the parameter-to-solution map admits a holomorphic extension and that the resulting domain partition is quasi-uniform, we establish explicit bounds on the number of subdomains required to achieve a given tolerance for arbitrary parameter domain dimension and RB spaces size. Numerical experiments for diffusion and convection-diffusion problems confirm the theoretical predictions, demonstrating that the proposed approach, which has low storage requirements, achieves the expected convergence rates and in several cases outperforms an existing nonlinear RB method.

math.NA↗
arXiv2023

Feynman integral reduction using Gröbner bases

We investigate the reduction of Feynman integrals to master integrals using Gröbner bases in a rational double-shift algebra Y in which the integration-by-parts (IBP) relations form a left ideal. The problem of reducing a given family of integrals to master integrals can then be solved once and for all by computing the Gröbner basis of the left ideal formed by the IBP relations. We demonstrate this explicitly for several examples. We introduce so-called first-order normal-form IBP relations which we obtain by reducing the shift operators in Y modulo the Gröbner basis of the left ideal of IBP relations. For more complicated cases, where the Gröbner basis is computationally expensive, we develop an ansatz based on linear algebra over a function field to obtain the normal-form IBP relations.

hep-ph↗
arXiv2022

IBP reduction via Gröbner bases in a rational double-shift algebra

We report on an approach to integration-by-parts reduction based on Gröbner bases. We establish the underlying noncommutative rational double-shift algebra wherein the integration-by-parts relations form a left ideal. We describe in detail the one-loop massless box as an example where we achieved the full reduction to master integrals by means of the Gröbner basis approach, and report on the performance of the implementation. We also identify potential bottlenecks in more complicated examples and elaborate on interesting further directions.

hep-ph↗
arXiv2021

Computing the nonfree locus of the moduli space of arrangements and Terao's freeness conjecture

In this paper, we show how to compute using Fitting ideals the nonfree locus of the moduli space of arrangements of a rank $3$ simple matroid, i.e., the subset of all points of the moduli space which parametrize nonfree arrangements. Our approach relies on the so-called Ziegler restriction and Yoshinaga's freeness criterion for multiarrangements. We use these computations to verify Terao's freeness conjecture for rank $3$ central arrangements with up to $14$ hyperplanes in any characteristic.

math.AG↗
arXiv2021

On the generation of rank 3 simple matroids with an application to Terao's freeness conjecture

In this paper we describe a parallel algorithm for generating all non-isomorphic rank $3$ simple matroids with a given multiplicity vector. We apply our implementation in the HPC version of GAP to generate all rank $3$ simple matroids with at most $14$ atoms and a splitting characteristic polynomial. We have stored the resulting matroids alongside with various useful invariants in a publicly available, ArangoDB-powered database. As a byproduct we show that the smallest divisionally free rank $3$ arrangement which is not inductively free has $14$ hyperplanes and exists in all characteristics distinct from $2$ and $5$. Another database query proves that Terao's freeness conjecture is true for rank $3$ arrangements with $14$ hyperplanes in any characteristic.

math.CO↗
arXiv2021

An algorithmic approach to Chevalley's Theorem on images of rational morphisms between affine varieties

The goal of this paper is to introduce a new constructive geometric proof of the affine version of Chevalley's Theorem. This proof is algorithmic and a verbatim implementation resulted in an efficient code for computing the constructible image of rational maps between affine varieties. Our approach extends the known descriptions of uniform matrix product states to $\operatorname{uMPS}(2,2,5)$

math.AG↗
arXiv2020

Elimination via saturation

This short paper presents saturation-based algorithms for homogenization and elimination. This algorithm can compute elimination ideals by using syzygies and ideal membership test, hence it works with any} monomial order, in particular without the use of block-elimination orders. The used saturation is a translation of the geometric fact that the projective closure of an affine scheme has no components in the hyperplane at infinity.

math.AC↗
arXiv2020

Symmetries between measurements in quantum mechanics

Symmetries are a key concept to connect mathematical elegance with physical insight. We consider measurement assemblages in quantum mechanics and show how their symmetry can be described by means of the so-called discrete bundles. It turns out that many measurement assemblages used in quantum information theory as well as for studying the foundations of quantum mechanics are entirely determined by symmetry; moreover, starting from a certain symmetry group, novel types of measurement sets can be constructed. The insight gained from symmetry allows us to easily determine whether the measurements in the set are incompatible under noisy conditions, i.e., whether they can be regarded as genuinely distinct ones. In addition, symmetry enables us to identify finite sets of measurements having a high sensitivity to reveal the quantumness of distributed quantum states.

quant-ph↗
arXiv2017

An Axiomatic Setup for Algorithmic Homological Algebra and an Alternative Approach to Localization

In this paper we develop an axiomatic setup for algorithmic homological algebra of Abelian categories. This is done by exhibiting all existential quantifiers entering the definition of an Abelian category, which for the sake of computability need to be turned into constructive ones. We do this explicitly for the often-studied example Abelian category of finitely presented modules over a so-called computable ring $R$, i.e., a ring with an explicit algorithm to solve one-sided (in)homogeneous linear systems over $R$. For a finitely generated maximal ideal $\mathfrak{m}$ in a commutative ring $R$ we show how solving (in)homogeneous linear systems over $R_{\mathfrak{m}}$ can be reduced to solving associated systems over $R$. Hence, the computability of $R$ implies that of $R_{\mathfrak{m}}$. As a corollary we obtain the computability of the category of finitely presented $R_{\mathfrak{m}}$-modules as an Abelian category, without the need of a Mora-like algorithm. The reduction also yields, as a by-product, a complexity estimation for the ideal membership problem over local polynomial rings. Finally, in the case of localized polynomial rings we demonstrate the computational advantage of our homologically motivated alternative approach in comparison to an existing implementation of Mora's algorithm.

math.AC↗
arXiv2017

A constructive approach to the module of twisted global sections on relative projective spaces

The ideal transform of a graded module $M$ is known to compute the module of twisted global sections of the sheafification of $M$ over a relative projective space. We introduce a second description motivated by the relative BGG-correspondence. However, our approach avoids the full BGG-correspondence by replacing the Tate resolution with the computationally more efficient purely linear saturation and the Castelnuovo-Mumford regularity with the often enough much smaller linear regularity. This paper provides elementary, constructive, and unified proofs that these two descriptions compute the (truncated) modules of twisted global sections. The main argument relies on an established characterization of Gabriel monads.

math.AG↗
arXiv2014

On monads of exact reflective localizations of Abelian categories

In this paper we define Gabriel monads as the idempotent monads associated to exact reflective localizations in Abelian categories and characterize them by a simple set of properties. The coimage of a Gabriel monad is a Serre quotient category. The Gabriel monad induces an equivalence between its coimage and its image, the localizing subcategory of local objects.

math.CT↗
arXiv2014

Characterizing Serre quotients with no section functor and applications to coherent sheaves

We prove an analogon of the the fundamental homomorphism theorem for certain classes of exact and essentially surjective functors of Abelian categories $\mathscr{Q}:\mathcal{A} \to \mathcal{B}$. It states that $\mathscr{Q}$ is up to equivalence the Serre quotient $\mathcal{A} \to \mathcal{A} / \mathrm{ker} \mathscr{Q}$, even in cases when the latter does not admit a section functor. For several classes of schemes $X$, including projective and toric varieties, this characterization applies to the sheafification functor from a certain category $\mathcal{A}$ of finitely presented graded modules to the category $\mathcal{B}=\mathfrak{Coh} X$ of coherent sheaves on $X$. This gives a direct proof that $\mathfrak{Coh} X$ is a Serre quotient of $\mathcal{A}$.

math.CT↗
arXiv2014

On the Ext-computability of Serre quotient categories

To develop a constructive description of $\mathrm{Ext}$ in categories of coherent sheaves over certain schemes, we establish a binatural isomorphism between the $\mathrm{Ext}$-groups in Serre quotient categories $\mathcal{A}/\mathcal{C}$ and a direct limit of $\mathrm{Ext}$-groups in the ambient Abelian category $\mathcal{A}$. For $\mathrm{Ext}^1$ the isomorphism follows if the thick subcategory $\mathcal{C} \subset \mathcal{A}$ is localizing. For the higher extension groups we need further assumptions on $\mathcal{C}$. With these categories in mind we cannot assume $\mathcal{A}/\mathcal{C}$ to have enough projectives or injectives and therefore use Yoneda's description of $\mathrm{Ext}$.

math.KT↗
arXiv2014

The freeness of ideal subarrangements of Weyl arrangements

A Weyl arrangement is the arrangement defined by the root system of a finite Weyl group. When a set of positive roots is an ideal in the root poset, we call the corresponding arrangement an ideal subarrangement. Our main theorem asserts that any ideal subarrangement is a free arrangement and that its exponents are given by the dual partition of the height distribution, which was conjectured by Sommers-Tymoczko. In particular, when an ideal subarrangement is equal to the entire Weyl arrangement, our main theorem yields the celebrated formula by Shapiro, Steinberg, Kostant, and Macdonald. Our proof of the main theorem heavily depends on the theory of free arrangements and thus greatly differs from the earlier proofs of the formula.

math.CO↗
arXiv2013

On subdirect factors of a projective module and applications to system theory

We extend a result of Napp Avelli, van der Put, and Rocha with a system-theoretic interpretation to the noncommutative case: Let P be a f.g. projective module over a two-sided Noetherian domain. If P admits a subdirect product structure of the form P = M x_T L over a factor module T of grade at least 2 then the torsion-free factor of M (resp. L) is projective.

math.KT↗