Related papers: The gamma function and a certain sequence of diffe…
We propose an algorithm for reduction of the problem of maximization of fraction of two functionals to the equivalent procedure including maximization of difference between the functionals and the solution of an equation of scalar unknown.…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
In this paper, we state a conjecture on the prime factorization of numbers of the form $n!+1$, explore its implications, and compare it with empirical evidence and established results based on the $abc$ conjecture.
We characterize the bialgebraic varieties of the $\Gamma$ function, that is, if $V,W\subseteq\mathbb{C}^n$ are irreducible affine algebraic variety which satisfy $\dim V =\dim W$ and $\Gamma(V)\subseteq W$, then the equations defining $V$…
This paper is devoted to the study of generalized differentiation properties of the infimal convolution. This class of functions covers a large spectrum of nonsmooth functions well known in the literature. The subdifferential formulas…
In this paper, we study some properties of multivariate gamma function and zonal polynomials.
In this paper, we discuss a method that utilizes the recurrence of $A_{n,k}$ to solve summations of the form $\sum_{k=n_0}^{n} A_{n,k}$. It is observed that by repeating the procedure, the upper bound of summation is reduced and tilts…
In this paper we consider some analytical relations between gamma function $\Gamma(z)$ and related functions such as the Kurepa's function $K(z)$ and alternating Kurepa's function $A(z)$. It is well-known in the physics that the Casimir…
We consider the variance of sums of arithmetic functions over random short intervals in the function field setting. Based on the analogy between factorizations of random elements of $\mathbb{F}_q[T]$ into primes and the factorizations of…
We investigate lower bounds for the variance in arithmetic progressions of certain multiplicative functions "close" to $1$. Specifically, we consider $\alpha_N$-fold divisor functions, when $\alpha_N$ is a sequence of positive real numbers…
Factor analysis aims to describe high dimensional random vectors by means of a small number of unknown common factors. In mathematical terms, it is required to decompose the covariance matrix $\Sigma$ of the random vector as the sum of a…
The degree of a polynomial representing (or approximating) a function f is a lower bound for the number of quantum queries needed to compute f. This observation has been a source of many lower bounds on quantum algorithms. It has been an…
Query complexity is a model of computation in which we have to compute a function $f(x_1, \ldots, x_N)$ of variables $x_i$ which can be accessed via queries. The complexity of an algorithm is measured by the number of queries that it makes.…
In this paper we make a first attempt at understanding how to build an optimal approximate normal factor analysis model. The criterion we have chosen to evaluate the distance between different models is the I-divergence between the…
Several physics-based algorithms for factorizing large number were recently published. A notable recent one by Schleich et al. uses Gauss sums for distinguishing between factors and non-factors. We demonstrate two NMR techniques that…
Different questions lead to the same class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying $f(a)-f(b)\equiv0 \pmod {(a-b)}$ for all $a>b$. We characterize this class of functions…
The remarkable results for denoising in computer vision using diffusion models given in \cite{SDWMG,HJA,HHG} yield a robust mathematical justification for algorithms based on crucial properties of a sequence of Gaussian independent $N(0,1)$…
We present a new alternative theorems for sequences of functions. As applications, we extend recent results in the literature related to first-order necessary conditions for optimality problems. Our contributions involve extending…
We exploit the properties of a sequence of functions that approximate the divisor functions and combine them with an analytical formula of a delta-like sequence to give a new proof of a theorem of Gronwall on the asymptotic of the divisor…
In this work we look at the original fractional calculus of variations problem in a somewhat different way. As a simple consequence, we show that a fractional generalization of a classical problem has a solution without any restrictions on…