Related papers: An Equivalent Representation of Generalized Differ…

In the present article, a new method for the evaluation of fractional derivatives of arbitrary real order is proposed. Numerous but inequivalent formulations have been given in the past. Some of them exhibit unsatisfactory properties such…

A general description of the Vi\`ete coefficients of the gaussian period polynomials is given, in terms of certain symmetric representations of the subgroups and the corresponding quotient groups of the multiplicative group…

We are interested in determining the bound of the average of the degrees of the irreducible characters whose degrees are not divisible by some prime $p$ that guarantees a finite group $G$ of odd order is $p$-nilpotent. We find a bound that…

In this paper, we present finite element approximations of a class of Generalized random fields defined over a bounded domain of R d or a smooth d-dimensional Riemannian manifold (d $\ge$ 1). An explicit expression for the covariance matrix…

We address composite optimization problems, which consist in minimizing the sum of a smooth and a merely lower semicontinuous function, without any convexity assumptions. Numerical solutions of these problems can be obtained by proximal…

Given a polynomial with integral coefficients, one can inquire about the possible residues it can take in its image modulo a prime $p$. The sum over the distinct residues can sometimes be computed independent of the prime $p$; for example,…

We study incommensurate fractional variational problems in terms of a generalized fractional integral with Lagrangians depending on classical derivatives and generalized fractional integrals and derivatives. We obtain necessary optimality…

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

We prove maximum and comparison principles for fractional discrete derivatives in the integers. Regularity results when the space is a mesh of length $h$, and approximation theorems to the continuous fractional derivatives are shown. When…

Using the formalism of polynomials with positive coefficients, the fact that exactly half of all subsets of a finite set have even cardinality can be generalized asymptotically.

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

In this study, depending on the upper and the lower indices of the hyperharmonic number $h_{n}^{(r)}$, nonlinear recurrence relations are obtained. It is shown that generalized harmonic number and hyperharmonic number can be obtained from…

Using the adjoint action of the infinitesimal translations (with respect to some (in)dependant variables) on specific finite-dimensional subspaces of the space of generalized symmetries of some system of partial differential equations, we…

The auxiliary field method is a technique to obtain approximate closed formulae for the solutions of both nonrelativistic and semirelativistic eigenequations in quantum mechanics. For a many-body Hamiltonian describing identical particles,…

We propose higher-order generalizations of Jacobsthal's $p$-adic approximation for binomial coefficients. Our results imply explicit formulae for linear combinations of binomial coefficients $\binom{ip}{p}$ ($i=1,2,\dots$) that are…

We present a theory for simultaneous approximation of the score function and its derivatives, enabling the handling of data distributions with low-dimensional structure and unbounded support. Our approximation error bounds match those in…

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

We compute the uniform probability that finitely many polynomials over a finite field are pairwise coprime and compare the result with the formula one gets using the natural density as probability measure. It will turn out that the formulas…

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…