Results 21 to 30 of about 128 (124)

Traces of Hecke operators on Drinfeld modular forms for GL2(Fq[T])$\operatorname{GL}_2(\mathbb {F}_q[T])$

open access: yesMathematika, Volume 72, Issue 2, April 2026.
Abstract In this paper, we study traces of Hecke operators on Drinfeld modular forms of level 1 in the case A=Fq[T]$A = \mathbb {F}_q[T]$. We deduce closed‐form expressions for traces of Hecke operators corresponding to primes of degree at most 2 and provide algorithms for primes of higher degree.
Sjoerd de Vries
wiley   +1 more source

An algorithm for complex factorization of the bi-periodic Fibonacci and Lucas polynomials [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
In this paper, we consider the factorization of generalized sequences, by employing a method based on trigonometric identities. The new method is of reduced complexity and represents an improvement compared to existing results.
Baijuan Shi, Can Kızılateş
doaj   +1 more source

Zarankiewicz bounds from distal regularity lemma

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 3, March 2026.
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

Design of Iterative MDS Matrices Based on MISTY Structure

open access: yesIET Information Security, Volume 2026, Issue 1, 2026.
The security of symmetric‐key ciphers critically depends on the diffusion efficiency of their linear components. Iterative maximum distance separable (MDS) matrices, as fundamental elements of diffusion layer, play a pivotal role in constructing secure cryptographic systems.
Guoqiang Liu   +5 more
wiley   +1 more source

GENERALIZED IDENTITIES OF BIVARIATE FIBONACCI AND BIVARIATE LUCAS POLYNOMIALS

open access: yesJournal of Amasya University the Institute of Sciences and Technology, 2020
In this paper, we present generalized identities of bivariate Fibonacci polynomials and bivariate Lucas polynomials and related identities consisting even and odd terms. Binet’s formula will employ to obtain the identities.
Jaya Bhandari   +2 more
doaj  

Cryptography using Fibonacci-Mersenne and Fibonacci-balancing p-sequences with a self-invertible matrix and the Affine-Hill cipher [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
In this paper, we define two new sequences using the Fibonacci p-numbers, the generalized Mersenne numbers, and m-balancing numbers. These sequences are obtained from the corresponding characteristic polynomials.
Elahe Mehraban   +3 more
doaj   +1 more source

An efficient numerical scheme based on Lucas polynomials for the study of multidimensional Burgers-type equations

open access: yesAdvances in Difference Equations, 2021
We propose a polynomial-based numerical scheme for solving some important nonlinear partial differential equations (PDEs). In the proposed technique, the temporal part is discretized by finite difference method together with θ-weighted scheme.
Ihteram Ali   +3 more
doaj   +1 more source

Computational Experiments with the Roots of Fibonacci-like Polynomials as a Window to Mathematics Research

open access: yesAxioms, 2022
Fibonacci-like polynomials, the roots of which are responsible for a cyclic behavior of orbits of a second-order two-parametric difference equation, are considered.
Sergei Abramovich   +2 more
doaj   +1 more source

Capacitated Vehicle Routing Problems With Three‐Dimensional Loading Constraints: A Systematic Review and New Taxonomy

open access: yesIET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.
This article provides a comprehensive review of studies on the 3L‐CVRP (capacitated vehicle routing problem with three‐dimensional loading constraints) published from 2006 to 2026. It systematically classifies problem variants, modelling frameworks, and solution approaches, while also summarising benchmark instances.
Jushang Chi, Rui Song, Shiwei He
wiley   +1 more source

Memory‐Driven Multi‐Objective Optimisation for Diverse Subway Route Recommendation

open access: yesIET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.
Traditional single‐objective path planning algorithms frequently fail to address the multidimensional and diverse demands of modern urban subway passengers. To overcome this limitation, the authors propose a multi‐objective optimisation framework that integrates the A* and Yen's K shortest path algorithms while explicitly incorporating passenger memory
Jianlin Jia   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy