Explicit finite algebraic formulas are given for some well-known sequences, including complements of polynomial sequences.
Scott J. Beslin
doaj +1 more source
AI in chemical engineering: From promise to practice
Abstract Artificial intelligence (AI) in chemical engineering has moved from promise to practice: physics‐aware (gray‐box) models are gaining traction, reinforcement learning complements model predictive control (MPC), and generative AI powers documentation, digitization, and safety workflows.
Jia Wei Chew +4 more
wiley +1 more source
This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Algebraic classification of spacetimes using discriminating scalar curvature invariants [PDF]
The Weyl and Ricci tensors can be algebraically classified in a Lorentzian spacetime of arbitrary dimensions using alignment theory. Used in tandem with the boost weight decomposition and curvature operators, the algebraic classification of the Weyl ...
Coley, Alan, Hervik, Sigbjorn
core
Optimal model‐based design of experiments for parameter precision: Supercritical extraction case
Abstract This study investigates the process of chamomile oil extraction from flowers. A parameter‐distributed model consisting of a set of partial differential equations is used to describe the governing mass transfer phenomena in a cylindrical packed bed with solid chamomile particles under supercritical conditions using carbon dioxide as a solvent ...
Oliwer Sliczniuk, Pekka Oinas
wiley +1 more source
A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits
In this paper we study the complexity of constructing a hitting set for the closure of VP, the class of polynomials that can be infinitesimally approximated by polynomials that are computed by polynomial sized algebraic circuits, over the real or complex
Bläser Markus +3 more
core +1 more source
Asymptotic properties of cross‐classified sampling designs
Abstract We investigate the family of cross‐classified sampling designs across an arbitrary number of dimensions. We introduce a variance decomposition that enables the derivation of general asymptotic properties for these designs and the development of straightforward and asymptotically unbiased variance estimators.
Jean Rubin, Guillaume Chauvet
wiley +1 more source
NEGATIVE THEOREM FOR LP,0 Journal of Kufa for Mathematics and Computer, 2017
For a given nonnegative integer number n, we can find a monotone function f depending on n, defined on the interval I=[-1,1], and an absolute constant c>0, satisfying the following relationship:
(2〖E_n (f Ì )〗_p)/(n+1)^3 ≤〖E_(n+1)^1 (f)〗_pâ ...
GHAZI ABDULLAH Madlol
doaj +1 more source
Arithmetic Nullstellensatz and Nonstandard Methods [PDF]
In this study we find height bounds for polynomial rings over integral domains. We apply nonstandard methods and hence our constants will be ineffective.
Göral, Haydar
core
Self‐Similar Blowup for the Cubic Schrödinger Equation
ABSTRACT We give a rigorous proof for the existence of a finite‐energy, self‐similar solution to the focusing cubic Schrödinger equation in three spatial dimensions. The proof is computer‐assisted and relies on a fixed point argument that shows the existence of a solution in the vicinity of a numerically constructed approximation.
Roland Donninger, Birgit Schörkhuber
wiley +1 more source

