Results 41 to 50 of about 3,441,413 (166)
International Journal of Eating Disorders, Volume 59, Issue 2, Page 260-275, February 2026.ABSTRACT Objective Anorexia nervosa (AN) is a severe eating disorder associated with brain volume reduction, glial cell loss, microbiome alterations, and dysregulated pro‐inflammatory mechanisms. However, the underlying cellular mechanisms remain inadequately elucidated, and interventions addressing these alterations are lacking.
A. C. Thelen +17 more
wiley +1 more source
An Algorithm to Compute the H-Bases for Ideals of Subalgebras
Discrete Dynamics in Nature and Society, 2021 The concept of H-bases, introduced long ago by Macauly, has become an important ingredient for the treatment of various problems in computational algebra.
Rabia +4 more
doaj +1 more source
A tropical approach to rigidity: Counting realisations of frameworks
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract A realisation of a graph in the plane as a bar‐joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely many realisations can be seen as a solution to a system of quadratic equations prescribing the distances between pairs of points.
Oliver Clarke +6 more
wiley +1 more source
Gröbner Basis with applications
, 2020 A basis for an ideal is such that every element in the ideal can be expressed as a linear combination of the basis. With a Gröbner Basis, every polynomial can be expressed as a linear combination of the basis with a unique remainder.
Zhang, Eric Boyuan
core
The buchberger Gröbner basis algorithm
, 2013 This Demonstration shows the main steps of Buchberger's Gröbner basis algorithm for a chosen monomial ordering. (Only two choices of monomial ordering are used here.) The input is a basis for an ideal in the ring of polynomials in two variables ...
Kozlowski, Andrzej
core +3 more sources
, 2011 Yüksek Lisans TeziGröbner Tabanları olarak adlandırılan bu çalışmada izlenen plan aşağıdaki biçimdedir. I. Bölümde çok değişkenli polinomlar ile ilgili genel bilgiler verilmiştir. II. Bölümde terim sıralamaları ve indirgemeler çalışılmıştır. III. Bölümde
Özenir, Yusuf
core +1 more source
An Implementation in C of an Algorithm for Construction of Finitely Presented Lie Superalgebras [PDF]
Computer Science Journal of Moldova, 1996 The purpose of this paper is to describe a C program FPLSA for investigating finitely presented Lie algebras and superalgebras. The program takes as input data a finite set of generators and relations for these elements.
V. Gerdt, V. Kornyak
doaj
F‐purity of binomial edge ideals
Journal of the London Mathematical Society, Volume 113, Issue 2, February 2026.Abstract In 2012, Matsuda introduced the class of weakly closed graphs and investigated when binomial edge ideals are F‐pure. He proved that weakly closed binomial edge ideals are F‐pure whenever the base field has positive characteristic. He conjectured that: (i) when the base field has characteristic 2, every F‐pure binomial edge ideal comes from a ...
Adam LaClair, Jason McCullough
wiley +1 more source
Constructing the Grobner basis using Anick's resolution in the noncommutative algebras [PDF]
Computer Science Journal of Moldova, 1996 This article describes the method of construction the Grobner basis based on the information in the Anick's resolution.
A. Podoplelov
doaj
FTheoryTools: Advancing Computational Capabilities for F‐Theory Research
Fortschritte der Physik, Volume 74, Issue 1, January 2026.Abstract A primary goal of string phenomenology is to identify realistic four‐dimensional physics within the landscape of string theory solutions. In F‐theory, such solutions are encoded in the geometry of singular elliptic fibrations, whose study often requires particularly challenging and cumbersome computations.
Martin Bies +2 more
wiley +1 more source