Results 71 to 80 of about 31,396 (204)
Journal of Geophysical Research: Solid Earth, Volume 131, Issue 2, February 2026.Abstract We present the first micromagnetic simulations for sub‐micron monoclinic 4C pyrrhotite (Fe7S8 ${\text{Fe}}_{7}{\mathrm{S}}_{8}$), a common mineral in rocks and sediments and an important mineral in paleomagnetic studies. Previous experimental studies on the magnetic properties of pyrrhotite had limited control over granulometry and focused ...
Wyn Williams +6 more
wiley +1 more source
On Integer Numbers with Locally Smallest Order of Appearance in the Fibonacci Sequence
International Journal of Mathematics and Mathematical Sciences, 2011 Let Fn be the nth Fibonacci number. The order of appearance z(n) of a natural number n is defined as the smallest natural number k such that n divides Fk. For instance, for all n=Fm≥5, we have z(n−1)>z(n)
Diego Marques
doaj +1 more source
Entanglement in Quantum Systems Based on Directed Graphs
Advanced Quantum Technologies, Volume 9, Issue 1, January 2026.The entanglement properties of quantum states associated with directed graphs are investigated. It is proved that the vertex degree distribution fully determines this entanglement measure, which remains invariant under vertex relabeling, thereby highlighting its topological character.
Lucio De Simone, Roberto Franzosi
wiley +1 more source
A contribution to the connections between Fibonacci Numbers and Matrix Theory [PDF]
, 2013 We present a lovely connection between the Fibonacci numbers and the sums of inverses of $(0,1)-$ triangular matrices, namely, a number $S$ is the sum of the entries of the inverse of an $n \times n$ $(n \geq 3)$ $(0,1)-$ triangular matrix iff $S$ is an ...
Berman, Abraham, Farber, Miriam
core
Automating Algorithm Experiments With ALGator: From Problem Modeling to Reproducible Results
Software: Practice and Experience, Volume 56, Issue 1, Page 26-41, January 2026.ABSTRACT Background Theoretical algorithm analysis provides fundamental insights into algorithm complexity but relies on simplified and often outdated computational models. Experimental algorithmics complements this approach by evaluating the empirical performance of algorithm implementations on real data and modern computing platforms.
Tomaž Dobravec
wiley +1 more source
Fibonacci factoriangular numbers
Indagationes Mathematicae, 2017 A recent conjecture is proved asserting that \(2, 5\), and \(34\) are the only Fibonacci numbers that are of the form \(n! + n(n+1)/2\) for some integer \(n\). The main tool to prove it is an upper bound for a non-zero \(p\)-adic linear form in two logarithms of algebraic numbers.
Gómez Ruiz, C. +1 more
openaire +4 more sources
Subtree weight ratios for optimal binary search trees [PDF]
, 1986 For an optimal binary search tree T with a subtree S(d) at a distance d from the root of T, we study the ratio of the weight of S(d) to the weight of T.
Hirschberg, D. S. +2 more
core +2 more sources
FPGA Realization of a Novel Hyperchaos Augmented Image Encryption Algorithm
IET Computers &Digital Techniques, Volume 2026, Issue 1, 2026.With the rapid growth of multimedia communication, protecting image data has become increasingly critical. This article proposes a novel 3‐stage hyperchaos‐based augmented image encryption technique (3SHAIET) that utilizes a three‐stage process with chaotic systems of increasing dimensionality (e.g., six‐dimensional [6D], 8D, and 9D) to enhance ...
Wassim Alexan +6 more
wiley +1 more source
Encrypt Anything: A Content‐Aware Hierarchical Privacy Protection Method for Image Data
IET Computer Vision, Volume 20, Issue 1, January/December 2026.This paper proposes the Encrypt Anything Model (EAM), a content‐aware hierarchical privacy protection method that integrates the Segment Anything Model (SAM) and Grounding‐DINO to automatically detect and segment privacy entities in images. EAM dynamically adjusts the encryption granularity according to the sensitivity level of privacy and introduces a
Jiawei Han +5 more
wiley +1 more source
Grid classes and the Fibonacci dichotomy for restricted permutations
, 2006 We introduce and characterise grid classes, which are natural generalisations of other well-studied permutation classes. This characterisation allows us to give a new, short proof of the Fibonacci dichotomy: the number of permutations of length n in a ...
Huczynska, Sophie, Vatter, Vincent
core