Results 101 to 110 of about 3,573,561 (343)
Fibonacci number of the tadpole graph
In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2) and the Fibonacci number of the cycle ...
Joe DeMaio, John Jacobson
doaj +1 more source
Spintronic Memtransistor Leaky Integrate and Fire Neuron for Spiking Neural Networks
Spintronic memtransistor neurons based on domain walls enable energy‐efficient, field‐gated, and current‐controlled LIF functionality for neuromorphic computing, as demonstrated. When integrated into spiking neural network architectures, these devices achieve >96% pattern recognition accuracy, demonstrating high performance, scalability, and mem ...
Aijaz H. Lone+7 more
wiley +1 more source
Embedding integrable superspin chain in string theory
Using results on topological line defects of 4D Chern-Simons theory and the algebra/cycle homology correspondence in complex surfaces S with ADE singularities, we study the graded properties of the sl(m|n) chain and its embedding in string theory ...
Y. Boujakhrout+3 more
doaj
Real normalized differentials and Arbarello's conjecture
Using meromorphic differentials with real periods, we prove Arbarello's conjecture: any compact complex cycle of dimension $g-n$ in the moduli space $\M_g$ of smooth genus $g$ algebraic curves must intersect the locus of curves having a Weierstrass point
Krichever, I.
core +1 more source
Abstract The modernization of pharmaceutical manufacturing is driving a shift from traditional batch processing to continuous alternatives. Synthesizing end‐to‐end optimal (E2EO) manufacturing routes is crucial for the pharmaceutical industry, especially when considering multiple operating modes—such as batch, continuous, or hybrid (containing both ...
Yash Barhate+4 more
wiley +1 more source
Tempered Representations and Nilpotent Orbits [PDF]
Given a nilpotent orbit O of a real, reductive algebraic group, a necessary condition is given for the existence of a tempered representation pi such that O occurs in the wave front cycle of pi.
Harris, Benjamin
core
A proof of Perko's conjectures for the Bogdanov-Takens system
The Bogdanov-Takens system has at most one limit cycle and, in the parameter space, it exists between a Hopf and a saddle-loop bifurcation curves. The aim of this paper is to prove the Perko's conjectures about some analytic properties of the saddle-loop
Gasull, Armengol+3 more
core +3 more sources
In Situ Graph Reasoning and Knowledge Expansion Using Graph‐PRefLexOR
Graph‐PRefLexOR is a novel framework that enhances language models with in situ graph reasoning, symbolic abstraction, and recursive refinement. By integrating graph‐based representations into generative tasks, the approach enables interpretable, multistep reasoning.
Markus J. Buehler
wiley +1 more source
The method of probabilistic-algebraic simulation driven technological production processes with the potential danger elements, based on the conduct of proactive modeling using parameterized probabilistic-algebraic models is described, which is used for ...
V. S. Smorodin+2 more
doaj
On the number of limit cycles of the Lienard equation
In this paper, we study a Lienard system of the form dot{x}=y-F(x), dot{y}=-x, where F(x) is an odd polynomial. We introduce a method that gives a sequence of algebraic approximations to the equation of each limit cycle of the system. This sequence seems
A. Liénard+26 more
core +2 more sources