Related papers: Neighboring Fractions in Farey Subsequences
The aim of this work is to prove that the connected parts of Farey complex structure in plane are triangles or quadrangles. To do this work we go back to plane convex polygones with oriented edge for wich we prove that if two consecutive…
The Neighbor-Joining algorithm is a recursive procedure for reconstructing trees that is based on a transformation of pairwise distances between leaves. We present a generalization of the neighbor-joining transformation, which uses…
We prove a continued fraction expansion for the reciprocal of a certain $q$-series. All the specialists in the world are asked whether it is new or not.
In this paper, the regularized trace formulas for a diffusion operator which include conformable fractional derivatives of order {\alpha} (0<{\alpha \leq 1}) is obtained.
In this didactic note, we describe a procedure to derive successive approximations of $\pi$ using Euler Beta functions. It is an interesting exercise for undergraduate students, since it involves polynomial roots, integral calculations,…
We present a simple and fast algorithm for the computation of the coefficients of the expansion of a function f(cos u) in ultraspherical (Gegenbauer) polynomials. We prove that these coefficients coincide with the Fourier coefficients of an…
Diffusive representations of fractional derivatives have proven to be useful tools in the construction of fast and memory efficient numerical methods for solving fractional differential equations. A common challenge in many of the known…
This paper proves that two differently defined rooted binary trees are isomorphic. The first tree is one associated to a version of Farey sequences where the vertices correspond to the open intervals formed by two successive terms in the…
In this paper, we introduce two new non-singular kernel fractional derivatives and present a class of other fractional derivatives derived from the new formulations. We present some important results of uniformly convergent sequences of…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier -- classification is achieved by identifying the nearest neighbours to a query example and using those neighbours…
We present a derivation of the gradients of feedforward neural networks using Fr\'echet calculus which is arguably more compact than the ones usually presented in the literature. We first derive the gradients for ordinary neural networks…
We present a new variant of the Faa di Bruno formula with a simpler summation order.
For $1$-periodic functions $f$ satisfying only a weak local regularity assumption of Dini's type at rational points of $]0,1[$, we study the Farey sums $$F_n(f)= \sum_{\frac{\k}{\l}\in \F_n} f\big(\frac{\k}{\l}\big),\qq F_{n,\s}(f)=…
We give an elementary proof of an analogue of Fej\'er's theorem in weighted Dirichlet spaces with superharmonic weights. This provides a simple way of seeing that polynomials are dense in such spaces.
To precondition a large and sparse linear system, two direct methods for approximate factoring of the inverse are devised. The algorithms are fully parallelizable and appear to be more robust than the iterative methods suggested for the…
We give a formula for the coefficients of the Yablonskii-Vorob'ev polynomial. Also the reduction modulo a prime number of the polynomial is studied.
For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…
We study the explicit formula of Euler numbers and polynomials of higher order
In this note we prove an explicit binomial formula for Jack polynomials and discuss some applications of it.