Results 61 to 70 of about 717 (218)
Zarankiewicz bounds from distal regularity lemma
Abstract Since Kővári, Sós and Turán proved upper bounds for the Zarankiewicz problem in 1954, much work has been undertaken to improve these bounds, and some have done so by restricting to particular classes of graphs. In 2017, Fox, Pach, Sheffer, Suk and Zahl proved better bounds for semialgebraic binary relations, and this work was extended by Do in
Mervyn Tong
wiley +1 more source
The generalized order-k Fibonacci–Pell sequence by matrix methods
In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, then we define a new recurrence, which we call generalized order-k F–P sequence.
Kilic, Emrah
core +1 more source
Entanglement in Quantum Systems Based on Directed Graphs
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
On the intersection of two distinct $k$-generalized Fibonacci sequences [PDF]
summary:Let $k\geq 2$ and define $F^{(k)}:=(F_n^{(k)})_{n\geq 0}$, the $k$-generalized Fibonacci sequence whose terms satisfy the recurrence relation $F_n^{(k)}=F_{n-1}^{(k)}+F_{n-2}^{(k)}+\cdots + F_{n-k}^{(k)}$, with initial conditions $0,0,\dots ,0,1$
Marques, Diego, Max A. Alekseyev
core +1 more source
Encrypt Anything: A Content‐Aware Hierarchical Privacy Protection Method for Image Data
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
Device‐Independent Quantum Key Distribution: Protocols, Quantum Games and Security
Device‐independent quantum key distribution (DIQKD) removes the need to trust internal device behaviour by certifying security through Bell‐inequality violations, thereby closing practical loopholes in conventional QKD. This paper systematically reviews DIQKD foundations (Bell tests and security definitions), protocol frameworks (CHSH‐based and ...
Syed M. Arslan +3 more
wiley +1 more source
Cholesky Factorization of the Generalized Symmetric k- Fibonacci Matrix
Matrix methods are a useful tool while dealing with many problems stemming from linear recurrence relations. In this paper, we discuss factorizations and inverse factorizations of two kinds of generalized k-Fibonacci matrices.
Köme, Cahit, Cahit KÖME
core +1 more source
Dual Proximal Groups Concisely Representing Complex Hosoya Triangles
This paper introduces dual proximal groups (DPGs) that provide concise representation of complex Hosoya triangles (CHTs). An application is given in terms of the DPG representation of collections of Hosoya‐Hilbert circular triangles on modulated motion waveforms in sequences of video frames. MSC2020 Classification: 11B39,54E05,57S25.
Kübra Gül +3 more
wiley +1 more source
This paper describes the theory, method and customary knowledge behind the design of a global systems change network grounded in Indigenous relational processes. The project leverages nested cohorts of human and nonhuman agents, affiliated through ancient borderwork protocols within biocultural governance structures.
T. Yunkaporta +4 more
wiley +1 more source
Formula for the $n$th $k$-Generalized Fibonacci-like Number
In this paper we provided a formula for the $n$th term of the $k$-generalized Fibonacci-like sequence, a generalization of the well-known Fibonacci sequence, having $k$ arbitrary initial terms, where the succeeding terms are obtained by adding its ...
Balsomo, Alexander J. +4 more
core

