相关论文: On a generalization of the Gauss's formula

A multivariate Gauss-Lucas theorem is proved, sharpening and generalizing previous results on this topic. The theorem is stated in terms of a seemingly new notion of convexity. Applications to multivariate stable polynomials are given.

In this note, we provide refined estimates of the following sums involving the Euler totient function: $$\sum_{n\le x} \phi\left(\left[\frac{x}{n}\right]\right) \qquad \text{and} \qquad \sum_{n\le x} \frac{\phi([x/n])}{[x/n]}$$ where $[x]$…

We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…

We generalize Gassert-Shor formula for numerical semigroups.

We analyze a system of linear algebraic equations whose solutions lead to a proof of a generalization of Boole's formula. In particular, our approach provides an elementary and short alternative to Katsuura's proof of this generalization.

In this paper, we find a new recurrence formula fo the Euler zeta functions.

The generalized number-theoretic transformation (NPT) is formulated on the basis of the exponential function theorem, which allows us to replace operations modulo the expression as a whole by modulo operations on the exponent of this…

In this paper, by using analytical methods we obtain a generalization of the famous Kodaira embedding theorem.

Using a remainder theorem for valuations of a field, we give a new perspective on the norm function of a global field. We define the Euler totient function of a global field and recover the essential analytical properties of the classical…

We develop a generalised gauge theory in which the role of gauge group is played by a coalgebra and the role of principal bundle by an algebra. The theory provides a unifying point of view which includes quantum group gauge theory,…

In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…

Frobenius built a representation theory of finite groups in the process of obtaining the irreducible factorization of the group determinant. Here, we give a generalization of Frobenius' theorem. The generalization leads to a corollary on…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.

We generalize certain totient functions using elementary symmetric polynomials and derive explicit product forms for the totient functions involving the second elementary symmetric sum. This work follows from the work of Toth [The Ramanujan…

In this paper we review the extent to which one can use classical distribution theory in describing solutions of Einstein's equations. We show that there are a number of physically interesting cases which cannot be treated using…

In this article, we present a new two-dimensional generalization of the gamma function based on the product of the one-dimensional generalized beta function and the one-dimensional generalized gamma function. As will become clear later,…

In this paper we give a generalization of Iseki's formula and use it to prove the transformation law of $\theta_1(z, \tau)$.

In an earlier paper, we gave an abstract formulation of a theorem of Sierpi\'nski in uncountable commutative groups. In this paper, we prove a result which generalizes the earlier formulation.

The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…