Results 111 to 120 of about 4,353,527 (290)

Schubert polynomials, Kazhdan–Lusztig basis and characters

Discrete Mathematics, 2000
This fine paper delivers a combinatorial formula for the characters of the homogeneous components of the coinvariant algebra---\(\mathbb{Q}[x_1,\dots, x_n]\) factored out by those polynomials invariant under the action of the symmetric group with no constant term.
openaire   +1 more source

Data‐Driven and Physics‐Informed Modeling Perspectives for Soft Manipulators: From SINDy to Hybrid Intelligence

Advanced Science, EarlyView.
This Perspective charts the modeling landscape for soft manipulators, spanning sparse system identification, neural dynamics, physics‐informed models and hybrid intelligence. We examine how physics, data, sensing, adaptation and control can assume complementary roles within this landscape, and provide a framework for selecting modeling approaches ...
Wenbo Hui, Yunyi Wang, Teng Zhang, Yang Chen, Min Pan   +4 more
wiley   +1 more source

Accelerating High‐Fidelity Airfoil Design via Physics‐Informed Video Diffusion Model

Advanced Science, EarlyView.
Physics‐informed video diffusion enables rapid inverse aerodynamic design by mapping target lift‐to‐drag response to airfoil geometries and full‐field flow distributions. Trained on 53 400 DNS samples, the model achieves over 90% fidelity with ∼30 s inference, while experimentally realized propeller designs demonstrate a practical pathway from ...
Yifeng Ai, Yijia Guo, Hongfu Zhang, Lei Zhou, Tiejun Huang, Weiqiu Chen, Xuhui He, Peng Guo, C. W. Lim, Lei Ma   +9 more
wiley   +1 more source

Polynomial Approximation over Arbitrary Shape Domains

Mathematical and Computational Applications
In spectral/finite element methods, a robust and stable high-order polynomial approximation method for the solution can significantly reduce the required number of degrees of freedom (DOFs) to achieve a certain level of accuracy.
Mohammad J. Mahtabi, Arash Ghasemi, Amirehsan Ghasemi, James C. Newman   +3 more
doaj   +1 more source

Cryptosystem Over Binary Galois Fields in

, 2008
—Elliptic Curve Cryptography has many features that distinguish it from other cryptosystems, one of which is that it is still relatively new cryptosystem. As such, many improvements in performance have been discovered during the last few years for Galois
Polynomial Bases
core  

Nonstoichiometric Defect Engineering in Mn2+‐Doped MgGa2O4 Persistent Phosphors Toward Enhanced Luminescence and Multimodal Optical Manometry

Advanced Science, EarlyView.
Mg2+ deficiency transforms Mn2+‐doped MgGa2O4 into a multifunctional persistent phosphor, enhancing green emission, thermal stability, and afterglow effect for optical anti‐counterfeiting. Under compression, spectral shifts enable visual pressure sensing with a sensitivity of 5.01 nm GPa−1 over a pressure range up to 30 GPa.
Peng Du, Yifei Yu, Yue Guo, Przemysław Woźny, Shualing Ma, Laihui Luo, Marcin Runowski   +6 more
wiley   +1 more source

More on Codes Over Finite Quotients of Polynomial Rings

IEEE Access
Let $q=p^{r}$ be a prime power, ${\mathbb {F}}_{q}$ be the finite field of order q and $f(x)$ be a monic polynomial in ${\mathbb {F}}_{q}[x]$ . Set ${\mathbb {A}}:={\mathbb {F}}_{q}[x]/{\left \lt {{ f(x) }}\right \gt }$ .
Emad Kadhim Al-Lami, Reza Sobhani, Alireza Abdollahi, Javad Bagherian   +3 more
doaj   +1 more source

Low‐Power Control Of Resistance Switching Transitions in First‐Order Memristors

Advanced Electronic Materials, EarlyView.
Joule losses are a serious concern in modern integrated circuit design. In this regard, minimizing the energy necessary for programming memristors should be handled with care. This manuscript presents an optimal control framework, allowing to derive energy‐efficient programming voltage protocols for resistance switching devices. Following this approach,
Valeriy A. Slipko, Alon Ascoli, Fernando Corinto, Yuriy V. Pershin   +3 more
wiley   +1 more source

A verified factorization algorithm for integer polynomials with polynomial complexity [PDF]

, 2018
Short vectors in lattices and factors of integer polynomials are related. Each factor of an integer polynomial belongs to a certain lattice. When factoring polynomials, the condition that we are looking for an irreducible polynomial means that we must ...
Yamada, Akihisa, Jose Divasón [0000-0002-5173-128X], Sebastiaan Joosten, Akihisa Yamada, Divasón, Jose, René Thiemann, Joosten, Sebastiaan, Thiemann, René   +7 more
core   +1 more source

Solving systems of polynomial equations using Gröbner basis calculations with applications to mechanics

Computer Assisted Methods in Engineering and Science, 2023
Solving systems of algebraic equations is presented using the Gröbner Basis Package of the computer algebra system MAPLE V. The Grobner basis computations allow exact conclusions on the solutions of sets of polynomial equations, such as to decide if the
György Popper
doaj