Results 61 to 70 of about 1,823 (264)
Complexity of Some Duplicating Networks
There are plentiful ways to duplicate a graph (network), such as splitting, shadow, mirror, and total graph. In this paper, we derive an evident formula of the complexity, a number of spanning trees, of the closed helm graph, the mirror graph of the path
Mohamed R. Zeen El Deen +1 more
doaj +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
A construction of primitive polynomials over finite fields
In this work, a new construction based on companion matrices of primitive polynomials is provided. Given two primitive polynomials over the finite fields Fq and Fqb, we construct a ring isomorphism that transforms the companion matrix of the primitive ...
Climent, J.J., Cardell, S.D.
core +2 more sources
Computer algebra and transputers applied to the finite element method [PDF]
Recent developments in computing technology have opened new prospects for computationally intensive numerical methods such as the finite element method.
Barbier, Christine, Barbier, C
core
Pre‐Curved Everting Robots With Embedded Steering Intelligence Fabricated by CO2 Laser Welding
Design and experimental demonstration of a laser welded growing robot for anatomically guided navigation. The robot follows an aortic arch phantom entering the branchiocephalic branch through steering by design. The figure shows the physical phantom setup, CAD defined weld geometry and full robot eversion.
Brandon Saldarriaga +5 more
wiley +1 more source
Certain Relations of Gegenbauer and Modified Gegenbauer Matrix Polynomials by Lie Algebraic Method
The object of the present paper is to derive the generating formulae for the Gegenbauer and modified Gegenbauer matrix polynomials by introducing a partial differential operatorand constructing the Lie algebra representation formalism of special linear ...
Ayman Shehata
doaj
Elimination of Variables in Linear Solvable Polynomial Algebras and ∂-Holonomicity
Let \(A\) be a finitely generated algebra over a field \(k\) of characteristic \(0\), and fix a finite set \(a_1,\dots,a_n\) of generators. For each \(\alpha=(\alpha_1,\dots,\alpha_n)\in P\), the additive monoid of all vectors of integer non-negative components, we have the associated standard monomial \(a^\alpha=a_1^{\alpha_1}\cdots a_n^{\alpha_n ...
Huishi, Li, Van Oystaeyen, Freddy
openaire +1 more source
SiOx‐Based Probabilistic Bits Enabling Invertible Logic Gate for Cryptographic Applications
To enable lightweight hardware encryption and decryption, a Ti/SiOx/Ti threshold switching device is engineered to generate controllable stochastic oscillations. By tuning the input voltage, the device produces a programmable spike probability governed by intrinsic switching dynamics, enabling probabilistic bits that construct an invertible ...
Jihyun Kim, Hyeonsik Choi, Jiyong Woo
wiley +1 more source
Polynomial Systems Solving by Fast Linear Algebra
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to stick to the most general case, we consider a representation of the solutions from which one can easily recover the ...
Jean-Charles Faugère +3 more
openaire +2 more sources
ABSTRACT Efficient thermal management in advanced industrial systems requires improved heat transfer performance, particularly under non‐Newtonian fluid behavior and complex surface geometries. This study investigates the two‐dimensional flow and heat transfer characteristics of ternary hybrid nanofluids over both stationary and moving wedge surfaces ...
A. O. Akindele +4 more
wiley +1 more source

