Results 51 to 60 of about 4,148,143 (214)
Predicting zero reductions in Gr\"obner basis computations
Since Buchberger's initial algorithm for computing Gr\"obner bases in 1965 many attempts have been taken to detect zero reductions in advance. Buchberger's Product and Chain criteria may be known the most, especially in the installaton of Gebauer and M ...
Eder, Christian
core +1 more source
We extend the theory and the algorithms of Border Bases to systems of Laurent polynomial equations, defining "toric" roots. Instead of introducing new variables and new relations to saturate by the variable inverses, we propose a more efficient approach ...
Mourrain, Bernard, Trebuchet, Philippe
core +6 more sources
The Universal Gröbner Basis of a Binomial Edge Ideal [PDF]
We show that the universal Grobner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph.
M. Badiane, Isaac Burke, Emil Sköldberg
semanticscholar +1 more source
Uniqueness of the sum of points of the period five cycle of quadratic polynomials
It is well known that the sum of points of the period five cycle of the quadratic polynomial $f_{c}(x)=x^{2}+c$ is generally not one-valued. In this paper we will show that the sum of cycle points of the curves of period five is at most three-valued on a
Kosunen, Pekka
core +2 more sources
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
FTheoryTools: Advancing Computational Capabilities for F‐Theory Research
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
ABSTRACT We study asymptotic dynamics of Kuramoto oscillators with inertia and frustration using the classical perturbation theory of ordinary differential equation systems. Frustration also known as the phase‐lag poses challenges for the mathematical analysis of asymptotic dynamics due to the breakdown of total phase conservation and the gradient ...
Hangjun Cho +2 more
wiley +1 more source
Model category structures on truncated multicomplexes for complex geometry
Abstract To a bicomplex one can associate two natural filtrations, the column and row filtrations, and then two associated spectral sequences. This can be generalized to N$N$‐multicomplexes. We present a family of model category structures on the category of N$N$‐multicomplexes where the weak equivalences are the morphisms inducing a quasi‐isomorphism ...
Joana Cirici +2 more
wiley +1 more source
Polarization and Gorenstein liaison
Abstract A major open question in the theory of Gorenstein liaison is whether or not every arithmetically Cohen–Macaulay subscheme of Pn$\mathbb {P}^n$ can be G‐linked to a complete intersection. Migliore and Nagel showed that if such a scheme is generically Gorenstein (e.g., reduced), then, after re‐embedding so that it is viewed as a subscheme of Pn ...
Sara Faridi +3 more
wiley +1 more source
Grobner Basis Approach to Some Combinatorial Problems [PDF]
We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the \GB of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express
Victor Ufnarovski
doaj

